{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YSDXWZJABUE2RHRPIFWZ3TL5UW","short_pith_number":"pith:YSDXWZJA","schema_version":"1.0","canonical_sha256":"c4877b65200d09a89e2f416d9dcd7da5a93e713cdaef4a5bc0c090ce543afdf1","source":{"kind":"arxiv","id":"1210.2273","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.2273","created_at":"2026-05-18T03:43:50.606884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2273v1","created_at":"2026-05-18T03:43:50.606884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2273","created_at":"2026-05-18T03:43:50.606884+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSDXWZJABUE2","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSDXWZJABUE2RHRP","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSDXWZJA","created_at":"2026-05-18T12:27:30.460161+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/YSDXWZJABUE2RHRPIFWZ3TL5UW","json":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW.json","graph_json":"https://pith.science/api/pith-number/YSDXWZJABUE2RHRPIFWZ3TL5UW/graph.json","events_json":"https://pith.science/api/pith-number/YSDXWZJABUE2RHRPIFWZ3TL5UW/events.json","paper":"https://pith.science/paper/YSDXWZJA"},"agent_actions":{"view_html":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW","download_json":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW.json","view_paper":"https://pith.science/paper/YSDXWZJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2273&json=true","fetch_graph":"https://pith.science/api/pith-number/YSDXWZJABUE2RHRPIFWZ3TL5UW/graph.json","fetch_events":"https://pith.science/api/pith-number/YSDXWZJABUE2RHRPIFWZ3TL5UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/action/storage_attestation","attest_author":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/action/author_attestation","sign_citation":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/action/citation_signature","submit_replication":"https://pith.science/pith/YSDXWZJABUE2RHRPIFWZ3TL5UW/action/replication_record"}},"created_at":"2026-05-18T03:43:50.606884+00:00","updated_at":"2026-05-18T03:43:50.606884+00:00"}