{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AL6EEFB6VYL5BKHXC2VA3CDJNT","short_pith_number":"pith:AL6EEFB6","schema_version":"1.0","canonical_sha256":"02fc42143eae17d0a8f716aa0d88696cf9ade6ce5e85b1513a695412df247879","source":{"kind":"arxiv","id":"1705.02257","version":2},"attestation_state":"computed","paper":{"title":"In-place Parallel Super Scalar Samplesort (IPS$^4$o)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Ferizovic, Michael Axtmann, Peter Sanders, Sascha Witt","submitted_at":"2017-05-05T15:18:08Z","abstract_excerpt":"We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with high probability. The main algorithmic contributions are new ways to make distribution-based algorithms in-place: On the practical side, by using coarse-grained block-based permutations, and on the theoretical side, we show how to eliminate the recursion stack. Extensive experiments show that our algorithm IPS$^4$o scales well on a variety of multi-core machines. We outperform our closest in-place competitor by a fact"},"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":"1705.02257","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-05-05T15:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"7ebc340f16c26795d2e03a9110d3180f2e1573f27c7cbec869f44e88d884a8eb","abstract_canon_sha256":"ad3fd8044e8233b35f9fac68b81f18ca1c265aff7627c3e4b413332da6ec62f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.297429Z","signature_b64":"AOtl58sSkjJq4lITdrWD3ZyqcWAYopIAlzpR5qqZTFJAQrytYUjM8unLmo0VWC3sg+ed2DD2BmAP8CMeVKzNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02fc42143eae17d0a8f716aa0d88696cf9ade6ce5e85b1513a695412df247879","last_reissued_at":"2026-05-18T00:41:12.296813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.296813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In-place Parallel Super Scalar Samplesort (IPS$^4$o)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Ferizovic, Michael Axtmann, Peter Sanders, Sascha Witt","submitted_at":"2017-05-05T15:18:08Z","abstract_excerpt":"We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with high probability. The main algorithmic contributions are new ways to make distribution-based algorithms in-place: On the practical side, by using coarse-grained block-based permutations, and on the theoretical side, we show how to eliminate the recursion stack. Extensive experiments show that our algorithm IPS$^4$o scales well on a variety of multi-core machines. We outperform our closest in-place competitor by a fact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02257","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":"1705.02257","created_at":"2026-05-18T00:41:12.296927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02257v2","created_at":"2026-05-18T00:41:12.296927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02257","created_at":"2026-05-18T00:41:12.296927+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL6EEFB6VYL5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL6EEFB6VYL5BKHX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL6EEFB6","created_at":"2026-05-18T12:31:05.417338+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/AL6EEFB6VYL5BKHXC2VA3CDJNT","json":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT.json","graph_json":"https://pith.science/api/pith-number/AL6EEFB6VYL5BKHXC2VA3CDJNT/graph.json","events_json":"https://pith.science/api/pith-number/AL6EEFB6VYL5BKHXC2VA3CDJNT/events.json","paper":"https://pith.science/paper/AL6EEFB6"},"agent_actions":{"view_html":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT","download_json":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT.json","view_paper":"https://pith.science/paper/AL6EEFB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02257&json=true","fetch_graph":"https://pith.science/api/pith-number/AL6EEFB6VYL5BKHXC2VA3CDJNT/graph.json","fetch_events":"https://pith.science/api/pith-number/AL6EEFB6VYL5BKHXC2VA3CDJNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT/action/storage_attestation","attest_author":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT/action/author_attestation","sign_citation":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT/action/citation_signature","submit_replication":"https://pith.science/pith/AL6EEFB6VYL5BKHXC2VA3CDJNT/action/replication_record"}},"created_at":"2026-05-18T00:41:12.296927+00:00","updated_at":"2026-05-18T00:41:12.296927+00:00"}