{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SOFKDAC2SEPKLULKRI23CGMIZ3","short_pith_number":"pith:SOFKDAC2","schema_version":"1.0","canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","source":{"kind":"arxiv","id":"1707.00639","version":1},"attestation_state":"computed","paper":{"title":"Checking Linearizability of Concurrent Priority Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Chao Wang, Constantin Enea","submitted_at":"2017-07-03T16:40:42Z","abstract_excerpt":"Efficient implementations of concurrent objects such as atomic collections are essential to modern computing. Programming such objects is error prone: in minimizing the synchronization overhead between concurrent object invocations, one risks the conformance to sequential specifications -- or in formal terms, one risks violating linearizability. Unfortunately, verifying linearizability is undecidable in general, even on classes of implementations where the usual control-state reachability is decidable. In this work we consider concurrent priority queues which are fundamental to many multi-thre"},"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":"1707.00639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-03T16:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"4de16837d3ccd75f1d63eee06a89ec81ef613ab491d6b71b9ac04629aa82fd68","abstract_canon_sha256":"d719ceb3a1d9543f10a8cfdf1dd17649b3ea711f1331f35f33a14a0b197d867d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.788127Z","signature_b64":"+v+727xtSqDhmpHrLyRZy0WBH/RmOUDcv1JIP5mfVLaXfWi4nBgG06z+EGq4lG71e1yLGukkUmHD0+VnPPpoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","last_reissued_at":"2026-05-18T00:41:02.787496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.787496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checking Linearizability of Concurrent Priority Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Chao Wang, Constantin Enea","submitted_at":"2017-07-03T16:40:42Z","abstract_excerpt":"Efficient implementations of concurrent objects such as atomic collections are essential to modern computing. Programming such objects is error prone: in minimizing the synchronization overhead between concurrent object invocations, one risks the conformance to sequential specifications -- or in formal terms, one risks violating linearizability. Unfortunately, verifying linearizability is undecidable in general, even on classes of implementations where the usual control-state reachability is decidable. In this work we consider concurrent priority queues which are fundamental to many multi-thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00639","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":"1707.00639","created_at":"2026-05-18T00:41:02.787608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00639v1","created_at":"2026-05-18T00:41:02.787608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00639","created_at":"2026-05-18T00:41:02.787608+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOFKDAC2SEPK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOFKDAC2SEPKLULK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOFKDAC2","created_at":"2026-05-18T12:31:43.269735+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/SOFKDAC2SEPKLULKRI23CGMIZ3","json":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3.json","graph_json":"https://pith.science/api/pith-number/SOFKDAC2SEPKLULKRI23CGMIZ3/graph.json","events_json":"https://pith.science/api/pith-number/SOFKDAC2SEPKLULKRI23CGMIZ3/events.json","paper":"https://pith.science/paper/SOFKDAC2"},"agent_actions":{"view_html":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3","download_json":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3.json","view_paper":"https://pith.science/paper/SOFKDAC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00639&json=true","fetch_graph":"https://pith.science/api/pith-number/SOFKDAC2SEPKLULKRI23CGMIZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/SOFKDAC2SEPKLULKRI23CGMIZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/action/storage_attestation","attest_author":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/action/author_attestation","sign_citation":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/action/citation_signature","submit_replication":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/action/replication_record"}},"created_at":"2026-05-18T00:41:02.787608+00:00","updated_at":"2026-05-18T00:41:02.787608+00:00"}