{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5BUUPR5BUAZZTSZGJNH35UXL5R","short_pith_number":"pith:5BUUPR5B","schema_version":"1.0","canonical_sha256":"e86947c7a1a03399cb264b4fbed2ebec55287727427701ea753597edf547db61","source":{"kind":"arxiv","id":"1803.01237","version":2},"attestation_state":"computed","paper":{"title":"Histogram Sort with Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Laxmikant Kale, Vipul Harsh","submitted_at":"2018-03-03T20:51:38Z","abstract_excerpt":"To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enables partitioning to be done using a representative subset of the keys, while histogramming enables evaluation and iterative improvement of a given partition. We introduce Histogram sort with sampling (HSS), which combines sampling and iterative histogramming to find high quality partitions with minimal data movement and high practical performance. Compared to the best known (recently introduced) algorithm for finding "},"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":"1803.01237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-03T20:51:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"297d0115fdd17b2a897c9252200db08e9ef19bb425110bff52fcaf4885e99db3","abstract_canon_sha256":"e36ecf63cd6be487cab91ad99628c1c84ceecc189bb757d4170439c53aaf09fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:36.323261Z","signature_b64":"w0i2aZCSL7qmdS4Gnm2R7yqOF/e42VHKZhs//+YG9Ed/LNr6aw/fJNAIl8938YjjbKqqGw0gbR8T7Y/nEuMNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86947c7a1a03399cb264b4fbed2ebec55287727427701ea753597edf547db61","last_reissued_at":"2026-05-17T23:47:36.322838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:36.322838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Histogram Sort with Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Laxmikant Kale, Vipul Harsh","submitted_at":"2018-03-03T20:51:38Z","abstract_excerpt":"To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enables partitioning to be done using a representative subset of the keys, while histogramming enables evaluation and iterative improvement of a given partition. We introduce Histogram sort with sampling (HSS), which combines sampling and iterative histogramming to find high quality partitions with minimal data movement and high practical performance. Compared to the best known (recently introduced) algorithm for finding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01237","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":"1803.01237","created_at":"2026-05-17T23:47:36.322904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01237v2","created_at":"2026-05-17T23:47:36.322904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01237","created_at":"2026-05-17T23:47:36.322904+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BUUPR5BUAZZ","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BUUPR5BUAZZTSZG","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BUUPR5B","created_at":"2026-05-18T12:32:08.215937+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/5BUUPR5BUAZZTSZGJNH35UXL5R","json":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R.json","graph_json":"https://pith.science/api/pith-number/5BUUPR5BUAZZTSZGJNH35UXL5R/graph.json","events_json":"https://pith.science/api/pith-number/5BUUPR5BUAZZTSZGJNH35UXL5R/events.json","paper":"https://pith.science/paper/5BUUPR5B"},"agent_actions":{"view_html":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R","download_json":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R.json","view_paper":"https://pith.science/paper/5BUUPR5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01237&json=true","fetch_graph":"https://pith.science/api/pith-number/5BUUPR5BUAZZTSZGJNH35UXL5R/graph.json","fetch_events":"https://pith.science/api/pith-number/5BUUPR5BUAZZTSZGJNH35UXL5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R/action/storage_attestation","attest_author":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R/action/author_attestation","sign_citation":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R/action/citation_signature","submit_replication":"https://pith.science/pith/5BUUPR5BUAZZTSZGJNH35UXL5R/action/replication_record"}},"created_at":"2026-05-17T23:47:36.322904+00:00","updated_at":"2026-05-17T23:47:36.322904+00:00"}