{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RF3TEO75T7RYWAJR7MJFVCZBYD","short_pith_number":"pith:RF3TEO75","schema_version":"1.0","canonical_sha256":"8977323bfd9fe38b0131fb125a8b21c0cb3dc8bf101e23740a41718fa4ed5446","source":{"kind":"arxiv","id":"1510.04676","version":3},"attestation_state":"computed","paper":{"title":"How Good is Multi-Pivot Quicksort?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Pascal Klaue","submitted_at":"2015-10-15T19:30:29Z","abstract_excerpt":"Multi-Pivot Quicksort refers to variants of classical quicksort where in the partitioning step $k$ pivots are used to split the input into $k + 1$ segments. For many years, multi-pivot quicksort was regarded as impractical, but in 2009 a 2-pivot approach by Yaroslavskiy, Bentley, and Bloch was chosen as the standard sorting algorithm in Sun's Java 7. In 2014 at ALENEX, Kushagra et al. introduced an even faster algorithm that uses three pivots. This paper studies what possible advantages multi-pivot quicksort might offer in general. The contributions are as follows: Natural comparison-optimal a"},"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":"1510.04676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-15T19:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"74a80df506bccea682f65f6cd7064bacd18144199348d4099267bdc4f2955ade","abstract_canon_sha256":"c46a1b64191aa1dd7d2bebe0e5172868472e86b845286f8cd1de552d68dd1e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.469723Z","signature_b64":"/D99Dp8kNtzctOkCgOZF8Hfd/gb3lc1H9aG9Nh5UoAYoZWcqw8hnQGtM0kJc9yA9X5ne5Q8x+GE5sJ+qvaX6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8977323bfd9fe38b0131fb125a8b21c0cb3dc8bf101e23740a41718fa4ed5446","last_reissued_at":"2026-05-18T01:13:16.469271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.469271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Good is Multi-Pivot Quicksort?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Pascal Klaue","submitted_at":"2015-10-15T19:30:29Z","abstract_excerpt":"Multi-Pivot Quicksort refers to variants of classical quicksort where in the partitioning step $k$ pivots are used to split the input into $k + 1$ segments. For many years, multi-pivot quicksort was regarded as impractical, but in 2009 a 2-pivot approach by Yaroslavskiy, Bentley, and Bloch was chosen as the standard sorting algorithm in Sun's Java 7. In 2014 at ALENEX, Kushagra et al. introduced an even faster algorithm that uses three pivots. This paper studies what possible advantages multi-pivot quicksort might offer in general. The contributions are as follows: Natural comparison-optimal a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04676","kind":"arxiv","version":3},"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":"1510.04676","created_at":"2026-05-18T01:13:16.469362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04676v3","created_at":"2026-05-18T01:13:16.469362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04676","created_at":"2026-05-18T01:13:16.469362+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF3TEO75T7RY","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF3TEO75T7RYWAJR","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF3TEO75","created_at":"2026-05-18T12:29:39.896362+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/RF3TEO75T7RYWAJR7MJFVCZBYD","json":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD.json","graph_json":"https://pith.science/api/pith-number/RF3TEO75T7RYWAJR7MJFVCZBYD/graph.json","events_json":"https://pith.science/api/pith-number/RF3TEO75T7RYWAJR7MJFVCZBYD/events.json","paper":"https://pith.science/paper/RF3TEO75"},"agent_actions":{"view_html":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD","download_json":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD.json","view_paper":"https://pith.science/paper/RF3TEO75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04676&json=true","fetch_graph":"https://pith.science/api/pith-number/RF3TEO75T7RYWAJR7MJFVCZBYD/graph.json","fetch_events":"https://pith.science/api/pith-number/RF3TEO75T7RYWAJR7MJFVCZBYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD/action/storage_attestation","attest_author":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD/action/author_attestation","sign_citation":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD/action/citation_signature","submit_replication":"https://pith.science/pith/RF3TEO75T7RYWAJR7MJFVCZBYD/action/replication_record"}},"created_at":"2026-05-18T01:13:16.469362+00:00","updated_at":"2026-05-18T01:13:16.469362+00:00"}