{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WSHMA55OU47VRW6S7TUQDKXJPL","short_pith_number":"pith:WSHMA55O","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"},"canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","source":{"kind":"arxiv","id":"1404.3672","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3672","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3672v1","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3672","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"WSHMA55OU47V","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSHMA55OU47VRW6S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSHMA55O","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WSHMA55OU47VRW6S7TUQDKXJPL","target":"record","payload":{"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"},"canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","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"},"source_kind":"arxiv","source_id":"1404.3672","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-18T02:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nlGY1M6YmoQuWuJ4cLXTZqUOulwHH1xHgwhWOQSN3sdifq30iXxwh4PZ+xjcR6jxEd5drPUGc8mZSxUwi6pCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:43.703524Z"},"content_sha256":"a13552676cd87c6bed1609feb7dcc44afad18b24cfe2c97ba1e15dc5fe3d0f7b","schema_version":"1.0","event_id":"sha256:a13552676cd87c6bed1609feb7dcc44afad18b24cfe2c97ba1e15dc5fe3d0f7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WSHMA55OU47VRW6S7TUQDKXJPL","target":"graph","payload":{"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"},"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-18T02:54:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dED3SJDxQVep48YZ4WcloYAhE2JGHbxlxHhW/RmpNljy7Nc24uwtMdrpPcWIBPqVurA4ThQWmHIjUXrJtqF4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:43.704161Z"},"content_sha256":"9288828ee4ff2583ea98485b7f04fe9a9c8417082a44147fc90d76a99d78386d","schema_version":"1.0","event_id":"sha256:9288828ee4ff2583ea98485b7f04fe9a9c8417082a44147fc90d76a99d78386d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/bundle.json","state_url":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSHMA55OU47VRW6S7TUQDKXJPL/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-05-27T13:52:43Z","links":{"resolver":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL","bundle":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/bundle.json","state":"https://pith.science/pith/WSHMA55OU47VRW6S7TUQDKXJPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSHMA55OU47VRW6S7TUQDKXJPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WSHMA55OU47VRW6S7TUQDKXJPL","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":"04ea8e13b8a8cdd0255d1e18e254f2c01985b4ee6e5326b0e91fdd125803dbc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-14T18:01:11Z","title_canon_sha256":"2b5133cac697e5b3f48cfd23a198e45cf60e72a776b1e31f076610e51b3f0035"},"schema_version":"1.0","source":{"id":"1404.3672","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3672","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3672v1","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3672","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"WSHMA55OU47V","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WSHMA55OU47VRW6S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WSHMA55O","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:9288828ee4ff2583ea98485b7f04fe9a9c8417082a44147fc90d76a99d78386d","target":"graph","created_at":"2026-05-18T02:54:14Z","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":"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","authors_text":"Henning Sulzbach, Kevin Leckey, Ralph Neininger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-14T18:01:11Z","title":"Analysis of radix selection on Markov sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3672","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:a13552676cd87c6bed1609feb7dcc44afad18b24cfe2c97ba1e15dc5fe3d0f7b","target":"record","created_at":"2026-05-18T02:54:14Z","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":"04ea8e13b8a8cdd0255d1e18e254f2c01985b4ee6e5326b0e91fdd125803dbc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-14T18:01:11Z","title_canon_sha256":"2b5133cac697e5b3f48cfd23a198e45cf60e72a776b1e31f076610e51b3f0035"},"schema_version":"1.0","source":{"id":"1404.3672","kind":"arxiv","version":1}},"canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b48ec077aea73f58dbd2fce901aae97aca3ebd184684993c9ae933e7e29604f4","first_computed_at":"2026-05-18T02:54:14.749761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:14.749761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"agX5TORWccYK1tJXxff5mpVeZEIZk6UW7fiNjtJUn+OH8H2KtEJ23ISJD9L3Vtwu5jOUd+t3Q2lrwiOMo1K1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:14.750241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3672","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a13552676cd87c6bed1609feb7dcc44afad18b24cfe2c97ba1e15dc5fe3d0f7b","sha256:9288828ee4ff2583ea98485b7f04fe9a9c8417082a44147fc90d76a99d78386d"],"state_sha256":"5a4719d220b109b9be422f4d17dc16419eba9971f02ee398b982163f943d2693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57Ve96ithTWuXIXbBfotLWaY7KDmgFjmG+bmIbJzBfL73pPr9DOZl7DXNwKgldf4P3ERguNQOe0h8lRZW/6GDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:52:43.707646Z","bundle_sha256":"7776a08a123ab0aed93d71fbf6f5adaa2398830f4989de4390e6c8a6d8e31a16"}}