{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6O4Q6LPHUDFP46C3JL35GWDDOR","short_pith_number":"pith:6O4Q6LPH","canonical_record":{"source":{"id":"1610.01004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T14:07:52Z","cross_cats_sorted":["cs.DC","cs.DS","cs.PL"],"title_canon_sha256":"c101c947a93794e3cec0a7f7b7f33820123a12ccb0f45b1dcf0880b59bd35814","abstract_canon_sha256":"fc53cedd9b8e5290cf33c2278d4ada791be96fdb674224a80438bdfd23767a34"},"schema_version":"1.0"},"canonical_sha256":"f3b90f2de7a0cafe785b4af7d35863747db1a6d90ae962fe54fde73c9c3917b4","source":{"kind":"arxiv","id":"1610.01004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01004","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01004v1","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01004","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"6O4Q6LPHUDFP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6O4Q6LPHUDFP46C3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6O4Q6LPH","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6O4Q6LPHUDFP46C3JL35GWDDOR","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T14:07:52Z","cross_cats_sorted":["cs.DC","cs.DS","cs.PL"],"title_canon_sha256":"c101c947a93794e3cec0a7f7b7f33820123a12ccb0f45b1dcf0880b59bd35814","abstract_canon_sha256":"fc53cedd9b8e5290cf33c2278d4ada791be96fdb674224a80438bdfd23767a34"},"schema_version":"1.0"},"canonical_sha256":"f3b90f2de7a0cafe785b4af7d35863747db1a6d90ae962fe54fde73c9c3917b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:12.682169Z","signature_b64":"J+DW5R40STYTuCREwT0Z5/92Jinv4byc1eEyGU3MtST+9+bnlI6LLKQ4L6F9cUYuPbMzwkfFlIQR8ACfNzB+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b90f2de7a0cafe785b4af7d35863747db1a6d90ae962fe54fde73c9c3917b4","last_reissued_at":"2026-05-18T01:03:12.681616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:12.681616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01004","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-18T01:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlldRWR/LoRRznii7ECoF0kaup18VSntcEk9ICL4I3BK8t59HTSiq73YhZvOOOOOQ0bdE/EJIps70SNEjs8mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:46:27.095673Z"},"content_sha256":"d63d4ac2a7a3b86642faeed625fda1651cf0b55e6d4b2adeae83b10dac856f55","schema_version":"1.0","event_id":"sha256:d63d4ac2a7a3b86642faeed625fda1651cf0b55e6d4b2adeae83b10dac856f55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6O4Q6LPHUDFP46C3JL35GWDDOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing Opacity to Linearizability: A Sound and Complete Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.PL"],"primary_cat":"cs.LO","authors_text":"Alasdair Armstrong, Brijesh Dongol, Simon Doherty","submitted_at":"2016-10-04T14:07:52Z","abstract_excerpt":"Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines conditions for serialising concurrent transactions.\n  Proving opacity is complicated because it allows concurrent transactions to observe distinct memory states, while TM implementations are typically based on one single shared store. This paper presents a sound and complete method, based on coarse-grained abstraction, for reducing proofs of opacity to the rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01004","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-18T01:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSWh6UJXBqrMZSl9RDItylLZv5UZaRNQQwf00n5jVjqah3hncbXIywy4Bx8QqWb+cebzreGv3UNG+1UcPaYYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:46:27.096016Z"},"content_sha256":"7a5e151b073aa009a1a8165101bd7a415b4e3a44adc4375f95cd46af53dc77ee","schema_version":"1.0","event_id":"sha256:7a5e151b073aa009a1a8165101bd7a415b4e3a44adc4375f95cd46af53dc77ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/bundle.json","state_url":"https://pith.science/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/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-03T10:46:27Z","links":{"resolver":"https://pith.science/pith/6O4Q6LPHUDFP46C3JL35GWDDOR","bundle":"https://pith.science/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/bundle.json","state":"https://pith.science/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O4Q6LPHUDFP46C3JL35GWDDOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6O4Q6LPHUDFP46C3JL35GWDDOR","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":"fc53cedd9b8e5290cf33c2278d4ada791be96fdb674224a80438bdfd23767a34","cross_cats_sorted":["cs.DC","cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T14:07:52Z","title_canon_sha256":"c101c947a93794e3cec0a7f7b7f33820123a12ccb0f45b1dcf0880b59bd35814"},"schema_version":"1.0","source":{"id":"1610.01004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01004","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01004v1","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01004","created_at":"2026-05-18T01:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"6O4Q6LPHUDFP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6O4Q6LPHUDFP46C3","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6O4Q6LPH","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7a5e151b073aa009a1a8165101bd7a415b4e3a44adc4375f95cd46af53dc77ee","target":"graph","created_at":"2026-05-18T01:03:12Z","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":"Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines conditions for serialising concurrent transactions.\n  Proving opacity is complicated because it allows concurrent transactions to observe distinct memory states, while TM implementations are typically based on one single shared store. This paper presents a sound and complete method, based on coarse-grained abstraction, for reducing proofs of opacity to the rela","authors_text":"Alasdair Armstrong, Brijesh Dongol, Simon Doherty","cross_cats":["cs.DC","cs.DS","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T14:07:52Z","title":"Reducing Opacity to Linearizability: A Sound and Complete Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01004","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:d63d4ac2a7a3b86642faeed625fda1651cf0b55e6d4b2adeae83b10dac856f55","target":"record","created_at":"2026-05-18T01:03:12Z","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":"fc53cedd9b8e5290cf33c2278d4ada791be96fdb674224a80438bdfd23767a34","cross_cats_sorted":["cs.DC","cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T14:07:52Z","title_canon_sha256":"c101c947a93794e3cec0a7f7b7f33820123a12ccb0f45b1dcf0880b59bd35814"},"schema_version":"1.0","source":{"id":"1610.01004","kind":"arxiv","version":1}},"canonical_sha256":"f3b90f2de7a0cafe785b4af7d35863747db1a6d90ae962fe54fde73c9c3917b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b90f2de7a0cafe785b4af7d35863747db1a6d90ae962fe54fde73c9c3917b4","first_computed_at":"2026-05-18T01:03:12.681616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:12.681616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+DW5R40STYTuCREwT0Z5/92Jinv4byc1eEyGU3MtST+9+bnlI6LLKQ4L6F9cUYuPbMzwkfFlIQR8ACfNzB+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:12.682169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d63d4ac2a7a3b86642faeed625fda1651cf0b55e6d4b2adeae83b10dac856f55","sha256:7a5e151b073aa009a1a8165101bd7a415b4e3a44adc4375f95cd46af53dc77ee"],"state_sha256":"a57968a56f50b5809a5f7d0380974cfcdd8e810802471526d78637f9c0401773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mwhIMkuIyH6jXHA4XBH/kObOpBoYvTay2FTNwQmnQUIn23ZfBxil3NJZyJAIPsy65ruZ5Y8C/DZnM5Er6S+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:46:27.097987Z","bundle_sha256":"15b1d7a37866cb9e50213568795447480f3db9a7d286c05f4fd36c3f3b544c14"}}