{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B23MM3I45MOOBQUJCV73X5JS6G","short_pith_number":"pith:B23MM3I4","schema_version":"1.0","canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","source":{"kind":"arxiv","id":"1807.05169","version":1},"attestation_state":"computed","paper":{"title":"Postselecting probabilistic finite state recognizers and verifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Abuzer Yakary{\\i}lmaz, Maksims Dimitrijevs","submitted_at":"2018-07-13T16:37:13Z","abstract_excerpt":"In this paper, we investigate the computational and verification power of bounded-error postselecting realtime probabilistic finite state automata (PostPFAs). We show that PostPFAs using rational-valued transitions can do different variants of equality checks and they can verify some nonregular unary languages. Then, we allow them to use real-valued transitions (magic-coins) and show that they can recognize uncountably many binary languages by help of a counter and verify uncountably many unary languages by help of a prover. We also present some corollaries on probabilistic counter automata."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.05169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T16:37:13Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"8213bc395ce191ea9fff3ac1a2c0a68c471ca51f605d9b020645692486867c45","abstract_canon_sha256":"b62b8017bf815a9713636812bbd44b812f572eacc16a6518026ab84573d9adc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.591288Z","signature_b64":"ceRWnWNQycrhLfUEDWkNEvTIshPp1+iGCA4qOlRt+VRLfbLy3r6HsUklwKTyvu7d1XejCb2azeJ/fXQbhoYiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","last_reissued_at":"2026-05-18T00:10:48.590619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.590619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Postselecting probabilistic finite state recognizers and verifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Abuzer Yakary{\\i}lmaz, Maksims Dimitrijevs","submitted_at":"2018-07-13T16:37:13Z","abstract_excerpt":"In this paper, we investigate the computational and verification power of bounded-error postselecting realtime probabilistic finite state automata (PostPFAs). We show that PostPFAs using rational-valued transitions can do different variants of equality checks and they can verify some nonregular unary languages. Then, we allow them to use real-valued transitions (magic-coins) and show that they can recognize uncountably many binary languages by help of a counter and verify uncountably many unary languages by help of a prover. We also present some corollaries on probabilistic counter automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05169","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.05169","created_at":"2026-05-18T00:10:48.590723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05169v1","created_at":"2026-05-18T00:10:48.590723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05169","created_at":"2026-05-18T00:10:48.590723+00:00"},{"alias_kind":"pith_short_12","alias_value":"B23MM3I45MOO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B23MM3I45MOOBQUJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B23MM3I4","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G","json":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G.json","graph_json":"https://pith.science/api/pith-number/B23MM3I45MOOBQUJCV73X5JS6G/graph.json","events_json":"https://pith.science/api/pith-number/B23MM3I45MOOBQUJCV73X5JS6G/events.json","paper":"https://pith.science/paper/B23MM3I4"},"agent_actions":{"view_html":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G","download_json":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G.json","view_paper":"https://pith.science/paper/B23MM3I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05169&json=true","fetch_graph":"https://pith.science/api/pith-number/B23MM3I45MOOBQUJCV73X5JS6G/graph.json","fetch_events":"https://pith.science/api/pith-number/B23MM3I45MOOBQUJCV73X5JS6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/action/storage_attestation","attest_author":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/action/author_attestation","sign_citation":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/action/citation_signature","submit_replication":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/action/replication_record"}},"created_at":"2026-05-18T00:10:48.590723+00:00","updated_at":"2026-05-18T00:10:48.590723+00:00"}