{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H3VEJNZGXLS2KWF2U5U3WUBPR2","short_pith_number":"pith:H3VEJNZG","schema_version":"1.0","canonical_sha256":"3eea44b726bae5a558baa769bb502f8e8a7e23ce5ee13a1ca81c5ba9ca756f2e","source":{"kind":"arxiv","id":"1702.02705","version":1},"attestation_state":"computed","paper":{"title":"Proving linearizability using forward simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Constantin Enea, Michael Emmi, Suha Orhun Mutluergil","submitted_at":"2017-02-09T04:47:05Z","abstract_excerpt":"Linearizability is the standard correctness criterion concurrent data structures such as stacks and queues. It allows to establish observational refinement between a concurrent implementation and an atomic reference implementation.Proving linearizability requires identifying linearization points for each method invocation along all possible computations, leading to valid sequential executions, or alternatively, establishing forward and backward simulations. In both cases, carrying out proofs is hard and complex in general. In particular, backward reasoning is difficult in the context of progra"},"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":"1702.02705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-09T04:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"b3b48a81a3aac358f2cccddb53a47751572607270ef04dcae87c1a6b31baa9cc","abstract_canon_sha256":"e0d96eacd2c27f4c29efb2f1a6e44f6fcb09f367da0a9a6a496d09f3b39a7d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:02.686613Z","signature_b64":"32svlZEM/TCsazPCUBrcNpCeNGkiPSC23e4Ozryx3Hge1Qc8dQvZ1bybw4/WQnjXleZBLF5sdCI5jKaM/0BZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eea44b726bae5a558baa769bb502f8e8a7e23ce5ee13a1ca81c5ba9ca756f2e","last_reissued_at":"2026-05-18T00:51:02.686184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:02.686184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving linearizability using forward simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Constantin Enea, Michael Emmi, Suha Orhun Mutluergil","submitted_at":"2017-02-09T04:47:05Z","abstract_excerpt":"Linearizability is the standard correctness criterion concurrent data structures such as stacks and queues. It allows to establish observational refinement between a concurrent implementation and an atomic reference implementation.Proving linearizability requires identifying linearization points for each method invocation along all possible computations, leading to valid sequential executions, or alternatively, establishing forward and backward simulations. In both cases, carrying out proofs is hard and complex in general. In particular, backward reasoning is difficult in the context of progra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02705","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":"1702.02705","created_at":"2026-05-18T00:51:02.686248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02705v1","created_at":"2026-05-18T00:51:02.686248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02705","created_at":"2026-05-18T00:51:02.686248+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3VEJNZGXLS2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3VEJNZGXLS2KWF2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3VEJNZG","created_at":"2026-05-18T12:31:18.294218+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/H3VEJNZGXLS2KWF2U5U3WUBPR2","json":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2.json","graph_json":"https://pith.science/api/pith-number/H3VEJNZGXLS2KWF2U5U3WUBPR2/graph.json","events_json":"https://pith.science/api/pith-number/H3VEJNZGXLS2KWF2U5U3WUBPR2/events.json","paper":"https://pith.science/paper/H3VEJNZG"},"agent_actions":{"view_html":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2","download_json":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2.json","view_paper":"https://pith.science/paper/H3VEJNZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02705&json=true","fetch_graph":"https://pith.science/api/pith-number/H3VEJNZGXLS2KWF2U5U3WUBPR2/graph.json","fetch_events":"https://pith.science/api/pith-number/H3VEJNZGXLS2KWF2U5U3WUBPR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2/action/storage_attestation","attest_author":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2/action/author_attestation","sign_citation":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2/action/citation_signature","submit_replication":"https://pith.science/pith/H3VEJNZGXLS2KWF2U5U3WUBPR2/action/replication_record"}},"created_at":"2026-05-18T00:51:02.686248+00:00","updated_at":"2026-05-18T00:51:02.686248+00:00"}