{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QAACOQGRZOSKFYULAUBYRVXUC7","short_pith_number":"pith:QAACOQGR","schema_version":"1.0","canonical_sha256":"80002740d1cba4a2e28b050388d6f417e80133be646931e7b324034cdb7fa656","source":{"kind":"arxiv","id":"1212.5116","version":1},"attestation_state":"computed","paper":{"title":"Proving linearisability via coarse-grained abstraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Brijesh Dongol, John Derrick","submitted_at":"2012-12-20T16:08:36Z","abstract_excerpt":"Linearisability has become the standard safety criterion for concurrent data structures ensuring that the effect of a concrete operation takes place after the execution some atomic statement (often referred to as the linearisation point). Identification of linearisation points is a non-trivial task and it is even possible for an operation to be linearised by the execution of other concurrent operations. This paper presents a method for verifying linearisability that does not require identification of linearisation points in the concrete code. Instead, we show that the concrete program is a ref"},"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":"1212.5116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-20T16:08:36Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"476e6562592fbf7a423cd98dcf0aecdbfffee57d0a6927cde5790d6dbe9468ae","abstract_canon_sha256":"05f1ac2b1f4af342d04d2b0933c3fdf21391e0cb005c11dd7e5a2b6eaa024628"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:03.800156Z","signature_b64":"1yUW66zRbYpShiO7pHCm555UJ2usr95np53jRivbfFtze3fu1RtGfQYVrtEK1LZeUESf2HGQyGEHMZy/raV9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80002740d1cba4a2e28b050388d6f417e80133be646931e7b324034cdb7fa656","last_reissued_at":"2026-05-18T03:38:03.799375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:03.799375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving linearisability via coarse-grained abstraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Brijesh Dongol, John Derrick","submitted_at":"2012-12-20T16:08:36Z","abstract_excerpt":"Linearisability has become the standard safety criterion for concurrent data structures ensuring that the effect of a concrete operation takes place after the execution some atomic statement (often referred to as the linearisation point). Identification of linearisation points is a non-trivial task and it is even possible for an operation to be linearised by the execution of other concurrent operations. This paper presents a method for verifying linearisability that does not require identification of linearisation points in the concrete code. Instead, we show that the concrete program is a ref"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5116","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":"1212.5116","created_at":"2026-05-18T03:38:03.799507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5116v1","created_at":"2026-05-18T03:38:03.799507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5116","created_at":"2026-05-18T03:38:03.799507+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAACOQGRZOSK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAACOQGRZOSKFYUL","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAACOQGR","created_at":"2026-05-18T12:27:18.751474+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/QAACOQGRZOSKFYULAUBYRVXUC7","json":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7.json","graph_json":"https://pith.science/api/pith-number/QAACOQGRZOSKFYULAUBYRVXUC7/graph.json","events_json":"https://pith.science/api/pith-number/QAACOQGRZOSKFYULAUBYRVXUC7/events.json","paper":"https://pith.science/paper/QAACOQGR"},"agent_actions":{"view_html":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7","download_json":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7.json","view_paper":"https://pith.science/paper/QAACOQGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5116&json=true","fetch_graph":"https://pith.science/api/pith-number/QAACOQGRZOSKFYULAUBYRVXUC7/graph.json","fetch_events":"https://pith.science/api/pith-number/QAACOQGRZOSKFYULAUBYRVXUC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7/action/storage_attestation","attest_author":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7/action/author_attestation","sign_citation":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7/action/citation_signature","submit_replication":"https://pith.science/pith/QAACOQGRZOSKFYULAUBYRVXUC7/action/replication_record"}},"created_at":"2026-05-18T03:38:03.799507+00:00","updated_at":"2026-05-18T03:38:03.799507+00:00"}