{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AAGXZP42V5JBREPLSZAHF5X2JJ","short_pith_number":"pith:AAGXZP42","schema_version":"1.0","canonical_sha256":"000d7cbf9aaf521891eb964072f6fa4a4bab6a6fef50d4d5667630dbaff8d9c1","source":{"kind":"arxiv","id":"1609.07546","version":5},"attestation_state":"computed","paper":{"title":"Proving Linearizability via Branching Bisimulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Hao Wu, Huimin Lin, Joost-Pieter Katoen, Xiaoxiao Yang","submitted_at":"2016-09-24T01:03:34Z","abstract_excerpt":"Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit branching bisimulation, a fundamental semantic equivalence relation developed for process algebras which can be computed efficiently, in checking these properties. A quotient construction is provided which results in huge state space reductions. We confirm the advantages of the proposed approach on more than a dozen benchmark problems."},"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":"1609.07546","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-24T01:03:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ab5c6a805e0008b1bfeef5f74e7d2ad6ada4e34c083f299f354d7f9e7c11bd20","abstract_canon_sha256":"686e10be045465b1632b2bcba67c900e8a919b7fee25ef0f86bd8b30ea1d000e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.943517Z","signature_b64":"4MuvaEKjxGuWAOuSh+fx/vk9oiplgx5TUXGnM+Jnvp6ukFBEopXnOURuWJpy3yR4Hp1LHRGWt/EKPlpD37c6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"000d7cbf9aaf521891eb964072f6fa4a4bab6a6fef50d4d5667630dbaff8d9c1","last_reissued_at":"2026-05-18T01:03:35.942738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.942738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving Linearizability via Branching Bisimulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Hao Wu, Huimin Lin, Joost-Pieter Katoen, Xiaoxiao Yang","submitted_at":"2016-09-24T01:03:34Z","abstract_excerpt":"Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit branching bisimulation, a fundamental semantic equivalence relation developed for process algebras which can be computed efficiently, in checking these properties. A quotient construction is provided which results in huge state space reductions. We confirm the advantages of the proposed approach on more than a dozen benchmark problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07546","kind":"arxiv","version":5},"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":"1609.07546","created_at":"2026-05-18T01:03:35.942872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07546v5","created_at":"2026-05-18T01:03:35.942872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07546","created_at":"2026-05-18T01:03:35.942872+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAGXZP42V5JB","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAGXZP42V5JBREPL","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAGXZP42","created_at":"2026-05-18T12:30:04.600751+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/AAGXZP42V5JBREPLSZAHF5X2JJ","json":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ.json","graph_json":"https://pith.science/api/pith-number/AAGXZP42V5JBREPLSZAHF5X2JJ/graph.json","events_json":"https://pith.science/api/pith-number/AAGXZP42V5JBREPLSZAHF5X2JJ/events.json","paper":"https://pith.science/paper/AAGXZP42"},"agent_actions":{"view_html":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ","download_json":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ.json","view_paper":"https://pith.science/paper/AAGXZP42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07546&json=true","fetch_graph":"https://pith.science/api/pith-number/AAGXZP42V5JBREPLSZAHF5X2JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AAGXZP42V5JBREPLSZAHF5X2JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ/action/storage_attestation","attest_author":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ/action/author_attestation","sign_citation":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ/action/citation_signature","submit_replication":"https://pith.science/pith/AAGXZP42V5JBREPLSZAHF5X2JJ/action/replication_record"}},"created_at":"2026-05-18T01:03:35.942872+00:00","updated_at":"2026-05-18T01:03:35.942872+00:00"}