{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DAEP7M2RVEKEUP7UY3W5QQ4YV7","short_pith_number":"pith:DAEP7M2R","canonical_record":{"source":{"id":"1701.05463","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-19T15:13:14Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"d0fa0199c0a8e2f924f4d08d3c8dcebbd9c92e80697f09dc938bf6cfff5775d5","abstract_canon_sha256":"481579c84347d26d3f34f344667fec20edeef19a3612d987e09de856aa2803e3"},"schema_version":"1.0"},"canonical_sha256":"1808ffb351a9144a3ff4c6edd84398aff7c5122385a7e6cd65655c9d1947b47d","source":{"kind":"arxiv","id":"1701.05463","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05463","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05463v4","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05463","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"DAEP7M2RVEKE","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DAEP7M2RVEKEUP7U","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DAEP7M2R","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DAEP7M2RVEKEUP7UY3W5QQ4YV7","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05463","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-19T15:13:14Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"d0fa0199c0a8e2f924f4d08d3c8dcebbd9c92e80697f09dc938bf6cfff5775d5","abstract_canon_sha256":"481579c84347d26d3f34f344667fec20edeef19a3612d987e09de856aa2803e3"},"schema_version":"1.0"},"canonical_sha256":"1808ffb351a9144a3ff4c6edd84398aff7c5122385a7e6cd65655c9d1947b47d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:51.338008Z","signature_b64":"aihpTQH3BgzB7c5QE81GaERehuWG08NDMJbEhJCfse7TnF3iTJ9XyzcOmLUIw132IuQ1en+LcTVLNkJMNxRPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1808ffb351a9144a3ff4c6edd84398aff7c5122385a7e6cd65655c9d1947b47d","last_reissued_at":"2026-05-18T00:40:51.337244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:51.337244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05463","source_version":4,"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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wm+rIzL2TpLguw7uZMYIApegFV240sxsUixRT+NvyOwRZO27lfWmTMBidXxH24cVZEGnBrv/sDC81svbHzECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:28:21.871342Z"},"content_sha256":"29ba8d2bb4da2c126ab009aa37bc94bc0ddae909b332b79d9b396f783e25cab4","schema_version":"1.0","event_id":"sha256:29ba8d2bb4da2c126ab009aa37bc94bc0ddae909b332b79d9b396f783e25cab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DAEP7M2RVEKEUP7UY3W5QQ4YV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Linearizability Using Partial Orders (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexey Gotsman, Artem Khyzha, Matthew Parkinson, Mike Dodds","submitted_at":"2017-01-19T15:13:14Z","abstract_excerpt":"Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data structure's sequential specification. Proving linearizability is often challenging because an operation's position in the linearization order may depend on future operations. This makes it very difficult to incrementally construct the linearization in a proof.\n  We propose a new proof method that can handle data structures with such future-dependent linearizations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05463","kind":"arxiv","version":4},"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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNb3QEN8pp/KaqGTN2xFdj3LVblza2By8cdsveAvZPBmPddUVSYtJPJHJuKG2yCtcGj9QYc0Ehlgmd8HdOO5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:28:21.871691Z"},"content_sha256":"369fbec267de678e05f6bb22bffe976bdd0c4b16c585b4c9fabdf6e1d53b2822","schema_version":"1.0","event_id":"sha256:369fbec267de678e05f6bb22bffe976bdd0c4b16c585b4c9fabdf6e1d53b2822"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/bundle.json","state_url":"https://pith.science/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/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-01T10:28:21Z","links":{"resolver":"https://pith.science/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7","bundle":"https://pith.science/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/bundle.json","state":"https://pith.science/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAEP7M2RVEKEUP7UY3W5QQ4YV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DAEP7M2RVEKEUP7UY3W5QQ4YV7","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":"481579c84347d26d3f34f344667fec20edeef19a3612d987e09de856aa2803e3","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-19T15:13:14Z","title_canon_sha256":"d0fa0199c0a8e2f924f4d08d3c8dcebbd9c92e80697f09dc938bf6cfff5775d5"},"schema_version":"1.0","source":{"id":"1701.05463","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05463","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05463v4","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05463","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"DAEP7M2RVEKE","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DAEP7M2RVEKEUP7U","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DAEP7M2R","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:369fbec267de678e05f6bb22bffe976bdd0c4b16c585b4c9fabdf6e1d53b2822","target":"graph","created_at":"2026-05-18T00:40:51Z","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":"Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data structure's sequential specification. Proving linearizability is often challenging because an operation's position in the linearization order may depend on future operations. This makes it very difficult to incrementally construct the linearization in a proof.\n  We propose a new proof method that can handle data structures with such future-dependent linearizations.","authors_text":"Alexey Gotsman, Artem Khyzha, Matthew Parkinson, Mike Dodds","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-19T15:13:14Z","title":"Proving Linearizability Using Partial Orders (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05463","kind":"arxiv","version":4},"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:29ba8d2bb4da2c126ab009aa37bc94bc0ddae909b332b79d9b396f783e25cab4","target":"record","created_at":"2026-05-18T00:40:51Z","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":"481579c84347d26d3f34f344667fec20edeef19a3612d987e09de856aa2803e3","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-19T15:13:14Z","title_canon_sha256":"d0fa0199c0a8e2f924f4d08d3c8dcebbd9c92e80697f09dc938bf6cfff5775d5"},"schema_version":"1.0","source":{"id":"1701.05463","kind":"arxiv","version":4}},"canonical_sha256":"1808ffb351a9144a3ff4c6edd84398aff7c5122385a7e6cd65655c9d1947b47d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1808ffb351a9144a3ff4c6edd84398aff7c5122385a7e6cd65655c9d1947b47d","first_computed_at":"2026-05-18T00:40:51.337244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:51.337244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aihpTQH3BgzB7c5QE81GaERehuWG08NDMJbEhJCfse7TnF3iTJ9XyzcOmLUIw132IuQ1en+LcTVLNkJMNxRPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:51.338008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05463","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29ba8d2bb4da2c126ab009aa37bc94bc0ddae909b332b79d9b396f783e25cab4","sha256:369fbec267de678e05f6bb22bffe976bdd0c4b16c585b4c9fabdf6e1d53b2822"],"state_sha256":"083c150ecdfdd04184fabddf3a771998697b9cc01d377776b6763123c69069ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/cVv7VGj90UjKKzPN4siCruj4wjYF/Ii3pyEtH2tCb46L4ILB6U9twqKaz9ZTRLBDhduI6bLi0QDwXCKTk2wBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:28:21.873599Z","bundle_sha256":"5a5507e86c73e267d6952d29235e65dee0dee1e0da9ce70797fe9512947d8c0c"}}