{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LA4QIUHCRLGHTV2OFYSGQXSOV7","short_pith_number":"pith:LA4QIUHC","schema_version":"1.0","canonical_sha256":"58390450e28acc79d74e2e24685e4eafcb2e11449e36185865cf07a83bdfef93","source":{"kind":"arxiv","id":"1307.8403","version":3},"attestation_state":"computed","paper":{"title":"A statistical view on exchanges in Quickselect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Benjamin Dadoun, Ralph Neininger","submitted_at":"2013-07-31T17:52:28Z","abstract_excerpt":"In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and selecting an independent uniformly distributed rank. After normalization we give a limit theorem where the limit law is a perpetuity characterized by a recursive distributional equation. To make the limit theorem usable for statistical methods and statistical experiments we provide an explicit rate of convergence in the Kolmogorov--Smirnov metric, a numerical table of the limit law's distribution function and an algorit"},"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":"1307.8403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-31T17:52:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d7fb124ce8921cacb13c52bbe91115bc6cda4b58d9b392d217c8c9506fc4f784","abstract_canon_sha256":"8333dfd1d1c1cda51e95aa0fea69265fa34a310daec3088b46c1724f085b371f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:44.412114Z","signature_b64":"N1WGg/kgficuRV75z4lbZJcLPPL326TWHQSiOk+gPDWajORxXBh7344RJrfxZYObg/r7f32WGc83q3G4+p9zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58390450e28acc79d74e2e24685e4eafcb2e11449e36185865cf07a83bdfef93","last_reissued_at":"2026-05-18T03:06:44.411719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:44.411719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A statistical view on exchanges in Quickselect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Benjamin Dadoun, Ralph Neininger","submitted_at":"2013-07-31T17:52:28Z","abstract_excerpt":"In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and selecting an independent uniformly distributed rank. After normalization we give a limit theorem where the limit law is a perpetuity characterized by a recursive distributional equation. To make the limit theorem usable for statistical methods and statistical experiments we provide an explicit rate of convergence in the Kolmogorov--Smirnov metric, a numerical table of the limit law's distribution function and an algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8403","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":"1307.8403","created_at":"2026-05-18T03:06:44.411777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8403v3","created_at":"2026-05-18T03:06:44.411777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8403","created_at":"2026-05-18T03:06:44.411777+00:00"},{"alias_kind":"pith_short_12","alias_value":"LA4QIUHCRLGH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LA4QIUHCRLGHTV2O","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LA4QIUHC","created_at":"2026-05-18T12:27:51.066281+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/LA4QIUHCRLGHTV2OFYSGQXSOV7","json":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7.json","graph_json":"https://pith.science/api/pith-number/LA4QIUHCRLGHTV2OFYSGQXSOV7/graph.json","events_json":"https://pith.science/api/pith-number/LA4QIUHCRLGHTV2OFYSGQXSOV7/events.json","paper":"https://pith.science/paper/LA4QIUHC"},"agent_actions":{"view_html":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7","download_json":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7.json","view_paper":"https://pith.science/paper/LA4QIUHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8403&json=true","fetch_graph":"https://pith.science/api/pith-number/LA4QIUHCRLGHTV2OFYSGQXSOV7/graph.json","fetch_events":"https://pith.science/api/pith-number/LA4QIUHCRLGHTV2OFYSGQXSOV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7/action/storage_attestation","attest_author":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7/action/author_attestation","sign_citation":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7/action/citation_signature","submit_replication":"https://pith.science/pith/LA4QIUHCRLGHTV2OFYSGQXSOV7/action/replication_record"}},"created_at":"2026-05-18T03:06:44.411777+00:00","updated_at":"2026-05-18T03:06:44.411777+00:00"}