{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M5JYS6G4ZGXKHNEWM542YAQMH7","short_pith_number":"pith:M5JYS6G4","canonical_record":{"source":{"id":"1502.02725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-09T23:14:49Z","cross_cats_sorted":[],"title_canon_sha256":"99f80fd1d7f435c61bb1a286ddade7e6af41823ce60e42ffbf0cea338455c1a7","abstract_canon_sha256":"e237b0170b6ce1c7d55064bb2c630a3d6028702dc4859ebc1edee118f877e3fb"},"schema_version":"1.0"},"canonical_sha256":"67538978dcc9aea3b4966779ac020c3ffa28d6c054cf4ecf42972114374bc65e","source":{"kind":"arxiv","id":"1502.02725","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02725","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02725v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02725","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"M5JYS6G4ZGXK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M5JYS6G4ZGXKHNEW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M5JYS6G4","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M5JYS6G4ZGXKHNEWM542YAQMH7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-09T23:14:49Z","cross_cats_sorted":[],"title_canon_sha256":"99f80fd1d7f435c61bb1a286ddade7e6af41823ce60e42ffbf0cea338455c1a7","abstract_canon_sha256":"e237b0170b6ce1c7d55064bb2c630a3d6028702dc4859ebc1edee118f877e3fb"},"schema_version":"1.0"},"canonical_sha256":"67538978dcc9aea3b4966779ac020c3ffa28d6c054cf4ecf42972114374bc65e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:38.834502Z","signature_b64":"trNJQk+xXeWnqtcFYwLxl1dswYDf+EgYkKlU75xGg2zoRisgtBwKfqAUpWlBBeEUWts1TSYW5Ayn89AtWupYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67538978dcc9aea3b4966779ac020c3ffa28d6c054cf4ecf42972114374bc65e","last_reissued_at":"2026-05-18T01:19:38.833971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:38.833971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02725","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-18T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SpPVjfWQwdiwRfGLJGARnGtQL1dbZpmx0y/1qh8aSdxM0T0tOlI4xNhltYh7VdV5pGtLoTYrH2+o0vZwsgeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:15:11.528589Z"},"content_sha256":"c893463f0fc78b7061f631dc8a88d410bf850476e01c6444fad4305be944c35d","schema_version":"1.0","event_id":"sha256:c893463f0fc78b7061f631dc8a88d410bf850476e01c6444fad4305be944c35d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M5JYS6G4ZGXKHNEWM542YAQMH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Why Transactional Memory Should Not Be Obstruction-Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Srivatsan Ravi","submitted_at":"2015-02-09T23:14:49Z","abstract_excerpt":"Transactional memory (TM) is an inherently optimistic abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option of aborting them in the future. Early TM designs avoided using locks and relied on non-blocking synchronization to ensure obstruction-freedom: a transaction that encounters no step contention is not allowed to abort. However, it was later observed that obstruction-free TMs perform poorly and, as a result, state-of-the-art TM implementations are nowadays blocking, allowing aborts because of data conflicts rath"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02725","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-18T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpWYU4M0TGs/f0hpo0tEBwiWJs/2bbVuluGBxP55rXOJIntUTeIcKNN1BowXBWVpuTK7ET3VHmwhdyOZ6clEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:15:11.529303Z"},"content_sha256":"2e8ccc3e3ce7a934e7a9e7cc10922d31eb93af03dbc51ce3963b7bd37170019c","schema_version":"1.0","event_id":"sha256:2e8ccc3e3ce7a934e7a9e7cc10922d31eb93af03dbc51ce3963b7bd37170019c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/bundle.json","state_url":"https://pith.science/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/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-09T10:15:11Z","links":{"resolver":"https://pith.science/pith/M5JYS6G4ZGXKHNEWM542YAQMH7","bundle":"https://pith.science/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/bundle.json","state":"https://pith.science/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5JYS6G4ZGXKHNEWM542YAQMH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M5JYS6G4ZGXKHNEWM542YAQMH7","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":"e237b0170b6ce1c7d55064bb2c630a3d6028702dc4859ebc1edee118f877e3fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-09T23:14:49Z","title_canon_sha256":"99f80fd1d7f435c61bb1a286ddade7e6af41823ce60e42ffbf0cea338455c1a7"},"schema_version":"1.0","source":{"id":"1502.02725","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02725","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02725v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02725","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"M5JYS6G4ZGXK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M5JYS6G4ZGXKHNEW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M5JYS6G4","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:2e8ccc3e3ce7a934e7a9e7cc10922d31eb93af03dbc51ce3963b7bd37170019c","target":"graph","created_at":"2026-05-18T01:19:38Z","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 (TM) is an inherently optimistic abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option of aborting them in the future. Early TM designs avoided using locks and relied on non-blocking synchronization to ensure obstruction-freedom: a transaction that encounters no step contention is not allowed to abort. However, it was later observed that obstruction-free TMs perform poorly and, as a result, state-of-the-art TM implementations are nowadays blocking, allowing aborts because of data conflicts rath","authors_text":"Petr Kuznetsov, Srivatsan Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-09T23:14:49Z","title":"Why Transactional Memory Should Not Be Obstruction-Free"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02725","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:c893463f0fc78b7061f631dc8a88d410bf850476e01c6444fad4305be944c35d","target":"record","created_at":"2026-05-18T01:19:38Z","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":"e237b0170b6ce1c7d55064bb2c630a3d6028702dc4859ebc1edee118f877e3fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-09T23:14:49Z","title_canon_sha256":"99f80fd1d7f435c61bb1a286ddade7e6af41823ce60e42ffbf0cea338455c1a7"},"schema_version":"1.0","source":{"id":"1502.02725","kind":"arxiv","version":2}},"canonical_sha256":"67538978dcc9aea3b4966779ac020c3ffa28d6c054cf4ecf42972114374bc65e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67538978dcc9aea3b4966779ac020c3ffa28d6c054cf4ecf42972114374bc65e","first_computed_at":"2026-05-18T01:19:38.833971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:38.833971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"trNJQk+xXeWnqtcFYwLxl1dswYDf+EgYkKlU75xGg2zoRisgtBwKfqAUpWlBBeEUWts1TSYW5Ayn89AtWupYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:38.834502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02725","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c893463f0fc78b7061f631dc8a88d410bf850476e01c6444fad4305be944c35d","sha256:2e8ccc3e3ce7a934e7a9e7cc10922d31eb93af03dbc51ce3963b7bd37170019c"],"state_sha256":"829ad230c247b636811fcfbddebae6891981d51a4fb98a0716553dca0d061fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8J1z8BPk84yGI8boi7EsmFUdpq0SRYiANXgBrANBKBHDdlon2XlPH7sBi8hkghpFRUTAzMEFjvPSlQesaY1/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:15:11.537476Z","bundle_sha256":"0a3df8d7cecddc90a6db1b5879fa63500c27266619ac9527d19ba33cdb8cf8ab"}}