{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RGTM2W7HMUKZVBW4ZGZW2CWSTP","short_pith_number":"pith:RGTM2W7H","schema_version":"1.0","canonical_sha256":"89a6cd5be765159a86dcc9b36d0ad29bf4edb6b5164c5e5e3afe63d3c301ae71","source":{"kind":"arxiv","id":"1502.04908","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04908","created_at":"2026-05-18T01:27:05.424490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04908v2","created_at":"2026-05-18T01:27:05.424490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04908","created_at":"2026-05-18T01:27:05.424490+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGTM2W7HMUKZ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGTM2W7HMUKZVBW4","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGTM2W7H","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP","json":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP.json","graph_json":"https://pith.science/api/pith-number/RGTM2W7HMUKZVBW4ZGZW2CWSTP/graph.json","events_json":"https://pith.science/api/pith-number/RGTM2W7HMUKZVBW4ZGZW2CWSTP/events.json","paper":"https://pith.science/paper/RGTM2W7H"},"agent_actions":{"view_html":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP","download_json":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP.json","view_paper":"https://pith.science/paper/RGTM2W7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04908&json=true","fetch_graph":"https://pith.science/api/pith-number/RGTM2W7HMUKZVBW4ZGZW2CWSTP/graph.json","fetch_events":"https://pith.science/api/pith-number/RGTM2W7HMUKZVBW4ZGZW2CWSTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/action/storage_attestation","attest_author":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/action/author_attestation","sign_citation":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/action/citation_signature","submit_replication":"https://pith.science/pith/RGTM2W7HMUKZVBW4ZGZW2CWSTP/action/replication_record"}},"created_at":"2026-05-18T01:27:05.424490+00:00","updated_at":"2026-05-18T01:27:05.424490+00:00"}