{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BFGXVPWBRYHLLIM3CAPINJ3UNI","short_pith_number":"pith:BFGXVPWB","schema_version":"1.0","canonical_sha256":"094d7abec18e0eb5a19b101e86a7746a2585d8f1a6711a88fdc7c2f6037ea98a","source":{"kind":"arxiv","id":"1511.01138","version":2},"attestation_state":"computed","paper":{"title":"Why Is Dual-Pivot Quicksort Fast?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2015-11-03T22:13:47Z","abstract_excerpt":"I discuss the new dual-pivot Quicksort that is nowadays used to sort arrays of primitive types in Java. I sketch theoretical analyses of this algorithm that offer a possible, and in my opinion plausible, explanation why (a) dual-pivot Quicksort is faster than the previously used (classic) Quicksort and (b) why this improvement was not already found much earlier."},"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":"1511.01138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"2b244fd7624ae9acaf72cc438481e4f57e1a24d831d0008d256be680a20f6afe","abstract_canon_sha256":"66b98d5335dd27cd9dc7c593989b6bcf85c532a381960ff05cf32fdc3f9fcfe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.294700Z","signature_b64":"q02+RQYnQznGdNkDQ0NkNzp1DHMBscN21kDTiYSc3FcL9kNM5bzuAyyz0OAs7WL8W9gIMdaA8Ku3g8absCZyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"094d7abec18e0eb5a19b101e86a7746a2585d8f1a6711a88fdc7c2f6037ea98a","last_reissued_at":"2026-05-18T01:03:44.294259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.294259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why Is Dual-Pivot Quicksort Fast?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2015-11-03T22:13:47Z","abstract_excerpt":"I discuss the new dual-pivot Quicksort that is nowadays used to sort arrays of primitive types in Java. I sketch theoretical analyses of this algorithm that offer a possible, and in my opinion plausible, explanation why (a) dual-pivot Quicksort is faster than the previously used (classic) Quicksort and (b) why this improvement was not already found much earlier."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01138","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":"1511.01138","created_at":"2026-05-18T01:03:44.294326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01138v2","created_at":"2026-05-18T01:03:44.294326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01138","created_at":"2026-05-18T01:03:44.294326+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFGXVPWBRYHL","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFGXVPWBRYHLLIM3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFGXVPWB","created_at":"2026-05-18T12:29:14.074870+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/BFGXVPWBRYHLLIM3CAPINJ3UNI","json":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI.json","graph_json":"https://pith.science/api/pith-number/BFGXVPWBRYHLLIM3CAPINJ3UNI/graph.json","events_json":"https://pith.science/api/pith-number/BFGXVPWBRYHLLIM3CAPINJ3UNI/events.json","paper":"https://pith.science/paper/BFGXVPWB"},"agent_actions":{"view_html":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI","download_json":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI.json","view_paper":"https://pith.science/paper/BFGXVPWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01138&json=true","fetch_graph":"https://pith.science/api/pith-number/BFGXVPWBRYHLLIM3CAPINJ3UNI/graph.json","fetch_events":"https://pith.science/api/pith-number/BFGXVPWBRYHLLIM3CAPINJ3UNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI/action/storage_attestation","attest_author":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI/action/author_attestation","sign_citation":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI/action/citation_signature","submit_replication":"https://pith.science/pith/BFGXVPWBRYHLLIM3CAPINJ3UNI/action/replication_record"}},"created_at":"2026-05-18T01:03:44.294326+00:00","updated_at":"2026-05-18T01:03:44.294326+00:00"}