{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6ISICEWWANG45EBWBEM7E4GXE4","short_pith_number":"pith:6ISICEWW","schema_version":"1.0","canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","source":{"kind":"arxiv","id":"1307.7442","version":1},"attestation_state":"computed","paper":{"title":"Compositionality of Approximate Bisimulation for Probabilistic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Gebler (Department of Computer Science, Simone Tini (Department of Scienza e Alta Tecnologia, University of Insubria), VU University Amsterdam)","submitted_at":"2013-07-29T02:10:27Z","abstract_excerpt":"Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respect to implementation and measurement errors of probabilistic behavior. We provide a general method to quantify how much a process combinator  expands the approximate bisimulation distance. As a direct a"},"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":"1307.7442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"bc1051b81d32143db1003117423c18193b6ba12bfc649c1a1b6a7d26293563ea","abstract_canon_sha256":"bc862fb6da8dcef97df10455d1cfafc38fa6534ba264941d2c0fba8e6b585e39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.283821Z","signature_b64":"qBGcziTsvG93Ht5LLxqDJplm4P7+8SXlbAhbF3ivnBeOcApQfyh+bYEGVHB/AhdDfdYjVPfqCcNXL78iZfvmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","last_reissued_at":"2026-05-18T03:17:23.283371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.283371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositionality of Approximate Bisimulation for Probabilistic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Gebler (Department of Computer Science, Simone Tini (Department of Scienza e Alta Tecnologia, University of Insubria), VU University Amsterdam)","submitted_at":"2013-07-29T02:10:27Z","abstract_excerpt":"Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respect to implementation and measurement errors of probabilistic behavior. We provide a general method to quantify how much a process combinator  expands the approximate bisimulation distance. As a direct a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7442","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":"1307.7442","created_at":"2026-05-18T03:17:23.283441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7442v1","created_at":"2026-05-18T03:17:23.283441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7442","created_at":"2026-05-18T03:17:23.283441+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ISICEWWANG4","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ISICEWWANG45EBW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ISICEWW","created_at":"2026-05-18T12:27:36.564083+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/6ISICEWWANG45EBWBEM7E4GXE4","json":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4.json","graph_json":"https://pith.science/api/pith-number/6ISICEWWANG45EBWBEM7E4GXE4/graph.json","events_json":"https://pith.science/api/pith-number/6ISICEWWANG45EBWBEM7E4GXE4/events.json","paper":"https://pith.science/paper/6ISICEWW"},"agent_actions":{"view_html":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4","download_json":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4.json","view_paper":"https://pith.science/paper/6ISICEWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7442&json=true","fetch_graph":"https://pith.science/api/pith-number/6ISICEWWANG45EBWBEM7E4GXE4/graph.json","fetch_events":"https://pith.science/api/pith-number/6ISICEWWANG45EBWBEM7E4GXE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/action/storage_attestation","attest_author":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/action/author_attestation","sign_citation":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/action/citation_signature","submit_replication":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/action/replication_record"}},"created_at":"2026-05-18T03:17:23.283441+00:00","updated_at":"2026-05-18T03:17:23.283441+00:00"}