{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JWM4TC6Z6AEUJHNBPXLHKFPI4K","short_pith_number":"pith:JWM4TC6Z","canonical_record":{"source":{"id":"1710.07505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-20T12:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"4a4bee1a99250554db770301653f71e83249f15439651a292fa74fc1bb3da868","abstract_canon_sha256":"cce21ee0ff45139acfb77dec9c6dc383dc7d0e5f22f6eb605855c18219f2d682"},"schema_version":"1.0"},"canonical_sha256":"4d99c98bd9f009449da17dd67515e8e2a08509901c6332dff7397dd270be51fb","source":{"kind":"arxiv","id":"1710.07505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07505","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07505v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07505","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"JWM4TC6Z6AEU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWM4TC6Z6AEUJHNB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWM4TC6Z","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JWM4TC6Z6AEUJHNBPXLHKFPI4K","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-20T12:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"4a4bee1a99250554db770301653f71e83249f15439651a292fa74fc1bb3da868","abstract_canon_sha256":"cce21ee0ff45139acfb77dec9c6dc383dc7d0e5f22f6eb605855c18219f2d682"},"schema_version":"1.0"},"canonical_sha256":"4d99c98bd9f009449da17dd67515e8e2a08509901c6332dff7397dd270be51fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:24.662654Z","signature_b64":"NJH/WoUAhoxVnrJoMhgKEXjs+rblocOEzY4W4Ojc3NPLx5/f8WrOkVALuJtZ5ZayjJ2nYasMK2Ga445tvNuxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d99c98bd9f009449da17dd67515e8e2a08509901c6332dff7397dd270be51fb","last_reissued_at":"2026-05-18T00:32:24.662014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:24.662014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07505","source_version":1,"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-18T00:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/MiekO4rSaJkKDENOZcBVcCPJHDaHLzpKttzN9ZMZR0hu5Y5r1EaNwY4gZCDeMO2U+ftDHlXWIohH9JJKT2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:59:48.551489Z"},"content_sha256":"c16a5b0db88b32a90841e2b953c8066082d09bad5fb9c604666319da9f998c7a","schema_version":"1.0","event_id":"sha256:c16a5b0db88b32a90841e2b953c8066082d09bad5fb9c604666319da9f998c7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JWM4TC6Z6AEUJHNBPXLHKFPI4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Analysis of the Dual-Pivot Quicksort \"Count\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jasmin Straub, Ralph Neininger","submitted_at":"2017-10-20T12:32:37Z","abstract_excerpt":"Recently, Aum\\\"uller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called \"Count\", which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further probabilistic analysis of \"Count\". We derive an exact formula for the average number of swaps needed by \"Count\" as well as an asymptotic formula for the variance of the number of swaps and a limit law. Also for the number of key comparisons the asymptotic variance and a limit law are identified. We also consider both complexity measures jointly and find the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07505","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"},"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-18T00:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoLG13S2Fw4B4Y2qlncZK3Pos8Aj+2WUNX2zM/oXShF3c08pXZwLCduuTtBJoSnh7t//f8EM9y2BuIPAfd+AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:59:48.552296Z"},"content_sha256":"465d9573feacef4b25f044a3a0a5d06067188d831a5da4ac9fd12ccd6630908e","schema_version":"1.0","event_id":"sha256:465d9573feacef4b25f044a3a0a5d06067188d831a5da4ac9fd12ccd6630908e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/bundle.json","state_url":"https://pith.science/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/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-06-06T11:59:48Z","links":{"resolver":"https://pith.science/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K","bundle":"https://pith.science/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/bundle.json","state":"https://pith.science/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWM4TC6Z6AEUJHNBPXLHKFPI4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JWM4TC6Z6AEUJHNBPXLHKFPI4K","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":"cce21ee0ff45139acfb77dec9c6dc383dc7d0e5f22f6eb605855c18219f2d682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-20T12:32:37Z","title_canon_sha256":"4a4bee1a99250554db770301653f71e83249f15439651a292fa74fc1bb3da868"},"schema_version":"1.0","source":{"id":"1710.07505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07505","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07505v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07505","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"JWM4TC6Z6AEU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWM4TC6Z6AEUJHNB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWM4TC6Z","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:465d9573feacef4b25f044a3a0a5d06067188d831a5da4ac9fd12ccd6630908e","target":"graph","created_at":"2026-05-18T00:32:24Z","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":"Recently, Aum\\\"uller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called \"Count\", which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further probabilistic analysis of \"Count\". We derive an exact formula for the average number of swaps needed by \"Count\" as well as an asymptotic formula for the variance of the number of swaps and a limit law. Also for the number of key comparisons the asymptotic variance and a limit law are identified. We also consider both complexity measures jointly and find the","authors_text":"Jasmin Straub, Ralph Neininger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-20T12:32:37Z","title":"Probabilistic Analysis of the Dual-Pivot Quicksort \"Count\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07505","kind":"arxiv","version":1},"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:c16a5b0db88b32a90841e2b953c8066082d09bad5fb9c604666319da9f998c7a","target":"record","created_at":"2026-05-18T00:32:24Z","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":"cce21ee0ff45139acfb77dec9c6dc383dc7d0e5f22f6eb605855c18219f2d682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-20T12:32:37Z","title_canon_sha256":"4a4bee1a99250554db770301653f71e83249f15439651a292fa74fc1bb3da868"},"schema_version":"1.0","source":{"id":"1710.07505","kind":"arxiv","version":1}},"canonical_sha256":"4d99c98bd9f009449da17dd67515e8e2a08509901c6332dff7397dd270be51fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d99c98bd9f009449da17dd67515e8e2a08509901c6332dff7397dd270be51fb","first_computed_at":"2026-05-18T00:32:24.662014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:24.662014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJH/WoUAhoxVnrJoMhgKEXjs+rblocOEzY4W4Ojc3NPLx5/f8WrOkVALuJtZ5ZayjJ2nYasMK2Ga445tvNuxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:24.662654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c16a5b0db88b32a90841e2b953c8066082d09bad5fb9c604666319da9f998c7a","sha256:465d9573feacef4b25f044a3a0a5d06067188d831a5da4ac9fd12ccd6630908e"],"state_sha256":"cdf43e0781f28c28d648e1137e28a95e67fe5b0e0e919da48b2b447cd79be1c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMN3YcNdY9pl2KeJxOQLYd9FnFCvadPoRoRRr+9xEVi8SIokWzKHFCTiciFegTKoGS6XLOv0vhKX5sdGCLdHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:59:48.555467Z","bundle_sha256":"6d0ab5072f981c1447dccc42eb62d82f02062eda8fcbe409835a683fcad8e1a2"}}