{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PHPXRVZ4GI7425UVW3QT5X255X","short_pith_number":"pith:PHPXRVZ4","schema_version":"1.0","canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","source":{"kind":"arxiv","id":"1008.2849","version":2},"attestation_state":"computed","paper":{"title":"Faster Radix Sort via Virtual Memory and Write-Combining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Jan Wassenberg, Peter Sanders","submitted_at":"2010-08-17T08:39:59Z","abstract_excerpt":"Sorting algorithms are the deciding factor for the performance of common operations such as removal of duplicates or database sort-merge joins. This work focuses on 32-bit integer keys, optionally paired with a 32-bit value. We present a fast radix sorting algorithm that builds upon a microarchitecture-aware variant of counting sort. Taking advantage of virtual memory and making use of write-combining yields a per-pass throughput corresponding to at least 88 % of the system's peak memory bandwidth. Our implementation outperforms Intel's recently published radix sort by a factor of 1.5. It also"},"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":"1008.2849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-17T08:39:59Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"091f965c10d83a760e84da8e2cb733effd47466d3a46df84b1453bdd1f038a95","abstract_canon_sha256":"9eed95bb352860540ab45bb6c2e7a80dc5e08dddb34b169e211dfe3bbd9b8d5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:24.732658Z","signature_b64":"oZiU8jgGz+K0oMkbj3d5EU+PS/FxGQeUzVL1YCIasTFQehQLzwr1A7EtXnqvMSJvAv3fGZShm0CGukUQgUkcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","last_reissued_at":"2026-05-18T04:41:24.731804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:24.731804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Radix Sort via Virtual Memory and Write-Combining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Jan Wassenberg, Peter Sanders","submitted_at":"2010-08-17T08:39:59Z","abstract_excerpt":"Sorting algorithms are the deciding factor for the performance of common operations such as removal of duplicates or database sort-merge joins. This work focuses on 32-bit integer keys, optionally paired with a 32-bit value. We present a fast radix sorting algorithm that builds upon a microarchitecture-aware variant of counting sort. Taking advantage of virtual memory and making use of write-combining yields a per-pass throughput corresponding to at least 88 % of the system's peak memory bandwidth. Our implementation outperforms Intel's recently published radix sort by a factor of 1.5. It also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2849","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":"1008.2849","created_at":"2026-05-18T04:41:24.731944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2849v2","created_at":"2026-05-18T04:41:24.731944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2849","created_at":"2026-05-18T04:41:24.731944+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHPXRVZ4GI74","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHPXRVZ4GI7425UV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHPXRVZ4","created_at":"2026-05-18T12:26:12.377268+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/PHPXRVZ4GI7425UVW3QT5X255X","json":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X.json","graph_json":"https://pith.science/api/pith-number/PHPXRVZ4GI7425UVW3QT5X255X/graph.json","events_json":"https://pith.science/api/pith-number/PHPXRVZ4GI7425UVW3QT5X255X/events.json","paper":"https://pith.science/paper/PHPXRVZ4"},"agent_actions":{"view_html":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X","download_json":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X.json","view_paper":"https://pith.science/paper/PHPXRVZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2849&json=true","fetch_graph":"https://pith.science/api/pith-number/PHPXRVZ4GI7425UVW3QT5X255X/graph.json","fetch_events":"https://pith.science/api/pith-number/PHPXRVZ4GI7425UVW3QT5X255X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/action/storage_attestation","attest_author":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/action/author_attestation","sign_citation":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/action/citation_signature","submit_replication":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/action/replication_record"}},"created_at":"2026-05-18T04:41:24.731944+00:00","updated_at":"2026-05-18T04:41:24.731944+00:00"}