{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ABAASYBIUZPFKHSLKECEPIGPAE","short_pith_number":"pith:ABAASYBI","schema_version":"1.0","canonical_sha256":"0040096028a65e551e4b510447a0cf011db1277f86f39650b9f69ca64925930f","source":{"kind":"arxiv","id":"2008.02527","version":1},"attestation_state":"computed","paper":{"title":"Efficient Multi-word Compare and Swap","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Kogan, Igor Zablotchi, Rachid Guerraoui, Virendra J. Marathe","submitted_at":"2020-08-06T08:59:03Z","abstract_excerpt":"Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementations of MCAS make heavy use of expensive compare-and-swap (CAS) instructions. Existing MCAS implementations indeed use at least 2k+1 CASes per k-CAS. This leads to the natural desire to minimize the number of CASes required to implement MCAS. We first prove in this paper that it is impossible to \"pack\" the information required to perform a k-word CAS (k-CAS) in less than k locations to be CASed. Then we present the f"},"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":"2008.02527","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-06T08:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"409f16554b91b97c1f9e3dadd4de3ef13da0d6ed26f3c6d725c7c61bb9d2b5b4","abstract_canon_sha256":"63715ac28851ac9595a916f6ba29e0fe59d3c5383d94a2ce246161823ec607e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:14.694678Z","signature_b64":"iPSYxQOlV/X21Rp7Jcqqik4tVRh9VkfyfdsWblixb9lTT0oWLu7IbQ9Uvni2eyu8zLJ5tS3SRKRFiALqKVo4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0040096028a65e551e4b510447a0cf011db1277f86f39650b9f69ca64925930f","last_reissued_at":"2026-07-05T01:25:14.694238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:14.694238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Multi-word Compare and Swap","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Kogan, Igor Zablotchi, Rachid Guerraoui, Virendra J. Marathe","submitted_at":"2020-08-06T08:59:03Z","abstract_excerpt":"Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementations of MCAS make heavy use of expensive compare-and-swap (CAS) instructions. Existing MCAS implementations indeed use at least 2k+1 CASes per k-CAS. This leads to the natural desire to minimize the number of CASes required to implement MCAS. We first prove in this paper that it is impossible to \"pack\" the information required to perform a k-word CAS (k-CAS) in less than k locations to be CASed. Then we present the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02527","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.02527/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.02527","created_at":"2026-07-05T01:25:14.694291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.02527v1","created_at":"2026-07-05T01:25:14.694291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02527","created_at":"2026-07-05T01:25:14.694291+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABAASYBIUZPF","created_at":"2026-07-05T01:25:14.694291+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABAASYBIUZPFKHSL","created_at":"2026-07-05T01:25:14.694291+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABAASYBI","created_at":"2026-07-05T01:25:14.694291+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/ABAASYBIUZPFKHSLKECEPIGPAE","json":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE.json","graph_json":"https://pith.science/api/pith-number/ABAASYBIUZPFKHSLKECEPIGPAE/graph.json","events_json":"https://pith.science/api/pith-number/ABAASYBIUZPFKHSLKECEPIGPAE/events.json","paper":"https://pith.science/paper/ABAASYBI"},"agent_actions":{"view_html":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE","download_json":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE.json","view_paper":"https://pith.science/paper/ABAASYBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.02527&json=true","fetch_graph":"https://pith.science/api/pith-number/ABAASYBIUZPFKHSLKECEPIGPAE/graph.json","fetch_events":"https://pith.science/api/pith-number/ABAASYBIUZPFKHSLKECEPIGPAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE/action/storage_attestation","attest_author":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE/action/author_attestation","sign_citation":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE/action/citation_signature","submit_replication":"https://pith.science/pith/ABAASYBIUZPFKHSLKECEPIGPAE/action/replication_record"}},"created_at":"2026-07-05T01:25:14.694291+00:00","updated_at":"2026-07-05T01:25:14.694291+00:00"}