{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SVSTHOGIUCKTFG5WHEFPWH22DF","short_pith_number":"pith:SVSTHOGI","schema_version":"1.0","canonical_sha256":"956533b8c8a095329bb6390afb1f5a1955090c389befcc516b90b6ac4f6534e1","source":{"kind":"arxiv","id":"1811.01259","version":1},"attestation_state":"computed","paper":{"title":"QuickXsort - A Fast Sorting Scheme in Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Armin Wei{\\ss}, Sebastian Wild, Stefan Edelkamp","submitted_at":"2018-11-03T18:00:29Z","abstract_excerpt":"QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's Quicksort algorithm with X, where X can be chosen from a wider range of other known sorting algorithms, like Heapsort, Insertionsort and Mergesort. Its major advantage is that QuickXsort can be in-place even if X is not. In this work we provide general transfer theorems expressing the number of comparisons of QuickXsort in terms of the number of comparisons of X. More specifically, if pivots are chosen as medians of (not too fast) growing size samples, the average number of comparisons of QuickXsort and X di"},"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":"1811.01259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T18:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"ffab740b61953eb13f262fac5ec5c6c4a1b86e2e7828719309106cb0f8e87401","abstract_canon_sha256":"adb3eaa453b2d1e0a849c4e054a4d3f5efe69db7d807e2008598c422d1521b2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.820307Z","signature_b64":"gXDKlhiqsrLBJpa6nOxrF7YyixF83ZZw2zsB8TIigPf++tH/xzVf3wSb+PwTe0GIN2wbgjaP1RKdQBDIWen5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"956533b8c8a095329bb6390afb1f5a1955090c389befcc516b90b6ac4f6534e1","last_reissued_at":"2026-05-18T00:01:34.819591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.819591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QuickXsort - A Fast Sorting Scheme in Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Armin Wei{\\ss}, Sebastian Wild, Stefan Edelkamp","submitted_at":"2018-11-03T18:00:29Z","abstract_excerpt":"QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's Quicksort algorithm with X, where X can be chosen from a wider range of other known sorting algorithms, like Heapsort, Insertionsort and Mergesort. Its major advantage is that QuickXsort can be in-place even if X is not. In this work we provide general transfer theorems expressing the number of comparisons of QuickXsort in terms of the number of comparisons of X. More specifically, if pivots are chosen as medians of (not too fast) growing size samples, the average number of comparisons of QuickXsort and X di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01259","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":"1811.01259","created_at":"2026-05-18T00:01:34.819715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01259v1","created_at":"2026-05-18T00:01:34.819715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01259","created_at":"2026-05-18T00:01:34.819715+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVSTHOGIUCKT","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVSTHOGIUCKTFG5W","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVSTHOGI","created_at":"2026-05-18T12:32:53.628368+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/SVSTHOGIUCKTFG5WHEFPWH22DF","json":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF.json","graph_json":"https://pith.science/api/pith-number/SVSTHOGIUCKTFG5WHEFPWH22DF/graph.json","events_json":"https://pith.science/api/pith-number/SVSTHOGIUCKTFG5WHEFPWH22DF/events.json","paper":"https://pith.science/paper/SVSTHOGI"},"agent_actions":{"view_html":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF","download_json":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF.json","view_paper":"https://pith.science/paper/SVSTHOGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01259&json=true","fetch_graph":"https://pith.science/api/pith-number/SVSTHOGIUCKTFG5WHEFPWH22DF/graph.json","fetch_events":"https://pith.science/api/pith-number/SVSTHOGIUCKTFG5WHEFPWH22DF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF/action/storage_attestation","attest_author":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF/action/author_attestation","sign_citation":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF/action/citation_signature","submit_replication":"https://pith.science/pith/SVSTHOGIUCKTFG5WHEFPWH22DF/action/replication_record"}},"created_at":"2026-05-18T00:01:34.819715+00:00","updated_at":"2026-05-18T00:01:34.819715+00:00"}