{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TVAB6M3RBKOGS5USC65IHTWWJK","short_pith_number":"pith:TVAB6M3R","schema_version":"1.0","canonical_sha256":"9d401f33710a9c69769217ba83ced64aa797c6532541c8343403e1af2afc1341","source":{"kind":"arxiv","id":"1311.3396","version":2},"attestation_state":"computed","paper":{"title":"When Equivalence and Bisimulation Join Forces in Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Lijun Zhang, Yuan Feng","submitted_at":"2013-11-14T07:15:43Z","abstract_excerpt":"Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic automata were re-proposed by Segala in 1995 which are more general than Rabin's automata. Bisimulations have been proposed for Segala's automata to characterize the equivalence between them. So far the two notions of equivalences and their characteristics have been studied most independently. In this paper, we consider Segala's automata, and propose a novel no"},"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":"1311.3396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-14T07:15:43Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"a0ea1d34314708af787efcf49b2ef8ec6a29a325916ba70b2430594b07f5b5c6","abstract_canon_sha256":"829625894b5f4b6bf84147e7012eec33d9224f4cb92a01033b27c21c7a0d3589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.667353Z","signature_b64":"lYGtv2vAVqhnR+eVXP1vKmPHZBqNAl2rv36BKyYiUjXB8nwDifixv1l1fbojk5xH9vztJGQtZN/5ctHpeW2mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d401f33710a9c69769217ba83ced64aa797c6532541c8343403e1af2afc1341","last_reissued_at":"2026-05-18T02:56:51.666847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.666847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Equivalence and Bisimulation Join Forces in Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Lijun Zhang, Yuan Feng","submitted_at":"2013-11-14T07:15:43Z","abstract_excerpt":"Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic automata were re-proposed by Segala in 1995 which are more general than Rabin's automata. Bisimulations have been proposed for Segala's automata to characterize the equivalence between them. So far the two notions of equivalences and their characteristics have been studied most independently. In this paper, we consider Segala's automata, and propose a novel no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3396","kind":"arxiv","version":2},"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":"1311.3396","created_at":"2026-05-18T02:56:51.666927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3396v2","created_at":"2026-05-18T02:56:51.666927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3396","created_at":"2026-05-18T02:56:51.666927+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVAB6M3RBKOG","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVAB6M3RBKOGS5US","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVAB6M3R","created_at":"2026-05-18T12:28:02.375192+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/TVAB6M3RBKOGS5USC65IHTWWJK","json":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK.json","graph_json":"https://pith.science/api/pith-number/TVAB6M3RBKOGS5USC65IHTWWJK/graph.json","events_json":"https://pith.science/api/pith-number/TVAB6M3RBKOGS5USC65IHTWWJK/events.json","paper":"https://pith.science/paper/TVAB6M3R"},"agent_actions":{"view_html":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK","download_json":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK.json","view_paper":"https://pith.science/paper/TVAB6M3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3396&json=true","fetch_graph":"https://pith.science/api/pith-number/TVAB6M3RBKOGS5USC65IHTWWJK/graph.json","fetch_events":"https://pith.science/api/pith-number/TVAB6M3RBKOGS5USC65IHTWWJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK/action/storage_attestation","attest_author":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK/action/author_attestation","sign_citation":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK/action/citation_signature","submit_replication":"https://pith.science/pith/TVAB6M3RBKOGS5USC65IHTWWJK/action/replication_record"}},"created_at":"2026-05-18T02:56:51.666927+00:00","updated_at":"2026-05-18T02:56:51.666927+00:00"}