{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RGTM2W7HMUKZVBW4ZGZW2CWSTP","short_pith_number":"pith:RGTM2W7H","canonical_record":{"source":{"id":"1502.04908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-17T15:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"ed09d15f7e1004ed7260ec598c18daa8bfba4479f2a2a4bd4881d5e3a8274932","abstract_canon_sha256":"d033eec57912b1cdee61422df20cce916c550fce561c64e99e77131b64d9a6f7"},"schema_version":"1.0"},"canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","source":{"kind":"arxiv","id":"1502.04908","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04908","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04908v2","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04908","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"RGTM2W7HMUKZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RGTM2W7HMUKZVBW4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RGTM2W7H","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RGTM2W7HMUKZVBW4ZGZW2CWSTP","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-17T15:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"ed09d15f7e1004ed7260ec598c18daa8bfba4479f2a2a4bd4881d5e3a8274932","abstract_canon_sha256":"d033eec57912b1cdee61422df20cce916c550fce561c64e99e77131b64d9a6f7"},"schema_version":"1.0"},"canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:05.425071Z","signature_b64":"puq/uCVOYGbYLWKvP/RuoL551mon4ozr6yyxpjmmaFe2URag2q5Y+o6YGZ+CNJqIMQJDtWwIFzheyA5746RXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","last_reissued_at":"2026-05-18T01:27:05.424347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:05.424347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04908","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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diHxH6l/5Siy35ca2NAUhcIOOLadvfghcSVQ4eUFbmE+QEYcAX0oshSLlXqlGlsMLvtAKup3jne5HBGVT0D6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:09:30.008111Z"},"content_sha256":"65d37d908e05d0e992b95c5788a66275b601713269438d8ed36cddeade1d37e1","schema_version":"1.0","event_id":"sha256:65d37d908e05d0e992b95c5788a66275b601713269438d8ed36cddeade1d37e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RGTM2W7HMUKZVBW4ZGZW2CWSTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive Transactional Memory in Time and Space","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-17T15:01:06Z","abstract_excerpt":"Transactional memory (TM) allows concurrent processes to organize sequences of operations on shared \\emph{data items} into atomic transactions. A transaction may commit, in which case it appears to have executed sequentially or it may \\emph{abort}, in which case no data item is updated.\n  The TM programming paradigm emerged as an alternative to conventional fine-grained locking techniques, offering ease of programming and compositionality. Though typically themselves implemented using locks, TMs hide the inherent issues of lock-based synchronization behind a nice transactional programming inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04908","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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGXCeMa6VXut79WS5ak6cttzH3zJQD406waA6x6/oQUWwxYmUwYpJt77FKrioS/0a+mI/UfKy3NmC3PMEtuJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:09:30.008465Z"},"content_sha256":"7900cdf6b7faa6b22571be1e4f006725b208e8dd2cf661e3157253505597d5de","schema_version":"1.0","event_id":"sha256:7900cdf6b7faa6b22571be1e4f006725b208e8dd2cf661e3157253505597d5de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/bundle.json","state_url":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/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-09T11:09:30Z","links":{"resolver":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP","bundle":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/bundle.json","state":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RGTM2W7HMUKZVBW4ZGZW2CWSTP","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":"d033eec57912b1cdee61422df20cce916c550fce561c64e99e77131b64d9a6f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-17T15:01:06Z","title_canon_sha256":"ed09d15f7e1004ed7260ec598c18daa8bfba4479f2a2a4bd4881d5e3a8274932"},"schema_version":"1.0","source":{"id":"1502.04908","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04908","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04908v2","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04908","created_at":"2026-05-18T01:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"RGTM2W7HMUKZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RGTM2W7HMUKZVBW4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RGTM2W7H","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:7900cdf6b7faa6b22571be1e4f006725b208e8dd2cf661e3157253505597d5de","target":"graph","created_at":"2026-05-18T01:27:05Z","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) allows concurrent processes to organize sequences of operations on shared \\emph{data items} into atomic transactions. A transaction may commit, in which case it appears to have executed sequentially or it may \\emph{abort}, in which case no data item is updated.\n  The TM programming paradigm emerged as an alternative to conventional fine-grained locking techniques, offering ease of programming and compositionality. Though typically themselves implemented using locks, TMs hide the inherent issues of lock-based synchronization behind a nice transactional programming inte","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-17T15:01:06Z","title":"Progressive Transactional Memory in Time and Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04908","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:65d37d908e05d0e992b95c5788a66275b601713269438d8ed36cddeade1d37e1","target":"record","created_at":"2026-05-18T01:27:05Z","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":"d033eec57912b1cdee61422df20cce916c550fce561c64e99e77131b64d9a6f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-17T15:01:06Z","title_canon_sha256":"ed09d15f7e1004ed7260ec598c18daa8bfba4479f2a2a4bd4881d5e3a8274932"},"schema_version":"1.0","source":{"id":"1502.04908","kind":"arxiv","version":2}},"canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","first_computed_at":"2026-05-18T01:27:05.424347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:05.424347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"puq/uCVOYGbYLWKvP/RuoL551mon4ozr6yyxpjmmaFe2URag2q5Y+o6YGZ+CNJqIMQJDtWwIFzheyA5746RXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:05.425071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04908","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65d37d908e05d0e992b95c5788a66275b601713269438d8ed36cddeade1d37e1","sha256:7900cdf6b7faa6b22571be1e4f006725b208e8dd2cf661e3157253505597d5de"],"state_sha256":"3937777fa0799564486548b3a75dd69343f0023ecfeaaa5807fa919dd07ea33d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"di7VSlTiQrGiT7yXmnEVGhdZeWkewzfUSKxE21XsZcJvi/b7kyOfIuI2UkBIt2AFlm+rIVRWoJbWICJfJSPsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:09:30.010302Z","bundle_sha256":"accaee47a38d872ef8a24fe1c6a5ced15eb3c59a3ce252a8c3df4b0566fb0678"}}