{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XDBPFJ3DQX57HKFJPQZUUVDLEB","short_pith_number":"pith:XDBPFJ3D","schema_version":"1.0","canonical_sha256":"b8c2f2a76385fbf3a8a97c334a546b207d74ad2b8b7076d4341ac61823482cd8","source":{"kind":"arxiv","id":"1410.8314","version":3},"attestation_state":"computed","paper":{"title":"Cost Preserving Bisimulations for Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Andrea Turrini (State Key Laboratory of Computer Science, Beijing, China), Chinese Academy of Sciences, Germany), Holger Hermanns (Saarland University -- Computer Science, Institute of Software, Saarbruecken","submitted_at":"2014-10-30T10:26:58Z","abstract_excerpt":"Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper considers probabilistic automata augmented with costs. It extends the notions of weak transitions in probabilistic automata in such a way that the costs incurred along a weak transition are captured. This gives rise to cost-preserving and cost-bounding variations of weak probabilistic bisimilarity,"},"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":"1410.8314","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-30T10:26:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5ce574f6f0426b9035812e3d20d5200dcffa3fd70be57722d683d5cef586e762","abstract_canon_sha256":"4c85d0209d75bc8e0065f75f0e51ed01c688ad6e2644cf60f63ee0c5418b2c10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.497495Z","signature_b64":"VqQ+OQ2iTHTiEZMTPT4qQidfqgvxJyMZVQ24mpzO2EhekWnHone5aZRJvsl4HCVzynF3WUriJ0OYwHfW4JSfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c2f2a76385fbf3a8a97c334a546b207d74ad2b8b7076d4341ac61823482cd8","last_reissued_at":"2026-05-18T01:37:35.497061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.497061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost Preserving Bisimulations for Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Andrea Turrini (State Key Laboratory of Computer Science, Beijing, China), Chinese Academy of Sciences, Germany), Holger Hermanns (Saarland University -- Computer Science, Institute of Software, Saarbruecken","submitted_at":"2014-10-30T10:26:58Z","abstract_excerpt":"Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper considers probabilistic automata augmented with costs. It extends the notions of weak transitions in probabilistic automata in such a way that the costs incurred along a weak transition are captured. This gives rise to cost-preserving and cost-bounding variations of weak probabilistic bisimilarity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8314","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":"1410.8314","created_at":"2026-05-18T01:37:35.497125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8314v3","created_at":"2026-05-18T01:37:35.497125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8314","created_at":"2026-05-18T01:37:35.497125+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDBPFJ3DQX57","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDBPFJ3DQX57HKFJ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDBPFJ3D","created_at":"2026-05-18T12:28:57.508820+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/XDBPFJ3DQX57HKFJPQZUUVDLEB","json":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB.json","graph_json":"https://pith.science/api/pith-number/XDBPFJ3DQX57HKFJPQZUUVDLEB/graph.json","events_json":"https://pith.science/api/pith-number/XDBPFJ3DQX57HKFJPQZUUVDLEB/events.json","paper":"https://pith.science/paper/XDBPFJ3D"},"agent_actions":{"view_html":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB","download_json":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB.json","view_paper":"https://pith.science/paper/XDBPFJ3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8314&json=true","fetch_graph":"https://pith.science/api/pith-number/XDBPFJ3DQX57HKFJPQZUUVDLEB/graph.json","fetch_events":"https://pith.science/api/pith-number/XDBPFJ3DQX57HKFJPQZUUVDLEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB/action/storage_attestation","attest_author":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB/action/author_attestation","sign_citation":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB/action/citation_signature","submit_replication":"https://pith.science/pith/XDBPFJ3DQX57HKFJPQZUUVDLEB/action/replication_record"}},"created_at":"2026-05-18T01:37:35.497125+00:00","updated_at":"2026-05-18T01:37:35.497125+00:00"}