{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IQSSOGGUMMIM3RAWF2KYYLALS2","short_pith_number":"pith:IQSSOGGU","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"},"canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","source":{"kind":"arxiv","id":"1410.6268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6268","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6268v2","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6268","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"IQSSOGGUMMIM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQSSOGGUMMIM3RAW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQSSOGGU","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IQSSOGGUMMIM3RAWF2KYYLALS2","target":"record","payload":{"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"},"canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","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"},"source_kind":"arxiv","source_id":"1410.6268","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aUb2rEtHy6WOdxKfEQiSauSdKXvEwfC8dr5fmlOoHGlLd8zTF6cfrItg0t1a8gVQbi7nakzeM2BJuKg2g+vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:01:02.733389Z"},"content_sha256":"7604eeb2f536285749ff6af66e6b53db5bdc0321e1a1dbc2ef8b62f22510f814","schema_version":"1.0","event_id":"sha256:7604eeb2f536285749ff6af66e6b53db5bdc0321e1a1dbc2ef8b62f22510f814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IQSSOGGUMMIM3RAWF2KYYLALS2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36V1mKbWslP5q7BwjwOboMMJyi+b3Yfd/ntPVdKDGQxOy2GTf87AX8+H3sKpaY5zeYpK1hCaes9lQofUy6SzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:01:02.733859Z"},"content_sha256":"6fc45471acb501a6a72d32850b6640a8bab99921417b746b7a830965054d2bcc","schema_version":"1.0","event_id":"sha256:6fc45471acb501a6a72d32850b6640a8bab99921417b746b7a830965054d2bcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/bundle.json","state_url":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T07:01:02Z","links":{"resolver":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2","bundle":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/bundle.json","state":"https://pith.science/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQSSOGGUMMIM3RAWF2KYYLALS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IQSSOGGUMMIM3RAWF2KYYLALS2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f276c14a25d02abe1a32b750ce923acd48788f4e46122bf4598d3f074ed450da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-23T07:28:11Z","title_canon_sha256":"d5bfdbe23fe4125e28904cda78a6c237d434a13e450fc938de9becb0f5b9af36"},"schema_version":"1.0","source":{"id":"1410.6268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6268","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6268v2","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6268","created_at":"2026-05-18T02:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"IQSSOGGUMMIM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQSSOGGUMMIM3RAW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQSSOGGU","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:6fc45471acb501a6a72d32850b6640a8bab99921417b746b7a830965054d2bcc","target":"graph","created_at":"2026-05-18T02:28:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brijesh Dongol, John Derrick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-23T07:28:11Z","title":"Verifying linearizability: A comparative survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6268","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7604eeb2f536285749ff6af66e6b53db5bdc0321e1a1dbc2ef8b62f22510f814","target":"record","created_at":"2026-05-18T02:28:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f276c14a25d02abe1a32b750ce923acd48788f4e46122bf4598d3f074ed450da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-23T07:28:11Z","title_canon_sha256":"d5bfdbe23fe4125e28904cda78a6c237d434a13e450fc938de9becb0f5b9af36"},"schema_version":"1.0","source":{"id":"1410.6268","kind":"arxiv","version":2}},"canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44252718d46310cdc4162e958c2c0b96bbb002a066e20f0c8266230004945dc0","first_computed_at":"2026-05-18T02:28:13.242252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:13.242252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yH7tXCO00ok9QHCfexNw2m4k9US5CLf889AuE2JW8nmSiHwToSQbkpYQpau2g3Kpp+e5j16I5BQcva9na6XqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:13.242736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7604eeb2f536285749ff6af66e6b53db5bdc0321e1a1dbc2ef8b62f22510f814","sha256:6fc45471acb501a6a72d32850b6640a8bab99921417b746b7a830965054d2bcc"],"state_sha256":"ac54886742fdbcf870bfa8577a47b248830e4890384289347b7ef59d2cd44523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fydc76sjZnsgW6czySdo6BIt85ttpkSne3B9TcGY9ot17EIyp8y2zvdTe1l+pC+4YYvo+N5NYDK/WMRI6nciCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:01:02.736545Z","bundle_sha256":"6a7299f3d88eb479673b66df72a65194543d9a1a1000b068094e3401cb7177bc"}}