{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CSAOGPFUBVBGRGYRA2IJ3WOKIG","short_pith_number":"pith:CSAOGPFU","schema_version":"1.0","canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","source":{"kind":"arxiv","id":"2401.00710","version":1},"attestation_state":"computed","paper":{"title":"Parallel Integer Sort: Theory and Practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Laxman Dhulipala, Xiaojun Dong, Yan Gu, Yihan Sun","submitted_at":"2024-01-01T09:39:12Z","abstract_excerpt":"Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid theoretical foundation for their widespread usage in practice and strong performance. In practice, we design a new integer sorting algorithm, \\textsf{DovetailSort}, that is theoretically-efficient and has good practical performance.\n  In particular, \\textsf{DovetailSort} overcomes a common challenge in existing parallel integer sorting algorithms,"},"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":"2401.00710","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-01T09:39:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"772502018425571680be4c2a926c9d8f20d236bbb024262c069e8713b4efb4aa","abstract_canon_sha256":"459a7ce562113551a33239b5b228ccc73cc3f4751a8bb3972c71008cc2ad2f15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:14.752588Z","signature_b64":"bsOmpzhRLla7Z8nHO6b96oWE0l+4/s7224Hhta6fFYeY9BzLPRdECHxudbyyGTP3C4LDzN49Cfm0sHwIkE+7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1480e33cb40d42689b1106909dd9ca418131f25ebb01fb28279638975159a42a","last_reissued_at":"2026-05-20T00:00:14.751677Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:14.751677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Integer Sort: Theory and Practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Laxman Dhulipala, Xiaojun Dong, Yan Gu, Yihan Sun","submitted_at":"2024-01-01T09:39:12Z","abstract_excerpt":"Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid theoretical foundation for their widespread usage in practice and strong performance. In practice, we design a new integer sorting algorithm, \\textsf{DovetailSort}, that is theoretically-efficient and has good practical performance.\n  In particular, \\textsf{DovetailSort} overcomes a common challenge in existing parallel integer sorting algorithms,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00710","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/2401.00710/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":"2401.00710","created_at":"2026-05-20T00:00:14.751813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.00710v1","created_at":"2026-05-20T00:00:14.751813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00710","created_at":"2026-05-20T00:00:14.751813+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSAOGPFUBVBG","created_at":"2026-05-20T00:00:14.751813+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSAOGPFUBVBGRGYR","created_at":"2026-05-20T00:00:14.751813+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSAOGPFU","created_at":"2026-05-20T00:00:14.751813+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/CSAOGPFUBVBGRGYRA2IJ3WOKIG","json":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG.json","graph_json":"https://pith.science/api/pith-number/CSAOGPFUBVBGRGYRA2IJ3WOKIG/graph.json","events_json":"https://pith.science/api/pith-number/CSAOGPFUBVBGRGYRA2IJ3WOKIG/events.json","paper":"https://pith.science/paper/CSAOGPFU"},"agent_actions":{"view_html":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG","download_json":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG.json","view_paper":"https://pith.science/paper/CSAOGPFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.00710&json=true","fetch_graph":"https://pith.science/api/pith-number/CSAOGPFUBVBGRGYRA2IJ3WOKIG/graph.json","fetch_events":"https://pith.science/api/pith-number/CSAOGPFUBVBGRGYRA2IJ3WOKIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/action/storage_attestation","attest_author":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/action/author_attestation","sign_citation":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/action/citation_signature","submit_replication":"https://pith.science/pith/CSAOGPFUBVBGRGYRA2IJ3WOKIG/action/replication_record"}},"created_at":"2026-05-20T00:00:14.751813+00:00","updated_at":"2026-05-20T00:00:14.751813+00:00"}