{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FDCC6EPB76KF6AZLU4Q3TTZAMW","short_pith_number":"pith:FDCC6EPB","schema_version":"1.0","canonical_sha256":"28c42f11e1ff945f032ba721b9cf20658d6d2c54c4f0e0c9776a4fb4956725d6","source":{"kind":"arxiv","id":"1612.02557","version":1},"attestation_state":"computed","paper":{"title":"Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Agnieszka Debudaj-Grabysz, Marek Kokot, Sebastian Deorowicz","submitted_at":"2016-12-08T08:20:48Z","abstract_excerpt":"The paper introduces RADULS, a new parallel sorter based on radix sort algorithm, intended to organize ultra-large data sets efficiently. For example 4G 16-byte records can be sorted with 16 threads in less than 15 seconds on Intel Xeon-based workstation. The implementation of RADULS is not only highly optimized to gain such an excellent performance, but also parallelized in a cache friendly manner to make the most of modern multicore architectures. Besides, our parallel scheduler launches a few different procedures at runtime, according to the current parameters of the execution, for proper w"},"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":"1612.02557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T08:20:48Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"a58e7d4a21604f838677d7ec6f974b261b5a0ae5051fec8abc94c198ba3a8d1f","abstract_canon_sha256":"a46119c5712b420b321e5e5769dc62b6ec92a6337bea705a265ef510b7f4eea8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:33.377626Z","signature_b64":"0PssPLE26jr8kf8C2zg9zFuBuc4L/N+jXz7WjTOVnlq4EPtCLr2zXlwlWf41xYbCbY1/p1d58wVuQVw+LyeqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28c42f11e1ff945f032ba721b9cf20658d6d2c54c4f0e0c9776a4fb4956725d6","last_reissued_at":"2026-05-18T00:55:33.377082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:33.377082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Agnieszka Debudaj-Grabysz, Marek Kokot, Sebastian Deorowicz","submitted_at":"2016-12-08T08:20:48Z","abstract_excerpt":"The paper introduces RADULS, a new parallel sorter based on radix sort algorithm, intended to organize ultra-large data sets efficiently. For example 4G 16-byte records can be sorted with 16 threads in less than 15 seconds on Intel Xeon-based workstation. The implementation of RADULS is not only highly optimized to gain such an excellent performance, but also parallelized in a cache friendly manner to make the most of modern multicore architectures. Besides, our parallel scheduler launches a few different procedures at runtime, according to the current parameters of the execution, for proper w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02557","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":""},"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":"1612.02557","created_at":"2026-05-18T00:55:33.377187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02557v1","created_at":"2026-05-18T00:55:33.377187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02557","created_at":"2026-05-18T00:55:33.377187+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDCC6EPB76KF","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDCC6EPB76KF6AZL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDCC6EPB","created_at":"2026-05-18T12:30:15.759754+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/FDCC6EPB76KF6AZLU4Q3TTZAMW","json":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW.json","graph_json":"https://pith.science/api/pith-number/FDCC6EPB76KF6AZLU4Q3TTZAMW/graph.json","events_json":"https://pith.science/api/pith-number/FDCC6EPB76KF6AZLU4Q3TTZAMW/events.json","paper":"https://pith.science/paper/FDCC6EPB"},"agent_actions":{"view_html":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW","download_json":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW.json","view_paper":"https://pith.science/paper/FDCC6EPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02557&json=true","fetch_graph":"https://pith.science/api/pith-number/FDCC6EPB76KF6AZLU4Q3TTZAMW/graph.json","fetch_events":"https://pith.science/api/pith-number/FDCC6EPB76KF6AZLU4Q3TTZAMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW/action/storage_attestation","attest_author":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW/action/author_attestation","sign_citation":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW/action/citation_signature","submit_replication":"https://pith.science/pith/FDCC6EPB76KF6AZLU4Q3TTZAMW/action/replication_record"}},"created_at":"2026-05-18T00:55:33.377187+00:00","updated_at":"2026-05-18T00:55:33.377187+00:00"}