{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GOL3BBLWWVRQIO3GCJOREUGLJJ","short_pith_number":"pith:GOL3BBLW","schema_version":"1.0","canonical_sha256":"3397b08576b563043b66125d1250cb4a68b5b2ac8d30e7d00f3a3a189d0c609d","source":{"kind":"arxiv","id":"2501.07503","version":1},"attestation_state":"computed","paper":{"title":"Big Atomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Daniel Anderson, Guy E. Blelloch, Siddhartha Jayanti","submitted_at":"2025-01-13T17:19:38Z","abstract_excerpt":"In this paper, we give theoretically and practically efficient implementations of Big Atomics, i.e., $k$-word linearizable registers that support the load, store, and compare-and-swap (CAS) operations. While modern hardware supports $k = 1$ and sometimes $k = 2$ (e.g., double-width compare-and-swap in x86), our implementations support arbitrary $k$. Big Atomics are useful in many applications, including atomic manipulation of tuples, version lists, and implementing load-linked/store-conditional (LL/SC). We design fast, lock-free implementations of big atomics based on a novel fast-path-slow-pa"},"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":"2501.07503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-13T17:19:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"61e7fba5fe165fccd1a92fff0e603f72c3645d50f8460d082c0fb64540f44a2f","abstract_canon_sha256":"1fdeb4aa496da745e564340410b4506ba6aa2d508f276ebdde0da424dff81feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:29.423662Z","signature_b64":"B2iehORs1ANYgSqrVb+t5SVZdojp58dvFebiiRjmt6fwTQryvI6DnZJSlt+l9givTsqiKs93xbVBcvdADlZbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3397b08576b563043b66125d1250cb4a68b5b2ac8d30e7d00f3a3a189d0c609d","last_reissued_at":"2026-07-05T10:00:29.423139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:29.423139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Big Atomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Daniel Anderson, Guy E. Blelloch, Siddhartha Jayanti","submitted_at":"2025-01-13T17:19:38Z","abstract_excerpt":"In this paper, we give theoretically and practically efficient implementations of Big Atomics, i.e., $k$-word linearizable registers that support the load, store, and compare-and-swap (CAS) operations. While modern hardware supports $k = 1$ and sometimes $k = 2$ (e.g., double-width compare-and-swap in x86), our implementations support arbitrary $k$. Big Atomics are useful in many applications, including atomic manipulation of tuples, version lists, and implementing load-linked/store-conditional (LL/SC). We design fast, lock-free implementations of big atomics based on a novel fast-path-slow-pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07503","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/2501.07503/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":"2501.07503","created_at":"2026-07-05T10:00:29.423198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07503v1","created_at":"2026-07-05T10:00:29.423198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07503","created_at":"2026-07-05T10:00:29.423198+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOL3BBLWWVRQ","created_at":"2026-07-05T10:00:29.423198+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOL3BBLWWVRQIO3G","created_at":"2026-07-05T10:00:29.423198+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOL3BBLW","created_at":"2026-07-05T10:00:29.423198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13321","citing_title":"Skiplists with Foresight: Skipping Cache Misses","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ","json":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ.json","graph_json":"https://pith.science/api/pith-number/GOL3BBLWWVRQIO3GCJOREUGLJJ/graph.json","events_json":"https://pith.science/api/pith-number/GOL3BBLWWVRQIO3GCJOREUGLJJ/events.json","paper":"https://pith.science/paper/GOL3BBLW"},"agent_actions":{"view_html":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ","download_json":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ.json","view_paper":"https://pith.science/paper/GOL3BBLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07503&json=true","fetch_graph":"https://pith.science/api/pith-number/GOL3BBLWWVRQIO3GCJOREUGLJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GOL3BBLWWVRQIO3GCJOREUGLJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ/action/storage_attestation","attest_author":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ/action/author_attestation","sign_citation":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ/action/citation_signature","submit_replication":"https://pith.science/pith/GOL3BBLWWVRQIO3GCJOREUGLJJ/action/replication_record"}},"created_at":"2026-07-05T10:00:29.423198+00:00","updated_at":"2026-07-05T10:00:29.423198+00:00"}