{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B23MM3I45MOOBQUJCV73X5JS6G","short_pith_number":"pith:B23MM3I4","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"},"canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","source":{"kind":"arxiv","id":"1807.05169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05169","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05169v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05169","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"B23MM3I45MOO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B23MM3I45MOOBQUJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B23MM3I4","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B23MM3I45MOOBQUJCV73X5JS6G","target":"record","payload":{"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"},"canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","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"},"source_kind":"arxiv","source_id":"1807.05169","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WL9Hya8RI8sTm1JoNjmpDumvMX9Dx7lwron1TwsQ+/4Yx/ysQh76c+Qpil9uRGj4PZTDd57p4Xbf+HD+TY+5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:23.097823Z"},"content_sha256":"4f49c12a57e5ad0ba535d5343304ec17cbd46917324a313a780f49b1f6995b85","schema_version":"1.0","event_id":"sha256:4f49c12a57e5ad0ba535d5343304ec17cbd46917324a313a780f49b1f6995b85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B23MM3I45MOOBQUJCV73X5JS6G","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN42JsnSNR0KyUAWPWFlZwiI7rBDq7KhKYzpgUefGqKIx3+XL4elzJRHZoqy5nX3iDH50BHArnkHHsxo0KljCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:23.098174Z"},"content_sha256":"7a6ecebcc71989219aebff3aba0c02d79cdbd3457e35f2d9b846ee165469a1c0","schema_version":"1.0","event_id":"sha256:7a6ecebcc71989219aebff3aba0c02d79cdbd3457e35f2d9b846ee165469a1c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/bundle.json","state_url":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B23MM3I45MOOBQUJCV73X5JS6G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T13:55:23Z","links":{"resolver":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G","bundle":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/bundle.json","state":"https://pith.science/pith/B23MM3I45MOOBQUJCV73X5JS6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B23MM3I45MOOBQUJCV73X5JS6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B23MM3I45MOOBQUJCV73X5JS6G","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b62b8017bf815a9713636812bbd44b812f572eacc16a6518026ab84573d9adc2","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T16:37:13Z","title_canon_sha256":"8213bc395ce191ea9fff3ac1a2c0a68c471ca51f605d9b020645692486867c45"},"schema_version":"1.0","source":{"id":"1807.05169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05169","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05169v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05169","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"B23MM3I45MOO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B23MM3I45MOOBQUJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B23MM3I4","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:7a6ecebcc71989219aebff3aba0c02d79cdbd3457e35f2d9b846ee165469a1c0","target":"graph","created_at":"2026-05-18T00:10:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Abuzer Yakary{\\i}lmaz, Maksims Dimitrijevs","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T16:37:13Z","title":"Postselecting probabilistic finite state recognizers and verifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05169","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f49c12a57e5ad0ba535d5343304ec17cbd46917324a313a780f49b1f6995b85","target":"record","created_at":"2026-05-18T00:10:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b62b8017bf815a9713636812bbd44b812f572eacc16a6518026ab84573d9adc2","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T16:37:13Z","title_canon_sha256":"8213bc395ce191ea9fff3ac1a2c0a68c471ca51f605d9b020645692486867c45"},"schema_version":"1.0","source":{"id":"1807.05169","kind":"arxiv","version":1}},"canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eb6c66d1ceb1ce0c289157fbbf532f19c589646c8a5d8eaaa67240d11b25cbd","first_computed_at":"2026-05-18T00:10:48.590619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.590619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ceRWnWNQycrhLfUEDWkNEvTIshPp1+iGCA4qOlRt+VRLfbLy3r6HsUklwKTyvu7d1XejCb2azeJ/fXQbhoYiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.591288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f49c12a57e5ad0ba535d5343304ec17cbd46917324a313a780f49b1f6995b85","sha256:7a6ecebcc71989219aebff3aba0c02d79cdbd3457e35f2d9b846ee165469a1c0"],"state_sha256":"27e0ffbbd205a75d30bbb273d75f308789fb14e59e991dedee5e96c3d53f703e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2H72CAf8lHSHp10tgisrDqg5WNvGO/cu4kDuz4j2IQwntpGJvCh94Af+c798JbScgPNKfVjE+Fv35R/hvDyxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:55:23.100294Z","bundle_sha256":"16a5e234f3af6721cc1424a6d73ad3a0922bf01992a5172a514a653b5c454081"}}