{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Z6GM22BMXPLOUKBOV7DWOOKY2P","short_pith_number":"pith:Z6GM22BM","schema_version":"1.0","canonical_sha256":"cf8ccd682cbbd6ea282eafc7673958d3eb53245753daab5efabe76f78f0e8e99","source":{"kind":"arxiv","id":"1510.06967","version":1},"attestation_state":"computed","paper":{"title":"Opacity Proof for CaPR+ Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anshu S Anand, R K Shyamasundar, Sathya Peri","submitted_at":"2015-10-23T15:25:05Z","abstract_excerpt":"In this paper, we describe an enhanced Automatic Check- pointing and Partial Rollback algorithm(CaP R + ) to realize Software Transactional Memory(STM) that is based on con- tinuous conflict detection, lazy versioning with automatic checkpointing, and partial rollback. Further, we provide a proof of correctness of CaP R+ algorithm, in particular, Opacity, a STM correctness criterion, that precisely captures the intuitive correctness guarantees required of transactional memories. The algorithm provides a natural way to realize a hybrid system of pure aborts and partial rollbacks. We have also i"},"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":"1510.06967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-23T15:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"0c173893bdae851387ae93ac7f14752183703fcd8ec1fce84cd2ec3bf6271f9b","abstract_canon_sha256":"196a769437191eafe40a9659308d4913862c7cca5772607a157e4d2360944749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:22.546000Z","signature_b64":"LwDqQ652BFibMC8CCjKraicmdoHT3s1TwGMGJgDjcv9yFtCsjlT7qDL6Xzvq3NUISdK5kz6eOT3dysUdai5jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf8ccd682cbbd6ea282eafc7673958d3eb53245753daab5efabe76f78f0e8e99","last_reissued_at":"2026-05-18T01:29:22.545304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:22.545304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opacity Proof for CaPR+ Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anshu S Anand, R K Shyamasundar, Sathya Peri","submitted_at":"2015-10-23T15:25:05Z","abstract_excerpt":"In this paper, we describe an enhanced Automatic Check- pointing and Partial Rollback algorithm(CaP R + ) to realize Software Transactional Memory(STM) that is based on con- tinuous conflict detection, lazy versioning with automatic checkpointing, and partial rollback. Further, we provide a proof of correctness of CaP R+ algorithm, in particular, Opacity, a STM correctness criterion, that precisely captures the intuitive correctness guarantees required of transactional memories. The algorithm provides a natural way to realize a hybrid system of pure aborts and partial rollbacks. We have also i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06967","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.06967","created_at":"2026-05-18T01:29:22.545445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06967v1","created_at":"2026-05-18T01:29:22.545445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06967","created_at":"2026-05-18T01:29:22.545445+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6GM22BMXPLO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6GM22BMXPLOUKBO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6GM22BM","created_at":"2026-05-18T12:29:52.810259+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/Z6GM22BMXPLOUKBOV7DWOOKY2P","json":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P.json","graph_json":"https://pith.science/api/pith-number/Z6GM22BMXPLOUKBOV7DWOOKY2P/graph.json","events_json":"https://pith.science/api/pith-number/Z6GM22BMXPLOUKBOV7DWOOKY2P/events.json","paper":"https://pith.science/paper/Z6GM22BM"},"agent_actions":{"view_html":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P","download_json":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P.json","view_paper":"https://pith.science/paper/Z6GM22BM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06967&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6GM22BMXPLOUKBOV7DWOOKY2P/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6GM22BMXPLOUKBOV7DWOOKY2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P/action/storage_attestation","attest_author":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P/action/author_attestation","sign_citation":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P/action/citation_signature","submit_replication":"https://pith.science/pith/Z6GM22BMXPLOUKBOV7DWOOKY2P/action/replication_record"}},"created_at":"2026-05-18T01:29:22.545445+00:00","updated_at":"2026-05-18T01:29:22.545445+00:00"}