{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PHPXRVZ4GI7425UVW3QT5X255X","short_pith_number":"pith:PHPXRVZ4","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"},"canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","source":{"kind":"arxiv","id":"1008.2849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2849","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2849v2","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2849","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"PHPXRVZ4GI74","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PHPXRVZ4GI7425UV","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PHPXRVZ4","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PHPXRVZ4GI7425UVW3QT5X255X","target":"record","payload":{"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"},"canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","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"},"source_kind":"arxiv","source_id":"1008.2849","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4W0U2m5GNjHgjx9RhesNhoMdLkWy5uLPKG/U7CjAdYs+D8znbwegRvgsw6WiKM+nCesd5o6ftHXOQFXt70ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:29.292277Z"},"content_sha256":"793d82b14420ee91c2c360bbbd190a967f2424cc34e2876f42d4c82333f3b9fb","schema_version":"1.0","event_id":"sha256:793d82b14420ee91c2c360bbbd190a967f2424cc34e2876f42d4c82333f3b9fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PHPXRVZ4GI7425UVW3QT5X255X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XO/ESokDroci4os07Lmlx3muA7VtiPzAh2M6BNX4Mb1fYG/3hotCn/oOaOYOw6ecMf/2I7X/xWPg19Pb0uLvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:29.293015Z"},"content_sha256":"da0a3386ee70a4adedad5a1fa4dfd1133164e32673fccfe9ee749f0355fbf369","schema_version":"1.0","event_id":"sha256:da0a3386ee70a4adedad5a1fa4dfd1133164e32673fccfe9ee749f0355fbf369"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/bundle.json","state_url":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHPXRVZ4GI7425UVW3QT5X255X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T23:07:29Z","links":{"resolver":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X","bundle":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/bundle.json","state":"https://pith.science/pith/PHPXRVZ4GI7425UVW3QT5X255X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHPXRVZ4GI7425UVW3QT5X255X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PHPXRVZ4GI7425UVW3QT5X255X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9eed95bb352860540ab45bb6c2e7a80dc5e08dddb34b169e211dfe3bbd9b8d5f","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-17T08:39:59Z","title_canon_sha256":"091f965c10d83a760e84da8e2cb733effd47466d3a46df84b1453bdd1f038a95"},"schema_version":"1.0","source":{"id":"1008.2849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2849","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2849v2","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2849","created_at":"2026-05-18T04:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"PHPXRVZ4GI74","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PHPXRVZ4GI7425UV","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PHPXRVZ4","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:da0a3386ee70a4adedad5a1fa4dfd1133164e32673fccfe9ee749f0355fbf369","target":"graph","created_at":"2026-05-18T04:41:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jan Wassenberg, Peter Sanders","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-17T08:39:59Z","title":"Faster Radix Sort via Virtual Memory and Write-Combining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2849","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:793d82b14420ee91c2c360bbbd190a967f2424cc34e2876f42d4c82333f3b9fb","target":"record","created_at":"2026-05-18T04:41:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9eed95bb352860540ab45bb6c2e7a80dc5e08dddb34b169e211dfe3bbd9b8d5f","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-17T08:39:59Z","title_canon_sha256":"091f965c10d83a760e84da8e2cb733effd47466d3a46df84b1453bdd1f038a95"},"schema_version":"1.0","source":{"id":"1008.2849","kind":"arxiv","version":2}},"canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79df78d73c323fcd7695b6e13edf5dedf9a8efd04ae46a70b07e6fbf634c539c","first_computed_at":"2026-05-18T04:41:24.731804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:24.731804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZiU8jgGz+K0oMkbj3d5EU+PS/FxGQeUzVL1YCIasTFQehQLzwr1A7EtXnqvMSJvAv3fGZShm0CGukUQgUkcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:24.732658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:793d82b14420ee91c2c360bbbd190a967f2424cc34e2876f42d4c82333f3b9fb","sha256:da0a3386ee70a4adedad5a1fa4dfd1133164e32673fccfe9ee749f0355fbf369"],"state_sha256":"244e0fcd0afabc2a31003bb92aa8191b47ca77eb87ec69402ea11abeed5b29f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUbD37VoMqnxKw1hauqVO69u3GZeZZW+hNzDhOaZDZOUT6YHoic/BsAURxxJHxnnOOV3XETY7S9/B8T5wf1cBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:07:29.296917Z","bundle_sha256":"1b50dca660c0210dfe72b5755a8e907db69f95ff2e86b1dd53057028bdc11501"}}