{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AJ7V6TFYZWUGK2ZTUMMFQAZBQX","short_pith_number":"pith:AJ7V6TFY","canonical_record":{"source":{"id":"1502.06882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-24T17:06:51Z","cross_cats_sorted":[],"title_canon_sha256":"0da5fda91aea206a7cb2bb5c13e6697c51212112b3af7d66af1de34a940bd596","abstract_canon_sha256":"74b4c591271bdad9fb9eda541e4e7b2ec93129c12935b42e269c0e55975079ee"},"schema_version":"1.0"},"canonical_sha256":"027f5f4cb8cda8656b33a31858032185d0f1c195819dd03d12f6f62afb0fb181","source":{"kind":"arxiv","id":"1502.06882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06882","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06882v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06882","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7V6TFYZWUG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7V6TFYZWUGK2ZT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7V6TFY","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AJ7V6TFYZWUGK2ZTUMMFQAZBQX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-24T17:06:51Z","cross_cats_sorted":[],"title_canon_sha256":"0da5fda91aea206a7cb2bb5c13e6697c51212112b3af7d66af1de34a940bd596","abstract_canon_sha256":"74b4c591271bdad9fb9eda541e4e7b2ec93129c12935b42e269c0e55975079ee"},"schema_version":"1.0"},"canonical_sha256":"027f5f4cb8cda8656b33a31858032185d0f1c195819dd03d12f6f62afb0fb181","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:45.080788Z","signature_b64":"NoAWHB2R7ssy6Y7mBIoyrkTo1PS+4ROo7SCr5x4l2rGbdjOl/VDMU3og8kbHjWqY9OZmLW8GJ1I/nOa1OdfQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"027f5f4cb8cda8656b33a31858032185d0f1c195819dd03d12f6f62afb0fb181","last_reissued_at":"2026-05-18T02:03:45.080242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:45.080242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06882","source_version":2,"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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXaf5CZ13TIyfCn8ztMmY90UdUJ1+2+V0KOhbuaDzAv1nii4mlpSaf8x6jRZJBQdxRwxrskiHJcli5zGXbCXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:19:56.644692Z"},"content_sha256":"7d11e3499591921d64406feb01a13a9d4ea27e3030e73021f75f078257f2fba0","schema_version":"1.0","event_id":"sha256:7d11e3499591921d64406feb01a13a9d4ea27e3030e73021f75f078257f2fba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AJ7V6TFYZWUGK2ZTUMMFQAZBQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Reducing Linearizability to State Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani, Constantin Enea, Jad Hamza, Michael Emmi","submitted_at":"2015-02-24T17:06:51Z","abstract_excerpt":"Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with respect to given ADT specifications - are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachability are decidable, linearizability is undecidable.\n  In this work we demonstrate that verifying linearizability for certain fixed ADT specifications is reducible to control-state reachability, despite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06882","kind":"arxiv","version":2},"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-18T02:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MN/TfmGzZL7gDZskLyPB/VyFC22Ey2wXnJSEtQiiaC78paFWCHfWxH6doM11/AgfuUrnqy71e7OHA8BVE6STDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:19:56.645039Z"},"content_sha256":"e3e68fe97f3343eaeb97021a7f757c0da5cd1152ce4529fd00f984dceac0c677","schema_version":"1.0","event_id":"sha256:e3e68fe97f3343eaeb97021a7f757c0da5cd1152ce4529fd00f984dceac0c677"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/bundle.json","state_url":"https://pith.science/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/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-02T03:19:56Z","links":{"resolver":"https://pith.science/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX","bundle":"https://pith.science/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/bundle.json","state":"https://pith.science/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJ7V6TFYZWUGK2ZTUMMFQAZBQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AJ7V6TFYZWUGK2ZTUMMFQAZBQX","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":"74b4c591271bdad9fb9eda541e4e7b2ec93129c12935b42e269c0e55975079ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-24T17:06:51Z","title_canon_sha256":"0da5fda91aea206a7cb2bb5c13e6697c51212112b3af7d66af1de34a940bd596"},"schema_version":"1.0","source":{"id":"1502.06882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06882","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06882v2","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06882","created_at":"2026-05-18T02:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"AJ7V6TFYZWUG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AJ7V6TFYZWUGK2ZT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AJ7V6TFY","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:e3e68fe97f3343eaeb97021a7f757c0da5cd1152ce4529fd00f984dceac0c677","target":"graph","created_at":"2026-05-18T02:03:45Z","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 atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with respect to given ADT specifications - are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachability are decidable, linearizability is undecidable.\n  In this work we demonstrate that verifying linearizability for certain fixed ADT specifications is reducible to control-state reachability, despite ","authors_text":"Ahmed Bouajjani, Constantin Enea, Jad Hamza, Michael Emmi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-24T17:06:51Z","title":"On Reducing Linearizability to State Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06882","kind":"arxiv","version":2},"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:7d11e3499591921d64406feb01a13a9d4ea27e3030e73021f75f078257f2fba0","target":"record","created_at":"2026-05-18T02:03:45Z","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":"74b4c591271bdad9fb9eda541e4e7b2ec93129c12935b42e269c0e55975079ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-24T17:06:51Z","title_canon_sha256":"0da5fda91aea206a7cb2bb5c13e6697c51212112b3af7d66af1de34a940bd596"},"schema_version":"1.0","source":{"id":"1502.06882","kind":"arxiv","version":2}},"canonical_sha256":"027f5f4cb8cda8656b33a31858032185d0f1c195819dd03d12f6f62afb0fb181","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"027f5f4cb8cda8656b33a31858032185d0f1c195819dd03d12f6f62afb0fb181","first_computed_at":"2026-05-18T02:03:45.080242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:45.080242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NoAWHB2R7ssy6Y7mBIoyrkTo1PS+4ROo7SCr5x4l2rGbdjOl/VDMU3og8kbHjWqY9OZmLW8GJ1I/nOa1OdfQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:45.080788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d11e3499591921d64406feb01a13a9d4ea27e3030e73021f75f078257f2fba0","sha256:e3e68fe97f3343eaeb97021a7f757c0da5cd1152ce4529fd00f984dceac0c677"],"state_sha256":"3ede71e8a209a08d13fa108dd1b34af906a25b2c5ed4e95c7e566948cb75cb66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6mqRONT6vdnstxFMKZWBkdj25pswaVvZfWRRFVA6kFXM+a01XS4xO6ElZssfxry4UtGP40LbZ0pXXi826rbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:19:56.647008Z","bundle_sha256":"f607968242a0f5228cf7ffe7369b44586efa88095ac73493ca722205a8075e6e"}}