{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:72HH2GJHFC4MFRE77T5VJGYNHA","short_pith_number":"pith:72HH2GJH","schema_version":"1.0","canonical_sha256":"fe8e7d192728b8c2c49ffcfb549b0d383f3f0645f791e0444707fa5901d8d5d0","source":{"kind":"arxiv","id":"1609.01171","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01171","created_at":"2026-05-18T01:06:18.831843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01171v1","created_at":"2026-05-18T01:06:18.831843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01171","created_at":"2026-05-18T01:06:18.831843+00:00"},{"alias_kind":"pith_short_12","alias_value":"72HH2GJHFC4M","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"72HH2GJHFC4MFRE7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"72HH2GJH","created_at":"2026-05-18T12:30:04.600751+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/72HH2GJHFC4MFRE77T5VJGYNHA","json":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA.json","graph_json":"https://pith.science/api/pith-number/72HH2GJHFC4MFRE77T5VJGYNHA/graph.json","events_json":"https://pith.science/api/pith-number/72HH2GJHFC4MFRE77T5VJGYNHA/events.json","paper":"https://pith.science/paper/72HH2GJH"},"agent_actions":{"view_html":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA","download_json":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA.json","view_paper":"https://pith.science/paper/72HH2GJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01171&json=true","fetch_graph":"https://pith.science/api/pith-number/72HH2GJHFC4MFRE77T5VJGYNHA/graph.json","fetch_events":"https://pith.science/api/pith-number/72HH2GJHFC4MFRE77T5VJGYNHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/action/storage_attestation","attest_author":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/action/author_attestation","sign_citation":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/action/citation_signature","submit_replication":"https://pith.science/pith/72HH2GJHFC4MFRE77T5VJGYNHA/action/replication_record"}},"created_at":"2026-05-18T01:06:18.831843+00:00","updated_at":"2026-05-18T01:06:18.831843+00:00"}