{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RBSMKNJKP7V23AQFAUYUBWOXFD","short_pith_number":"pith:RBSMKNJK","schema_version":"1.0","canonical_sha256":"8864c5352a7febad8205053140d9d728cb5fa00211c68982acb2170d1308ed3f","source":{"kind":"arxiv","id":"1403.2056","version":1},"attestation_state":"computed","paper":{"title":"Engineering Parallel String Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andreas Eberle, Peter Sanders, Timo Bingmann","submitted_at":"2014-03-09T13:43:32Z","abstract_excerpt":"We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredictions. Then we focus on NUMA architectures, and develop parallel multiway LCP-merge and -mergesort to reduce the number of random memory accesses to remote nodes. Additionally, we parallelize vari"},"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":"1403.2056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-09T13:43:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"453ffa8368d92729e3337202ebb55f621c7421fdb327d6ffd3a7a024bdffb40f","abstract_canon_sha256":"d8f90f1523bc0c6b3dfa81c096a6f21d9e21a758dfc451c16856a123c581c6e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:50.970325Z","signature_b64":"qqRnlbUULNyf1J7zSy3XByZr8IKY+uu2WXC0zs59bPP9pFzx/7l2w45IUzLdyLEZ1o/uCsZIJ0i7Q2Ck3lonBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8864c5352a7febad8205053140d9d728cb5fa00211c68982acb2170d1308ed3f","last_reissued_at":"2026-05-18T02:56:50.969886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:50.969886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Engineering Parallel String Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andreas Eberle, Peter Sanders, Timo Bingmann","submitted_at":"2014-03-09T13:43:32Z","abstract_excerpt":"We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredictions. Then we focus on NUMA architectures, and develop parallel multiway LCP-merge and -mergesort to reduce the number of random memory accesses to remote nodes. Additionally, we parallelize vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2056","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":"1403.2056","created_at":"2026-05-18T02:56:50.969952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2056v1","created_at":"2026-05-18T02:56:50.969952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2056","created_at":"2026-05-18T02:56:50.969952+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBSMKNJKP7V2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBSMKNJKP7V23AQF","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBSMKNJK","created_at":"2026-05-18T12:28:46.137349+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/RBSMKNJKP7V23AQFAUYUBWOXFD","json":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD.json","graph_json":"https://pith.science/api/pith-number/RBSMKNJKP7V23AQFAUYUBWOXFD/graph.json","events_json":"https://pith.science/api/pith-number/RBSMKNJKP7V23AQFAUYUBWOXFD/events.json","paper":"https://pith.science/paper/RBSMKNJK"},"agent_actions":{"view_html":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD","download_json":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD.json","view_paper":"https://pith.science/paper/RBSMKNJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2056&json=true","fetch_graph":"https://pith.science/api/pith-number/RBSMKNJKP7V23AQFAUYUBWOXFD/graph.json","fetch_events":"https://pith.science/api/pith-number/RBSMKNJKP7V23AQFAUYUBWOXFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD/action/storage_attestation","attest_author":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD/action/author_attestation","sign_citation":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD/action/citation_signature","submit_replication":"https://pith.science/pith/RBSMKNJKP7V23AQFAUYUBWOXFD/action/replication_record"}},"created_at":"2026-05-18T02:56:50.969952+00:00","updated_at":"2026-05-18T02:56:50.969952+00:00"}