{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:72HH2GJHFC4MFRE77T5VJGYNHA","short_pith_number":"pith:72HH2GJH","canonical_record":{"source":{"id":"1609.01171","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2016-09-05T14:12:03Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"62b3776aea5d93557eb3e7ec29364155099a2cfed3286b562485cdde1f1d4fb1","abstract_canon_sha256":"a5df4a06a9e501a5ffd40ade7f0f50dd9c9a8eb843c66a9555a6d48c3c171f1b"},"schema_version":"1.0"},"canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","source":{"kind":"arxiv","id":"1609.01171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01171","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01171v1","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01171","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"72HH2GJHFC4M","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"72HH2GJHFC4MFRE7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"72HH2GJH","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:72HH2GJHFC4MFRE77T5VJGYNHA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01171","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2016-09-05T14:12:03Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"62b3776aea5d93557eb3e7ec29364155099a2cfed3286b562485cdde1f1d4fb1","abstract_canon_sha256":"a5df4a06a9e501a5ffd40ade7f0f50dd9c9a8eb843c66a9555a6d48c3c171f1b"},"schema_version":"1.0"},"canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:18.832474Z","signature_b64":"wS+Zvm2TzpS7KUrJf+eTcGrIB+xz/7Eprxct3S4z+cXeE8C2zMNqJY7VxG2/k9dWNkdjY7+IMgOEzyQhKwplBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","last_reissued_at":"2026-05-18T01:06:18.831736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:18.831736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01171","source_version":1,"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-18T01:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WZqd/Sb+mSZjmQMIH3dzEYY8R4oLByNOIwDtYunPsNLCUggk5x911A0froPtW+0lbYfg3ZenCPOTi843QJCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:38:45.015687Z"},"content_sha256":"410d6a4455ab84d847a8a062c39dddef00176547b77c84aa477e5b95613ca549","schema_version":"1.0","event_id":"sha256:410d6a4455ab84d847a8a062c39dddef00176547b77c84aa477e5b95613ca549"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:72HH2GJHFC4MFRE77T5VJGYNHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generic Logic for Proving Linearizability (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexey Gotsman, Artem Khyzha, Matthew Parkinson","submitted_at":"2016-09-05T14:12:03Z","abstract_excerpt":"Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated with different means of compositional reasoning about concurrency, such as separation logic or rely-guarantee. To this end, we generalise the Views framework for reasoning about concurrency to handle relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01171","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"},"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-18T01:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMnjnfUwitRTRG2qBNARUM2TLjKdR4DCPFLc+purlTTiY5urZf0ij2nmhBDZUMLuJNR8v0RlhK3ULh+JAxR+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:38:45.016030Z"},"content_sha256":"e8d7a8e32e8b527c1cc46e16f3522e098cde3145a10e83de7d5e5cf0f3c9e420","schema_version":"1.0","event_id":"sha256:e8d7a8e32e8b527c1cc46e16f3522e098cde3145a10e83de7d5e5cf0f3c9e420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/bundle.json","state_url":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72HH2GJHFC4MFRE77T5VJGYNHA/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-06-01T23:38:45Z","links":{"resolver":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA","bundle":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/bundle.json","state":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72HH2GJHFC4MFRE77T5VJGYNHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:72HH2GJHFC4MFRE77T5VJGYNHA","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":"a5df4a06a9e501a5ffd40ade7f0f50dd9c9a8eb843c66a9555a6d48c3c171f1b","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2016-09-05T14:12:03Z","title_canon_sha256":"62b3776aea5d93557eb3e7ec29364155099a2cfed3286b562485cdde1f1d4fb1"},"schema_version":"1.0","source":{"id":"1609.01171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01171","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01171v1","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01171","created_at":"2026-05-18T01:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"72HH2GJHFC4M","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"72HH2GJHFC4MFRE7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"72HH2GJH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:e8d7a8e32e8b527c1cc46e16f3522e098cde3145a10e83de7d5e5cf0f3c9e420","target":"graph","created_at":"2026-05-18T01:06:18Z","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 is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated with different means of compositional reasoning about concurrency, such as separation logic or rely-guarantee. To this end, we generalise the Views framework for reasoning about concurrency to handle relat","authors_text":"Alexey Gotsman, Artem Khyzha, Matthew Parkinson","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2016-09-05T14:12:03Z","title":"A Generic Logic for Proving Linearizability (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01171","kind":"arxiv","version":1},"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:410d6a4455ab84d847a8a062c39dddef00176547b77c84aa477e5b95613ca549","target":"record","created_at":"2026-05-18T01:06:18Z","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":"a5df4a06a9e501a5ffd40ade7f0f50dd9c9a8eb843c66a9555a6d48c3c171f1b","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2016-09-05T14:12:03Z","title_canon_sha256":"62b3776aea5d93557eb3e7ec29364155099a2cfed3286b562485cdde1f1d4fb1"},"schema_version":"1.0","source":{"id":"1609.01171","kind":"arxiv","version":1}},"canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","first_computed_at":"2026-05-18T01:06:18.831736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:18.831736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wS+Zvm2TzpS7KUrJf+eTcGrIB+xz/7Eprxct3S4z+cXeE8C2zMNqJY7VxG2/k9dWNkdjY7+IMgOEzyQhKwplBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:18.832474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:410d6a4455ab84d847a8a062c39dddef00176547b77c84aa477e5b95613ca549","sha256:e8d7a8e32e8b527c1cc46e16f3522e098cde3145a10e83de7d5e5cf0f3c9e420"],"state_sha256":"7c7888c329b6de43568ec5cfc7ce84bdfce36c89136d848e369a59b9b09a94e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8vY7sOkSZciyIbcwAzJw7rvDLYuciK7+FPVzwFlKWmVrtt6W5e/mO+RlB2S41W8sLYECIk577oxdPIBXtI6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:38:45.017941Z","bundle_sha256":"c5b9f681b9a0ecdf5fd67e1c2f25f9e4eabefd7cc3d616faf95a837ded1c18f3"}}