{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YSDXWZJABUE2RHRPIFWZ3TL5UW","short_pith_number":"pith:YSDXWZJA","canonical_record":{"source":{"id":"1210.2273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-08T13:37:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6d3428519ab3372fd6732c05c6a3645caaebea1e40e17e4b7560b37da4b0c163","abstract_canon_sha256":"fb85a2150e6083ec93c50f51d9dab2598db47a31499059d3437d838a6d96b6e4"},"schema_version":"1.0"},"canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","source":{"kind":"arxiv","id":"1210.2273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2273","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2273v1","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2273","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"YSDXWZJABUE2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YSDXWZJABUE2RHRP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YSDXWZJA","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YSDXWZJABUE2RHRPIFWZ3TL5UW","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-08T13:37:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6d3428519ab3372fd6732c05c6a3645caaebea1e40e17e4b7560b37da4b0c163","abstract_canon_sha256":"fb85a2150e6083ec93c50f51d9dab2598db47a31499059d3437d838a6d96b6e4"},"schema_version":"1.0"},"canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:50.607543Z","signature_b64":"NIj8d1+KUNvYXZTAl3eu4ojKldgAUBCEXpPlX5gpq7ZXLoCilKFuzdQcVP9OOioNFdQ0V3DlUo7IbuuX8WMkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","last_reissued_at":"2026-05-18T03:43:50.606762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:50.606762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2273","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-18T03:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHfMFYN8EUS0v4pWDI+FnHWemkiMU6/49oioCqK5H+ddikJIMhcWwVZbtqgTHEDaouzse0bzVbdUhoZfMetuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:19:21.404960Z"},"content_sha256":"d5b7a35d3d52040041ef4462522c2e94290bc5dbb93d7f11a3b3a1faaddd8756","schema_version":"1.0","event_id":"sha256:d5b7a35d3d52040041ef4462522c2e94290bc5dbb93d7f11a3b3a1faaddd8756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YSDXWZJABUE2RHRPIFWZ3TL5UW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bisimilarity of Probabilistic Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"James Worrell, Petr Jancar, Stefan Kiefer, Vojtech Forejt","submitted_at":"2012-10-08T13:37:12Z","abstract_excerpt":"We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bisimilarity of non-deterministic transition systems. This construction directly yields decidability of bisimilarity for pPDA, as well as an elementary upper bound for the bisimilarity problem on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2273","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-18T03:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccIOO2PG0qqYg2dLh5jdSNY9qYA083B2DtldjnfwgwDcsEZuwxpi6iv6wiYN7YOngH0ztlrAK4KpzzA7JQyDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:19:21.405644Z"},"content_sha256":"e02a17ae71dfd0dd71d6351ae70ef8badbb707431c2639e22ca1c011202951d4","schema_version":"1.0","event_id":"sha256:e02a17ae71dfd0dd71d6351ae70ef8badbb707431c2639e22ca1c011202951d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/bundle.json","state_url":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/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-05-24T00:19:21Z","links":{"resolver":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW","bundle":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/bundle.json","state":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YSDXWZJABUE2RHRPIFWZ3TL5UW","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":"fb85a2150e6083ec93c50f51d9dab2598db47a31499059d3437d838a6d96b6e4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-08T13:37:12Z","title_canon_sha256":"6d3428519ab3372fd6732c05c6a3645caaebea1e40e17e4b7560b37da4b0c163"},"schema_version":"1.0","source":{"id":"1210.2273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2273","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2273v1","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2273","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"YSDXWZJABUE2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YSDXWZJABUE2RHRP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YSDXWZJA","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e02a17ae71dfd0dd71d6351ae70ef8badbb707431c2639e22ca1c011202951d4","target":"graph","created_at":"2026-05-18T03:43:50Z","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":"We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bisimilarity of non-deterministic transition systems. This construction directly yields decidability of bisimilarity for pPDA, as well as an elementary upper bound for the bisimilarity problem on the","authors_text":"James Worrell, Petr Jancar, Stefan Kiefer, Vojtech Forejt","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-08T13:37:12Z","title":"Bisimilarity of Probabilistic Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2273","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:d5b7a35d3d52040041ef4462522c2e94290bc5dbb93d7f11a3b3a1faaddd8756","target":"record","created_at":"2026-05-18T03:43:50Z","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":"fb85a2150e6083ec93c50f51d9dab2598db47a31499059d3437d838a6d96b6e4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-08T13:37:12Z","title_canon_sha256":"6d3428519ab3372fd6732c05c6a3645caaebea1e40e17e4b7560b37da4b0c163"},"schema_version":"1.0","source":{"id":"1210.2273","kind":"arxiv","version":1}},"canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","first_computed_at":"2026-05-18T03:43:50.606762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:50.606762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIj8d1+KUNvYXZTAl3eu4ojKldgAUBCEXpPlX5gpq7ZXLoCilKFuzdQcVP9OOioNFdQ0V3DlUo7IbuuX8WMkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:50.607543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5b7a35d3d52040041ef4462522c2e94290bc5dbb93d7f11a3b3a1faaddd8756","sha256:e02a17ae71dfd0dd71d6351ae70ef8badbb707431c2639e22ca1c011202951d4"],"state_sha256":"9349240ee24813554bd3d8c5f4de060723b473bb4c62d44b53d399703efad29b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nk7OJE/O3Az3b7uyZ4VHDHDzS9mZ023GQoD5Hpjk+NjFy6hSXvwfXiVumlpUXJEIZe2UHttmz7/2Eg1doxOKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:19:21.408903Z","bundle_sha256":"851b4eaebbaf4fe18412ca14db09292716887200fb754f5637449bba4ce421ff"}}