{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:H7JOTP6BHMSVBYJ42ARGXPKIFI","short_pith_number":"pith:H7JOTP6B","schema_version":"1.0","canonical_sha256":"3fd2e9bfc13b2550e13cd0226bbd482a34338304ca5a71dffea6e7ab0f737da7","source":{"kind":"arxiv","id":"1307.5218","version":2},"attestation_state":"computed","paper":{"title":"A Gaussian limit process for optimal FIND algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Michael Drmota, Ralph Neininger","submitted_at":"2013-07-19T14:00:42Z","abstract_excerpt":"We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \\cdot n^\\alpha$ are chosen, where $0<\\alpha\\le \\frac{1}{2}$, $c>0$ and $n$ is the size of the data set to be split. We consider the complexity of FIND as a process in the rank to be selected and measured by the number of key comparisons required. After normalization we show weak convergence of the complexity to a centered Gaussian process as $n\\to\\infty$, which depends on $\\alpha$."},"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.5218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-19T14:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"562f4d73a2c3cf80a1905a50a07fe3193f202df9c20ddee8194f8b516319445e","abstract_canon_sha256":"d297fd79d1ea4c95ab12eb9ad16555a3731f16dac0c29066af61550a2df56936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:44.445300Z","signature_b64":"UT8TZjT0th8WaQ2XdD9krrC8WII+G7sY8pKzoH5GJ6GjLmM/AdlB9etr7N85Jd+r5mghGNTbuwFJundcrTswDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd2e9bfc13b2550e13cd0226bbd482a34338304ca5a71dffea6e7ab0f737da7","last_reissued_at":"2026-05-18T03:06:44.444820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:44.444820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Gaussian limit process for optimal FIND algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Michael Drmota, Ralph Neininger","submitted_at":"2013-07-19T14:00:42Z","abstract_excerpt":"We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \\cdot n^\\alpha$ are chosen, where $0<\\alpha\\le \\frac{1}{2}$, $c>0$ and $n$ is the size of the data set to be split. We consider the complexity of FIND as a process in the rank to be selected and measured by the number of key comparisons required. After normalization we show weak convergence of the complexity to a centered Gaussian process as $n\\to\\infty$, which depends on $\\alpha$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5218","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":"1307.5218","created_at":"2026-05-18T03:06:44.444885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5218v2","created_at":"2026-05-18T03:06:44.444885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5218","created_at":"2026-05-18T03:06:44.444885+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7JOTP6BHMSV","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7JOTP6BHMSVBYJ4","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7JOTP6B","created_at":"2026-05-18T12:27:46.883200+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/H7JOTP6BHMSVBYJ42ARGXPKIFI","json":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI.json","graph_json":"https://pith.science/api/pith-number/H7JOTP6BHMSVBYJ42ARGXPKIFI/graph.json","events_json":"https://pith.science/api/pith-number/H7JOTP6BHMSVBYJ42ARGXPKIFI/events.json","paper":"https://pith.science/paper/H7JOTP6B"},"agent_actions":{"view_html":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI","download_json":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI.json","view_paper":"https://pith.science/paper/H7JOTP6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5218&json=true","fetch_graph":"https://pith.science/api/pith-number/H7JOTP6BHMSVBYJ42ARGXPKIFI/graph.json","fetch_events":"https://pith.science/api/pith-number/H7JOTP6BHMSVBYJ42ARGXPKIFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI/action/storage_attestation","attest_author":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI/action/author_attestation","sign_citation":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI/action/citation_signature","submit_replication":"https://pith.science/pith/H7JOTP6BHMSVBYJ42ARGXPKIFI/action/replication_record"}},"created_at":"2026-05-18T03:06:44.444885+00:00","updated_at":"2026-05-18T03:06:44.444885+00:00"}