{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WSHMA55OU47VRW6S7TUQDKXJPL","short_pith_number":"pith:WSHMA55O","schema_version":"1.0","canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","source":{"kind":"arxiv","id":"1404.3672","version":1},"attestation_state":"computed","paper":{"title":"Analysis of radix selection on Markov sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Kevin Leckey, Ralph Neininger","submitted_at":"2014-04-14T18:01:11Z","abstract_excerpt":"The complexity of the algorithm Radix Selection is considered for independent data generated from a Markov source. The complexity is measured by the number of bucket operations required and studied as a stochastic process indexed by the ranks; also the case of a uniformly chosen rank is considered. The orders of mean and variance of the complexity and limit theorems are derived. We find weak convergence of the appropriately normalized complexity towards a Gaussian process with explicit mean and covariance functions (in the space D[0,1] of cadlag functions on [0,1] with the Skorokhod metric) fo"},"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":"1404.3672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-14T18:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"2b5133cac697e5b3f48cfd23a198e45cf60e72a776b1e31f076610e51b3f0035","abstract_canon_sha256":"04ea8e13b8a8cdd0255d1e18e254f2c01985b4ee6e5326b0e91fdd125803dbc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:14.750241Z","signature_b64":"agX5TORWccYK1tJXxff5mpVeZEIZk6UW7fiNjtJUn+OH8H2KtEJ23ISJD9L3Vtwu5jOUd+t3Q2lrwiOMo1K1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","last_reissued_at":"2026-05-18T02:54:14.749761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:14.749761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of radix selection on Markov sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Kevin Leckey, Ralph Neininger","submitted_at":"2014-04-14T18:01:11Z","abstract_excerpt":"The complexity of the algorithm Radix Selection is considered for independent data generated from a Markov source. The complexity is measured by the number of bucket operations required and studied as a stochastic process indexed by the ranks; also the case of a uniformly chosen rank is considered. The orders of mean and variance of the complexity and limit theorems are derived. We find weak convergence of the appropriately normalized complexity towards a Gaussian process with explicit mean and covariance functions (in the space D[0,1] of cadlag functions on [0,1] with the Skorokhod metric) fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3672","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.3672","created_at":"2026-05-18T02:54:14.749851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3672v1","created_at":"2026-05-18T02:54:14.749851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3672","created_at":"2026-05-18T02:54:14.749851+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSHMA55OU47V","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSHMA55OU47VRW6S","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSHMA55O","created_at":"2026-05-18T12:28:54.890064+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/WSHMA55OU47VRW6S7TUQDKXJPL","json":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL.json","graph_json":"https://pith.science/api/pith-number/WSHMA55OU47VRW6S7TUQDKXJPL/graph.json","events_json":"https://pith.science/api/pith-number/WSHMA55OU47VRW6S7TUQDKXJPL/events.json","paper":"https://pith.science/paper/WSHMA55O"},"agent_actions":{"view_html":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL","download_json":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL.json","view_paper":"https://pith.science/paper/WSHMA55O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3672&json=true","fetch_graph":"https://pith.science/api/pith-number/WSHMA55OU47VRW6S7TUQDKXJPL/graph.json","fetch_events":"https://pith.science/api/pith-number/WSHMA55OU47VRW6S7TUQDKXJPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/action/storage_attestation","attest_author":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/action/author_attestation","sign_citation":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/action/citation_signature","submit_replication":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/action/replication_record"}},"created_at":"2026-05-18T02:54:14.749851+00:00","updated_at":"2026-05-18T02:54:14.749851+00:00"}