{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SOFKDAC2SEPKLULKRI23CGMIZ3","short_pith_number":"pith:SOFKDAC2","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"},"canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","source":{"kind":"arxiv","id":"1707.00639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00639","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00639v1","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00639","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"SOFKDAC2SEPK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOFKDAC2SEPKLULK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOFKDAC2","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SOFKDAC2SEPKLULKRI23CGMIZ3","target":"record","payload":{"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"},"canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","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"},"source_kind":"arxiv","source_id":"1707.00639","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-18T00:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYttz9Ru2461QYo9FcdVBM1AlV7GN/R6bq6UqxXHD5TrprNL2He547BLrUOVozwRxlZMw0W11gK/jPoCD6cyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:54:59.217775Z"},"content_sha256":"e1baa7e87b62d8bc6bee331fb3a0e971b58408f9fe25c127ff9bb01c8b2878c6","schema_version":"1.0","event_id":"sha256:e1baa7e87b62d8bc6bee331fb3a0e971b58408f9fe25c127ff9bb01c8b2878c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SOFKDAC2SEPKLULKRI23CGMIZ3","target":"graph","payload":{"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"},"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6QNm02MOWGfD6c2lySvuB7fyY2/0zsR6Txnl+DB2/4cwYYFCQG2+tRWqkwItHoIjsdhlebM2mGYIg+jwv1gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:54:59.218416Z"},"content_sha256":"d3ba366aa871de90f830151a1880a599020476f4bb713a45c65abe20682ef7d8","schema_version":"1.0","event_id":"sha256:d3ba366aa871de90f830151a1880a599020476f4bb713a45c65abe20682ef7d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/bundle.json","state_url":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/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-25T08:54:59Z","links":{"resolver":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3","bundle":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/bundle.json","state":"https://pith.science/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOFKDAC2SEPKLULKRI23CGMIZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SOFKDAC2SEPKLULKRI23CGMIZ3","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":"d719ceb3a1d9543f10a8cfdf1dd17649b3ea711f1331f35f33a14a0b197d867d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-03T16:40:42Z","title_canon_sha256":"4de16837d3ccd75f1d63eee06a89ec81ef613ab491d6b71b9ac04629aa82fd68"},"schema_version":"1.0","source":{"id":"1707.00639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00639","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00639v1","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00639","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"SOFKDAC2SEPK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOFKDAC2SEPKLULK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOFKDAC2","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:d3ba366aa871de90f830151a1880a599020476f4bb713a45c65abe20682ef7d8","target":"graph","created_at":"2026-05-18T00:41:02Z","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":"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","authors_text":"Ahmed Bouajjani, Chao Wang, Constantin Enea","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-03T16:40:42Z","title":"Checking Linearizability of Concurrent Priority Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00639","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:e1baa7e87b62d8bc6bee331fb3a0e971b58408f9fe25c127ff9bb01c8b2878c6","target":"record","created_at":"2026-05-18T00:41:02Z","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":"d719ceb3a1d9543f10a8cfdf1dd17649b3ea711f1331f35f33a14a0b197d867d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-03T16:40:42Z","title_canon_sha256":"4de16837d3ccd75f1d63eee06a89ec81ef613ab491d6b71b9ac04629aa82fd68"},"schema_version":"1.0","source":{"id":"1707.00639","kind":"arxiv","version":1}},"canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"938aa1805a911ea5d16a8a35b11988cec36a771f94329d94223129be4326052d","first_computed_at":"2026-05-18T00:41:02.787496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:02.787496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+v+727xtSqDhmpHrLyRZy0WBH/RmOUDcv1JIP5mfVLaXfWi4nBgG06z+EGq4lG71e1yLGukkUmHD0+VnPPpoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:02.788127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1baa7e87b62d8bc6bee331fb3a0e971b58408f9fe25c127ff9bb01c8b2878c6","sha256:d3ba366aa871de90f830151a1880a599020476f4bb713a45c65abe20682ef7d8"],"state_sha256":"ae4698a18c965ed333577c33334820f6f0309b807eb89f187230403d148b1d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZdgzYMrMRAKwil5n/3WPbsrqzRlFQnbhiFZwf7e5/tAJnosjsZNqzYaYD0L0R9nZlpevh/CJrJvIxDBGDCVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:54:59.221928Z","bundle_sha256":"950ebb8556980ca746fe22b21f64936dc10d66be8ea7a0bccbe81725f536071a"}}