{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H6T7ANAV3QHHLJDP2BCCVEAROZ","short_pith_number":"pith:H6T7ANAV","schema_version":"1.0","canonical_sha256":"3fa7f03415dc0e75a46fd0442a90117653771d9f1e0094e78ccc0ae3b06d92b7","source":{"kind":"arxiv","id":"1803.05948","version":2},"attestation_state":"computed","paper":{"title":"Average Cost of QuickXsort with Pivot Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2018-03-15T18:58:15Z","abstract_excerpt":"QuickXsort is a strategy to combine Quicksort with another sorting method X, so that the result has essentially the same comparison cost as X in isolation, but sorts in place even when X requires a linear-size buffer. We solve the recurrence for QuickXsort precisely up to the linear term including the optimization to choose pivots from a sample of k elements. This allows to immediately obtain overall average costs using only the average costs of sorting method X (as if run in isolation). We thereby extend and greatly simplify the analysis of QuickHeapsort and QuickMergesort with practically ef"},"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.05948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T18:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"6b5f705a6dbf3d69e0cb15451d7bf872aad27c996e1872eb4663f7cc9c68d31d","abstract_canon_sha256":"edd8bd2242be31cd43432d7da973b75cc505f60d760a670bd760762ac327f04c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.477636Z","signature_b64":"ZNddUHWJJ1Px6njNKt5A896Q9zmXY7sJULa7yR9yCAb1GAKueN3zUcurtWg+TJy+Bo/jp2schE0z2JEftGdbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fa7f03415dc0e75a46fd0442a90117653771d9f1e0094e78ccc0ae3b06d92b7","last_reissued_at":"2026-05-17T23:47:03.477006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.477006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Cost of QuickXsort with Pivot Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2018-03-15T18:58:15Z","abstract_excerpt":"QuickXsort is a strategy to combine Quicksort with another sorting method X, so that the result has essentially the same comparison cost as X in isolation, but sorts in place even when X requires a linear-size buffer. We solve the recurrence for QuickXsort precisely up to the linear term including the optimization to choose pivots from a sample of k elements. This allows to immediately obtain overall average costs using only the average costs of sorting method X (as if run in isolation). We thereby extend and greatly simplify the analysis of QuickHeapsort and QuickMergesort with practically ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05948","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.05948","created_at":"2026-05-17T23:47:03.477101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05948v2","created_at":"2026-05-17T23:47:03.477101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05948","created_at":"2026-05-17T23:47:03.477101+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6T7ANAV3QHH","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6T7ANAV3QHHLJDP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6T7ANAV","created_at":"2026-05-18T12:32:28.185984+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/H6T7ANAV3QHHLJDP2BCCVEAROZ","json":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ.json","graph_json":"https://pith.science/api/pith-number/H6T7ANAV3QHHLJDP2BCCVEAROZ/graph.json","events_json":"https://pith.science/api/pith-number/H6T7ANAV3QHHLJDP2BCCVEAROZ/events.json","paper":"https://pith.science/paper/H6T7ANAV"},"agent_actions":{"view_html":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ","download_json":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ.json","view_paper":"https://pith.science/paper/H6T7ANAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05948&json=true","fetch_graph":"https://pith.science/api/pith-number/H6T7ANAV3QHHLJDP2BCCVEAROZ/graph.json","fetch_events":"https://pith.science/api/pith-number/H6T7ANAV3QHHLJDP2BCCVEAROZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ/action/storage_attestation","attest_author":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ/action/author_attestation","sign_citation":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ/action/citation_signature","submit_replication":"https://pith.science/pith/H6T7ANAV3QHHLJDP2BCCVEAROZ/action/replication_record"}},"created_at":"2026-05-17T23:47:03.477101+00:00","updated_at":"2026-05-17T23:47:03.477101+00:00"}