{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IQSSOGGUMMIM3RAWF2KYYLALS2","short_pith_number":"pith:IQSSOGGU","schema_version":"1.0","canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","source":{"kind":"arxiv","id":"1410.6268","version":2},"attestation_state":"computed","paper":{"title":"Verifying linearizability: A comparative survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Brijesh Dongol, John Derrick","submitted_at":"2014-10-23T07:28:11Z","abstract_excerpt":"Linearizability has become the key correctness criterion for concurrent data structures, ensuring that histories of the concurrent object under consideration are consistent, where consistency is judged with respect to a sequential history of a corresponding abstract data structure. Linearizability allows any order of concurrent (i.e., overlapping) calls to operations to be picked, but requires the real-time order of non-overlapping to be preserved. Over the years numerous techniques for verifying linearizability have been developed, using a variety of formal foundations such as refinement, sha"},"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.6268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-23T07:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"d5bfdbe23fe4125e28904cda78a6c237d434a13e450fc938de9becb0f5b9af36","abstract_canon_sha256":"f276c14a25d02abe1a32b750ce923acd48788f4e46122bf4598d3f074ed450da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.242736Z","signature_b64":"yH7tXCO00ok9QHCfexNw2m4k9US5CLf889AuE2JW8nmSiHwToSQbkpYQpau2g3Kpp+e5j16I5BQcva9na6XqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","last_reissued_at":"2026-05-18T02:28:13.242252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.242252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying linearizability: A comparative survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Brijesh Dongol, John Derrick","submitted_at":"2014-10-23T07:28:11Z","abstract_excerpt":"Linearizability has become the key correctness criterion for concurrent data structures, ensuring that histories of the concurrent object under consideration are consistent, where consistency is judged with respect to a sequential history of a corresponding abstract data structure. Linearizability allows any order of concurrent (i.e., overlapping) calls to operations to be picked, but requires the real-time order of non-overlapping to be preserved. Over the years numerous techniques for verifying linearizability have been developed, using a variety of formal foundations such as refinement, sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6268","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":"1410.6268","created_at":"2026-05-18T02:28:13.242361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6268v2","created_at":"2026-05-18T02:28:13.242361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6268","created_at":"2026-05-18T02:28:13.242361+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQSSOGGUMMIM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQSSOGGUMMIM3RAW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQSSOGGU","created_at":"2026-05-18T12:28:33.132498+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/IQSSOGGUMMIM3RAWF2KYYLALS2","json":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2.json","graph_json":"https://pith.science/api/pith-number/IQSSOGGUMMIM3RAWF2KYYLALS2/graph.json","events_json":"https://pith.science/api/pith-number/IQSSOGGUMMIM3RAWF2KYYLALS2/events.json","paper":"https://pith.science/paper/IQSSOGGU"},"agent_actions":{"view_html":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2","download_json":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2.json","view_paper":"https://pith.science/paper/IQSSOGGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6268&json=true","fetch_graph":"https://pith.science/api/pith-number/IQSSOGGUMMIM3RAWF2KYYLALS2/graph.json","fetch_events":"https://pith.science/api/pith-number/IQSSOGGUMMIM3RAWF2KYYLALS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/action/storage_attestation","attest_author":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/action/author_attestation","sign_citation":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/action/citation_signature","submit_replication":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/action/replication_record"}},"created_at":"2026-05-18T02:28:13.242361+00:00","updated_at":"2026-05-18T02:28:13.242361+00:00"}