{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:G7QN6AE4NWPFTDTBTUD3XX4PSG","short_pith_number":"pith:G7QN6AE4","schema_version":"1.0","canonical_sha256":"37e0df009c6d9e598e619d07bbdf8f91bd80ac48ce25ad8f0921a4c205ea7683","source":{"kind":"arxiv","id":"2206.01784","version":1},"attestation_state":"computed","paper":{"title":"Onesweep: A Faster Least Significant Digit Radix Sort for GPUs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andy Adinets, Duane Merrill","submitted_at":"2022-06-03T19:08:55Z","abstract_excerpt":"We present Onesweep, a least-significant digit (LSD) radix sorting algorithm for large GPU sorting problems residing in global memory. Our parallel algorithm employs a method of single-pass prefix sum that only requires ~2n global read/write operations for each digit-binning iteration. This exhibits a significant reduction in last-level memory traffic versus contemporary GPU radix sorting implementations, where each iteration of digit binning requires two passes through the dataset totaling ~3n global memory operations.\n  On the NVIDIA A100 GPU, our approach achieves 29.4 GKey/s when sorting 2"},"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":"2206.01784","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-06-03T19:08:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eb7494c3e9755779aa8d290947a06674dfefed2e09a99e9c98f69e618d8ec597","abstract_canon_sha256":"f39be213cd99891f1d13480ba1b22b665d5c9a69cfe9f70d427239fce17d2201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:56.224194Z","signature_b64":"db/j52JhuWxwgLgeJFl/GagOXwmtABlGywnkLaWMqc6orHEIJKhRgbYx3+pkscCTV3fHs0meybS3kFbRLqE5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37e0df009c6d9e598e619d07bbdf8f91bd80ac48ce25ad8f0921a4c205ea7683","last_reissued_at":"2026-07-05T04:28:56.223663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:56.223663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Onesweep: A Faster Least Significant Digit Radix Sort for GPUs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andy Adinets, Duane Merrill","submitted_at":"2022-06-03T19:08:55Z","abstract_excerpt":"We present Onesweep, a least-significant digit (LSD) radix sorting algorithm for large GPU sorting problems residing in global memory. Our parallel algorithm employs a method of single-pass prefix sum that only requires ~2n global read/write operations for each digit-binning iteration. This exhibits a significant reduction in last-level memory traffic versus contemporary GPU radix sorting implementations, where each iteration of digit binning requires two passes through the dataset totaling ~3n global memory operations.\n  On the NVIDIA A100 GPU, our approach achieves 29.4 GKey/s when sorting 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01784","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/2206.01784/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":"2206.01784","created_at":"2026-07-05T04:28:56.223723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.01784v1","created_at":"2026-07-05T04:28:56.223723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01784","created_at":"2026-07-05T04:28:56.223723+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7QN6AE4NWPF","created_at":"2026-07-05T04:28:56.223723+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7QN6AE4NWPFTDTB","created_at":"2026-07-05T04:28:56.223723+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7QN6AE4","created_at":"2026-07-05T04:28:56.223723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18980","citing_title":"AdaGScale: Viewpoint-Adaptive Gaussian Scaling in 3D Gaussian Splatting to Reduce Gaussian-Tile Pairs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG","json":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG.json","graph_json":"https://pith.science/api/pith-number/G7QN6AE4NWPFTDTBTUD3XX4PSG/graph.json","events_json":"https://pith.science/api/pith-number/G7QN6AE4NWPFTDTBTUD3XX4PSG/events.json","paper":"https://pith.science/paper/G7QN6AE4"},"agent_actions":{"view_html":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG","download_json":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG.json","view_paper":"https://pith.science/paper/G7QN6AE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.01784&json=true","fetch_graph":"https://pith.science/api/pith-number/G7QN6AE4NWPFTDTBTUD3XX4PSG/graph.json","fetch_events":"https://pith.science/api/pith-number/G7QN6AE4NWPFTDTBTUD3XX4PSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG/action/storage_attestation","attest_author":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG/action/author_attestation","sign_citation":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG/action/citation_signature","submit_replication":"https://pith.science/pith/G7QN6AE4NWPFTDTBTUD3XX4PSG/action/replication_record"}},"created_at":"2026-07-05T04:28:56.223723+00:00","updated_at":"2026-07-05T04:28:56.223723+00:00"}