{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MLUZGFWXTIULYK7GGHP6IVMCXB","short_pith_number":"pith:MLUZGFWX","canonical_record":{"source":{"id":"1608.04906","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-17T09:41:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"193b9d4380a7bc9a3f8c12602aa43d5a6063ed9c81bc9d690b1628b4d00d916f","abstract_canon_sha256":"b266a8d1fcd833168dc2f385fa59e731efb79b824c481fc7538aba19e95ea874"},"schema_version":"1.0"},"canonical_sha256":"62e99316d79a28bc2be631dfe45582b8762a885d183a8c3aba486d7bb3b69c1c","source":{"kind":"arxiv","id":"1608.04906","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04906","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04906v4","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04906","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"MLUZGFWXTIUL","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLUZGFWXTIULYK7G","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLUZGFWX","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MLUZGFWXTIULYK7GGHP6IVMCXB","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04906","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-17T09:41:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"193b9d4380a7bc9a3f8c12602aa43d5a6063ed9c81bc9d690b1628b4d00d916f","abstract_canon_sha256":"b266a8d1fcd833168dc2f385fa59e731efb79b824c481fc7538aba19e95ea874"},"schema_version":"1.0"},"canonical_sha256":"62e99316d79a28bc2be631dfe45582b8762a885d183a8c3aba486d7bb3b69c1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.062554Z","signature_b64":"b7dbo4ahH5O1DmK/lCfzP8EY5y+xAsBZV/DPSWNE7fFoaVpf2fJix3L13plWlUfUB62fIFpx9KgE185t8ItSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e99316d79a28bc2be631dfe45582b8762a885d183a8c3aba486d7bb3b69c1c","last_reissued_at":"2026-05-17T23:47:06.061908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.061908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04906","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9s3d6htPbmJgYom5G7mwrVCRrMrJIm4prWuBOBszbEIrhMITHWL+dOrcPdKg/ovYfR+KdOqxYxXoM0D73uICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:07:47.343044Z"},"content_sha256":"28dabffe631f47751ad30cd6c8dd087aa83ec21e0e5efc8ee845645cdbd014c6","schema_version":"1.0","event_id":"sha256:28dabffe631f47751ad30cd6c8dd087aa83ec21e0e5efc8ee845645cdbd014c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MLUZGFWXTIULYK7GGHP6IVMCXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quicksort Is Optimal For Many Equal Keys","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2016-08-17T09:41:53Z","abstract_excerpt":"I prove that the average number of comparisons for median-of-$k$ Quicksort (with fat-pivot a.k.a. three-way partitioning) is asymptotically only a constant $\\alpha_k$ times worse than the lower bound for sorting random multisets with $\\Omega(n^\\varepsilon)$ duplicates of each value (for any $\\varepsilon>0$). The constant is $\\alpha_k = \\ln(2) / \\bigl(H_{k+1}-H_{(k+1)/2} \\bigr)$, which converges to 1 as $k\\to\\infty$, so Quicksort is asymptotically optimal for inputs with many duplicates. This resolves a conjecture by Sedgewick and Bentley (1999, 2002) and constitutes the first progress on the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04906","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ch+aaVm9qRbyzTjf2u8fyj5gQ3k1hfc4vBI0BUNcrnp3OjQmxpbM0wn9BQgckvPLrBfnjZLfQw+FD3IO8Vh2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:07:47.343442Z"},"content_sha256":"cc7e33a60fbab1d9bb85db4192504f26c9efccc848bd6a31040d6fefb6a7a66d","schema_version":"1.0","event_id":"sha256:cc7e33a60fbab1d9bb85db4192504f26c9efccc848bd6a31040d6fefb6a7a66d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/bundle.json","state_url":"https://pith.science/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T05:07:47Z","links":{"resolver":"https://pith.science/pith/MLUZGFWXTIULYK7GGHP6IVMCXB","bundle":"https://pith.science/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/bundle.json","state":"https://pith.science/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLUZGFWXTIULYK7GGHP6IVMCXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MLUZGFWXTIULYK7GGHP6IVMCXB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b266a8d1fcd833168dc2f385fa59e731efb79b824c481fc7538aba19e95ea874","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-17T09:41:53Z","title_canon_sha256":"193b9d4380a7bc9a3f8c12602aa43d5a6063ed9c81bc9d690b1628b4d00d916f"},"schema_version":"1.0","source":{"id":"1608.04906","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04906","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04906v4","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04906","created_at":"2026-05-17T23:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"MLUZGFWXTIUL","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLUZGFWXTIULYK7G","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLUZGFWX","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:cc7e33a60fbab1d9bb85db4192504f26c9efccc848bd6a31040d6fefb6a7a66d","target":"graph","created_at":"2026-05-17T23:47:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"I prove that the average number of comparisons for median-of-$k$ Quicksort (with fat-pivot a.k.a. three-way partitioning) is asymptotically only a constant $\\alpha_k$ times worse than the lower bound for sorting random multisets with $\\Omega(n^\\varepsilon)$ duplicates of each value (for any $\\varepsilon>0$). The constant is $\\alpha_k = \\ln(2) / \\bigl(H_{k+1}-H_{(k+1)/2} \\bigr)$, which converges to 1 as $k\\to\\infty$, so Quicksort is asymptotically optimal for inputs with many duplicates. This resolves a conjecture by Sedgewick and Bentley (1999, 2002) and constitutes the first progress on the a","authors_text":"Sebastian Wild","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-17T09:41:53Z","title":"Quicksort Is Optimal For Many Equal Keys"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04906","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28dabffe631f47751ad30cd6c8dd087aa83ec21e0e5efc8ee845645cdbd014c6","target":"record","created_at":"2026-05-17T23:47:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b266a8d1fcd833168dc2f385fa59e731efb79b824c481fc7538aba19e95ea874","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-17T09:41:53Z","title_canon_sha256":"193b9d4380a7bc9a3f8c12602aa43d5a6063ed9c81bc9d690b1628b4d00d916f"},"schema_version":"1.0","source":{"id":"1608.04906","kind":"arxiv","version":4}},"canonical_sha256":"62e99316d79a28bc2be631dfe45582b8762a885d183a8c3aba486d7bb3b69c1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62e99316d79a28bc2be631dfe45582b8762a885d183a8c3aba486d7bb3b69c1c","first_computed_at":"2026-05-17T23:47:06.061908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:06.061908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b7dbo4ahH5O1DmK/lCfzP8EY5y+xAsBZV/DPSWNE7fFoaVpf2fJix3L13plWlUfUB62fIFpx9KgE185t8ItSDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:06.062554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04906","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28dabffe631f47751ad30cd6c8dd087aa83ec21e0e5efc8ee845645cdbd014c6","sha256:cc7e33a60fbab1d9bb85db4192504f26c9efccc848bd6a31040d6fefb6a7a66d"],"state_sha256":"ec521610ba188dccc4edd7803371524e86c45709d1084e430973119538de402e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUWfRIM/Zl0nkok5WiFM20n/dmVi0BxxxXeuE4h/DG9CClfEDqE2pChntuA9e7oGjK3TRYT56wpd89yAjrqlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:07:47.345470Z","bundle_sha256":"87e473166d7366c3ebe2c20abc8a180ad34747531c8bf0ae3f1c9502222372c7"}}