{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H7JOTP6BHMSVBYJ42ARGXPKIFI","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":"d297fd79d1ea4c95ab12eb9ad16555a3731f16dac0c29066af61550a2df56936","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-19T14:00:42Z","title_canon_sha256":"562f4d73a2c3cf80a1905a50a07fe3193f202df9c20ddee8194f8b516319445e"},"schema_version":"1.0","source":{"id":"1307.5218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5218","created_at":"2026-05-18T03:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5218v2","created_at":"2026-05-18T03:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5218","created_at":"2026-05-18T03:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"H7JOTP6BHMSV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H7JOTP6BHMSVBYJ4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H7JOTP6B","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:7a9d52f29218078057abc4efb89348f520513a15ad903cdf977e3cfbc16547de","target":"graph","created_at":"2026-05-18T03:06:44Z","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":"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$.","authors_text":"Henning Sulzbach, Michael Drmota, Ralph Neininger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-19T14:00:42Z","title":"A Gaussian limit process for optimal FIND algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5218","kind":"arxiv","version":2},"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:464230f6b9aab2a7697786b018d032b0fe2169c61ec242addc95ceb07405304f","target":"record","created_at":"2026-05-18T03:06:44Z","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":"d297fd79d1ea4c95ab12eb9ad16555a3731f16dac0c29066af61550a2df56936","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-19T14:00:42Z","title_canon_sha256":"562f4d73a2c3cf80a1905a50a07fe3193f202df9c20ddee8194f8b516319445e"},"schema_version":"1.0","source":{"id":"1307.5218","kind":"arxiv","version":2}},"canonical_sha256":"3fd2e9bfc13b2550e13cd0226bbd482a34338304ca5a71dffea6e7ab0f737da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fd2e9bfc13b2550e13cd0226bbd482a34338304ca5a71dffea6e7ab0f737da7","first_computed_at":"2026-05-18T03:06:44.444820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:44.444820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UT8TZjT0th8WaQ2XdD9krrC8WII+G7sY8pKzoH5GJ6GjLmM/AdlB9etr7N85Jd+r5mghGNTbuwFJundcrTswDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:44.445300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:464230f6b9aab2a7697786b018d032b0fe2169c61ec242addc95ceb07405304f","sha256:7a9d52f29218078057abc4efb89348f520513a15ad903cdf977e3cfbc16547de"],"state_sha256":"b5202f23b2685c8e4e8f7206ed8c267a0ce501de38e3d44392417bff93aea9d8"}