{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:Z6RSMVWYOIKOXDX3VY6CU7OCZW","short_pith_number":"pith:Z6RSMVWY","schema_version":"1.0","canonical_sha256":"cfa32656d87214eb8efbae3c2a7dc2cd83c7a0fd6687b3bb923093294f665f04","source":{"kind":"arxiv","id":"0808.3651","version":3},"attestation_state":"computed","paper":{"title":"Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David N. Jansen, Friedrich Eisenbrand, Holger Hermanns, Lijun Zhang","submitted_at":"2008-08-27T08:35:44Z","abstract_excerpt":"Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak simulation over Markov chains, and for strong simulation over probabilistic automata are not efficient, which makes it as yet unclear whether they can be used as effectively as their non-probabilistic counterparts. This paper presents drastically improved algorithms to decide whether some (discrete- or continuous-time) Markov chain strongly or weakly simula"},"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":"0808.3651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-27T08:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"dd5dc264e31f370dc27d7f2637d4a9fbdde2cded957b493d992d727809954a47","abstract_canon_sha256":"e0307638ea2ce1b133a3e6efc1dee57d61711b45bc7c4f52dbf21f4c05f84303"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.346829Z","signature_b64":"xZMsxPwfvkOKyIDoBGdwp/ehN8PjhBrSvtgDImG3XpeGWiRamVwgJHNaFVf534UZyw3jYu6yQZoL2qUGnBm1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfa32656d87214eb8efbae3c2a7dc2cd83c7a0fd6687b3bb923093294f665f04","last_reissued_at":"2026-05-18T01:37:42.346166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.346166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David N. Jansen, Friedrich Eisenbrand, Holger Hermanns, Lijun Zhang","submitted_at":"2008-08-27T08:35:44Z","abstract_excerpt":"Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak simulation over Markov chains, and for strong simulation over probabilistic automata are not efficient, which makes it as yet unclear whether they can be used as effectively as their non-probabilistic counterparts. This paper presents drastically improved algorithms to decide whether some (discrete- or continuous-time) Markov chain strongly or weakly simula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3651","kind":"arxiv","version":3},"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":"0808.3651","created_at":"2026-05-18T01:37:42.346272+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.3651v3","created_at":"2026-05-18T01:37:42.346272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3651","created_at":"2026-05-18T01:37:42.346272+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6RSMVWYOIKO","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6RSMVWYOIKOXDX3","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6RSMVWY","created_at":"2026-05-18T12:25:58.018023+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/Z6RSMVWYOIKOXDX3VY6CU7OCZW","json":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW.json","graph_json":"https://pith.science/api/pith-number/Z6RSMVWYOIKOXDX3VY6CU7OCZW/graph.json","events_json":"https://pith.science/api/pith-number/Z6RSMVWYOIKOXDX3VY6CU7OCZW/events.json","paper":"https://pith.science/paper/Z6RSMVWY"},"agent_actions":{"view_html":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW","download_json":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW.json","view_paper":"https://pith.science/paper/Z6RSMVWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.3651&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6RSMVWYOIKOXDX3VY6CU7OCZW/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6RSMVWYOIKOXDX3VY6CU7OCZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW/action/storage_attestation","attest_author":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW/action/author_attestation","sign_citation":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW/action/citation_signature","submit_replication":"https://pith.science/pith/Z6RSMVWYOIKOXDX3VY6CU7OCZW/action/replication_record"}},"created_at":"2026-05-18T01:37:42.346272+00:00","updated_at":"2026-05-18T01:37:42.346272+00:00"}