{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZAGEU2VUHHNHXMVF4BHHSITFDQ","short_pith_number":"pith:ZAGEU2VU","canonical_record":{"source":{"id":"1805.03992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-10T14:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"0119f9bb9f41ec65a1316a9058f8e5d76b9d17184888d2d376c20463a3822fd9","abstract_canon_sha256":"9ee3acd2ac7172cc061c0a3249b8d89644fcb9c4e1a35566c3c1d61d16b24247"},"schema_version":"1.0"},"canonical_sha256":"c80c4a6ab439da7bb2a5e04e7922651c20b5f3cd19e9dca636b93abc8104e6d1","source":{"kind":"arxiv","id":"1805.03992","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03992","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03992v3","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03992","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZAGEU2VUHHNH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZAGEU2VUHHNHXMVF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZAGEU2VU","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZAGEU2VUHHNHXMVF4BHHSITFDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-10T14:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"0119f9bb9f41ec65a1316a9058f8e5d76b9d17184888d2d376c20463a3822fd9","abstract_canon_sha256":"9ee3acd2ac7172cc061c0a3249b8d89644fcb9c4e1a35566c3c1d61d16b24247"},"schema_version":"1.0"},"canonical_sha256":"c80c4a6ab439da7bb2a5e04e7922651c20b5f3cd19e9dca636b93abc8104e6d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:54.251055Z","signature_b64":"oyKQUcOTmTpteHZjtSe8M4H/HZz93qGCUweFWgJ3h2gdWP3DMrv+yrChExd6myLnZszQD/Wgze6vTmGtVBYcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c80c4a6ab439da7bb2a5e04e7922651c20b5f3cd19e9dca636b93abc8104e6d1","last_reissued_at":"2026-05-18T00:08:54.250339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:54.250339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03992","source_version":3,"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-18T00:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Saz82Ad1kvAC6tqHmPuSHH+ongmimqF1w3yDGQlTun1TOQV4vsl8VDXF0l07mmwLLiKCpMzpun16KQbDYKvtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:01:07.060835Z"},"content_sha256":"74c55713e2ea27a803da1cc2e6152e39b670bbf0ec7c8e4180e5655bea6aa5c1","schema_version":"1.0","event_id":"sha256:74c55713e2ea27a803da1cc2e6152e39b670bbf0ec7c8e4180e5655bea6aa5c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZAGEU2VUHHNHXMVF4BHHSITFDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Order out of Chaos: Proving Linearizability Using Local Views","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam Morrison, Constantin Enea, Noam Rinetzky, Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2018-05-10T14:19:16Z","abstract_excerpt":"Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning about the view of the memory obtained by the threads, because as they execute, threads observe different fragments of memory from different points in time. Until today, every linearizability proof has tackled this challenge from scratch.\n  We present a unifying proof argument for the correctness of unsynchronized traversals, and apply it to prove the linearizability of several highly concurrent search data structures, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03992","kind":"arxiv","version":3},"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-18T00:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zbphuCG+3j2AyjVtSM2sV156rJnQARiA4xMloQ6OVBU2TUxmMDkZxOrqM8mAPfFbfT9dPKEEr1/UDZoUo1ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:01:07.061449Z"},"content_sha256":"e488ee7c70dd9c2f94f5cd0c562564e692944abd198ecd2d2b6321fd5934a35a","schema_version":"1.0","event_id":"sha256:e488ee7c70dd9c2f94f5cd0c562564e692944abd198ecd2d2b6321fd5934a35a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/bundle.json","state_url":"https://pith.science/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/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-20T20:01:07Z","links":{"resolver":"https://pith.science/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ","bundle":"https://pith.science/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/bundle.json","state":"https://pith.science/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAGEU2VUHHNHXMVF4BHHSITFDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZAGEU2VUHHNHXMVF4BHHSITFDQ","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":"9ee3acd2ac7172cc061c0a3249b8d89644fcb9c4e1a35566c3c1d61d16b24247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-10T14:19:16Z","title_canon_sha256":"0119f9bb9f41ec65a1316a9058f8e5d76b9d17184888d2d376c20463a3822fd9"},"schema_version":"1.0","source":{"id":"1805.03992","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03992","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03992v3","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03992","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZAGEU2VUHHNH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZAGEU2VUHHNHXMVF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZAGEU2VU","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:e488ee7c70dd9c2f94f5cd0c562564e692944abd198ecd2d2b6321fd5934a35a","target":"graph","created_at":"2026-05-18T00:08:54Z","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":"Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning about the view of the memory obtained by the threads, because as they execute, threads observe different fragments of memory from different points in time. Until today, every linearizability proof has tackled this challenge from scratch.\n  We present a unifying proof argument for the correctness of unsynchronized traversals, and apply it to prove the linearizability of several highly concurrent search data structures, i","authors_text":"Adam Morrison, Constantin Enea, Noam Rinetzky, Sharon Shoham, Yotam M. Y. Feldman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-10T14:19:16Z","title":"Order out of Chaos: Proving Linearizability Using Local Views"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03992","kind":"arxiv","version":3},"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:74c55713e2ea27a803da1cc2e6152e39b670bbf0ec7c8e4180e5655bea6aa5c1","target":"record","created_at":"2026-05-18T00:08:54Z","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":"9ee3acd2ac7172cc061c0a3249b8d89644fcb9c4e1a35566c3c1d61d16b24247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-10T14:19:16Z","title_canon_sha256":"0119f9bb9f41ec65a1316a9058f8e5d76b9d17184888d2d376c20463a3822fd9"},"schema_version":"1.0","source":{"id":"1805.03992","kind":"arxiv","version":3}},"canonical_sha256":"c80c4a6ab439da7bb2a5e04e7922651c20b5f3cd19e9dca636b93abc8104e6d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c80c4a6ab439da7bb2a5e04e7922651c20b5f3cd19e9dca636b93abc8104e6d1","first_computed_at":"2026-05-18T00:08:54.250339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:54.250339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyKQUcOTmTpteHZjtSe8M4H/HZz93qGCUweFWgJ3h2gdWP3DMrv+yrChExd6myLnZszQD/Wgze6vTmGtVBYcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:54.251055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03992","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74c55713e2ea27a803da1cc2e6152e39b670bbf0ec7c8e4180e5655bea6aa5c1","sha256:e488ee7c70dd9c2f94f5cd0c562564e692944abd198ecd2d2b6321fd5934a35a"],"state_sha256":"15801dacffc580b9802627769ccb0971740e0089b4041a4a6f10728469bd9259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ljuMXw6OeIzCwQzqgVWQ5j4ZI6nmemqFMMO2l/CeHjksFh4C6FBWA9xuwHjKt30ykmBE/Va8NV+Aggbu0G+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:01:07.065066Z","bundle_sha256":"fa50b416705b208e877e1e5c2dbd5e7f1920ceed9d390805e89a4f1486200cfd"}}