{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DZGMSQCB5WHNQJWTGY2D5JEJFM","short_pith_number":"pith:DZGMSQCB","canonical_record":{"source":{"id":"1407.6876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-25T12:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"8a11f486202c3f31eeb6d312be2cb7913b7eb51f4d85aa30b3300c55572de72b","abstract_canon_sha256":"c1400601d9456b89588c3e398752e0caf16f52ded2acdee8944826eefbae1b16"},"schema_version":"1.0"},"canonical_sha256":"1e4cc94041ed8ed826d336343ea4892b15801cfb25f1c3ba4afa51b34b946311","source":{"kind":"arxiv","id":"1407.6876","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6876","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6876v2","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6876","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"DZGMSQCB5WHN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DZGMSQCB5WHNQJWT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DZGMSQCB","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DZGMSQCB5WHNQJWTGY2D5JEJFM","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-25T12:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"8a11f486202c3f31eeb6d312be2cb7913b7eb51f4d85aa30b3300c55572de72b","abstract_canon_sha256":"c1400601d9456b89588c3e398752e0caf16f52ded2acdee8944826eefbae1b16"},"schema_version":"1.0"},"canonical_sha256":"1e4cc94041ed8ed826d336343ea4892b15801cfb25f1c3ba4afa51b34b946311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:11.983599Z","signature_b64":"QcOXo++nMwpsMAIayts7EGu34I/cIJzPO2RuBDnJxIk65WjhIJgoiutJ/+JsRG3lgt8RAUCfwJHzPnZbua8yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e4cc94041ed8ed826d336343ea4892b15801cfb25f1c3ba4afa51b34b946311","last_reissued_at":"2026-05-18T02:45:11.983173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:11.983173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6876","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QphZ+O9u/02egj472ux8byFw56AD8JmzwbJ2uMJctZc8TzmyH4uDjT2cKMH0/rKhUOeHG0jxjAoVcGTCQ0lZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:55:59.834008Z"},"content_sha256":"fe3a10168b13d531e75f355bb21caeaa2239b5ca4898378e51dbfa04dd3c8a55","schema_version":"1.0","event_id":"sha256:fe3a10168b13d531e75f355bb21caeaa2239b5ca4898378e51dbfa04dd3c8a55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DZGMSQCB5WHNQJWTGY2D5JEJFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Partial Wait-Freedom in Transactional Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Srivatsan Ravi","submitted_at":"2014-07-25T12:52:59Z","abstract_excerpt":"Transactional memory (TM) is a convenient synchronization tool that allows concurrent threads to declare sequences of instructions on shared data as speculative \\emph{transactions} with \"all-or-nothing\" semantics. It is known that dynamic transactional memory cannot provide \\emph{wait-free} progress in the sense that every transaction commits in a finite number of its own steps. In this paper, we explore the costs of providing wait-freedom to only a \\emph{subset} of transactions. Since most transactional workloads are believed to be read-dominated, we require that read-only transactions commit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6876","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gieaF67KHCJdWBM9Thj7eOfqo5O1MRzz6HRxOS4YoTSrISALvY7oPJoknJE1GTLADfcdiGEVaAoqIBunWelCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:55:59.834359Z"},"content_sha256":"36011c857e855682fc0346664faeb21ca140b760120a4edfaf4f6254d1f14687","schema_version":"1.0","event_id":"sha256:36011c857e855682fc0346664faeb21ca140b760120a4edfaf4f6254d1f14687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/bundle.json","state_url":"https://pith.science/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/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-09T09:55:59Z","links":{"resolver":"https://pith.science/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM","bundle":"https://pith.science/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/bundle.json","state":"https://pith.science/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZGMSQCB5WHNQJWTGY2D5JEJFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DZGMSQCB5WHNQJWTGY2D5JEJFM","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":"c1400601d9456b89588c3e398752e0caf16f52ded2acdee8944826eefbae1b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-25T12:52:59Z","title_canon_sha256":"8a11f486202c3f31eeb6d312be2cb7913b7eb51f4d85aa30b3300c55572de72b"},"schema_version":"1.0","source":{"id":"1407.6876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6876","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6876v2","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6876","created_at":"2026-05-18T02:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"DZGMSQCB5WHN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DZGMSQCB5WHNQJWT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DZGMSQCB","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:36011c857e855682fc0346664faeb21ca140b760120a4edfaf4f6254d1f14687","target":"graph","created_at":"2026-05-18T02:45:11Z","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 a convenient synchronization tool that allows concurrent threads to declare sequences of instructions on shared data as speculative \\emph{transactions} with \"all-or-nothing\" semantics. It is known that dynamic transactional memory cannot provide \\emph{wait-free} progress in the sense that every transaction commits in a finite number of its own steps. In this paper, we explore the costs of providing wait-freedom to only a \\emph{subset} of transactions. Since most transactional workloads are believed to be read-dominated, we require that read-only transactions commit","authors_text":"Petr Kuznetsov, Srivatsan Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-25T12:52:59Z","title":"On Partial Wait-Freedom in Transactional Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6876","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:fe3a10168b13d531e75f355bb21caeaa2239b5ca4898378e51dbfa04dd3c8a55","target":"record","created_at":"2026-05-18T02:45:11Z","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":"c1400601d9456b89588c3e398752e0caf16f52ded2acdee8944826eefbae1b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-25T12:52:59Z","title_canon_sha256":"8a11f486202c3f31eeb6d312be2cb7913b7eb51f4d85aa30b3300c55572de72b"},"schema_version":"1.0","source":{"id":"1407.6876","kind":"arxiv","version":2}},"canonical_sha256":"1e4cc94041ed8ed826d336343ea4892b15801cfb25f1c3ba4afa51b34b946311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e4cc94041ed8ed826d336343ea4892b15801cfb25f1c3ba4afa51b34b946311","first_computed_at":"2026-05-18T02:45:11.983173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:11.983173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcOXo++nMwpsMAIayts7EGu34I/cIJzPO2RuBDnJxIk65WjhIJgoiutJ/+JsRG3lgt8RAUCfwJHzPnZbua8yBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:11.983599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe3a10168b13d531e75f355bb21caeaa2239b5ca4898378e51dbfa04dd3c8a55","sha256:36011c857e855682fc0346664faeb21ca140b760120a4edfaf4f6254d1f14687"],"state_sha256":"e6a3fb9aa52d9780f24c208c3f9f483db9404ad1e1b623fbb90c8a260ad2fb6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdliA19CAzFswabpuRsNF7IIIjLWddhZ75ffkLwqtdxs5Ez7aiJGYtVQg0vyShxw73qXLHESDiRD5oGDj6SqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:55:59.836294Z","bundle_sha256":"00bbb033c5296573d2d47abd3b670654affca641d6c71df5becd06c93f391d9a"}}