{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PQYGJSJKUQJQHRHLO22KLVJ6Y2","short_pith_number":"pith:PQYGJSJK","canonical_record":{"source":{"id":"1605.02352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-08T19:27:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f923eb45941ac614219c54377a02b265d23b71eda773c3354715a6319a5b7043","abstract_canon_sha256":"ebc9e6fac703cec50eefdd2fb521bc3a27f382a62b8b82383794e155e1f554cb"},"schema_version":"1.0"},"canonical_sha256":"7c3064c92aa41303c4eb76b4a5d53ec690e931ea0c439e5e9c4c7619f0f6f358","source":{"kind":"arxiv","id":"1605.02352","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02352","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02352v2","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02352","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"pith_short_12","alias_value":"PQYGJSJKUQJQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQYGJSJKUQJQHRHL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQYGJSJK","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PQYGJSJKUQJQHRHLO22KLVJ6Y2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-08T19:27:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f923eb45941ac614219c54377a02b265d23b71eda773c3354715a6319a5b7043","abstract_canon_sha256":"ebc9e6fac703cec50eefdd2fb521bc3a27f382a62b8b82383794e155e1f554cb"},"schema_version":"1.0"},"canonical_sha256":"7c3064c92aa41303c4eb76b4a5d53ec690e931ea0c439e5e9c4c7619f0f6f358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.323973Z","signature_b64":"sg4kn6du/NEkgFXA2jwvQApCIdbaN73hS8jqv+YXQZZXP4f0m3uIk/Q9bz+uVmHGD+I9exvx+OOiHemrdnzfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c3064c92aa41303c4eb76b4a5d53ec690e931ea0c439e5e9c4c7619f0f6f358","last_reissued_at":"2026-05-18T00:33:53.323411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.323411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02352","source_version":2,"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-18T00:33:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1cQrwc7UX4Qw7NBV62hMxOSC6uSom8+km3mTYbDk/c54KVDmKjWOq9aoO9ih7aBcITud8SwAHsb+vtzWp8GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:26:45.886995Z"},"content_sha256":"ee680a0c13fdd27bf51e3dce60198bfdacc6dabd60816331a8d80b17fc469873","schema_version":"1.0","event_id":"sha256:ee680a0c13fdd27bf51e3dce60198bfdacc6dabd60816331a8d80b17fc469873"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PQYGJSJKUQJQHRHLO22KLVJ6Y2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Process convergence for the complexity of Radix Selection on Markov sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Henning Sulzbach, Kevin Leckey, Ralph Neininger","submitted_at":"2016-05-08T19:27:10Z","abstract_excerpt":"A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its complexity is measured by the number of symbols that have to be read. In this paper the model of independent data identically generated from a Markov chain is considered. The complexity is studied as a stochastic process indexed by the set of infinite strings over the given alphabet. The orders of mean and variance of the complexity and, after normalization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02352","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"},"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-18T00:33:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f2ZzmSOGB83Ckq4xbtgpHDvMUqP4rSC5g4r1kW4ijzJdz8zYWYylQQLoVXU+nNyYmM8ii9OmDpcOHURc4GhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:26:45.887686Z"},"content_sha256":"bc5cb4ef5dfc8064aaee1db85cea0f3b3c38dae2d2de75a51eb1009d7dee3c9c","schema_version":"1.0","event_id":"sha256:bc5cb4ef5dfc8064aaee1db85cea0f3b3c38dae2d2de75a51eb1009d7dee3c9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/bundle.json","state_url":"https://pith.science/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/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-27T19:26:45Z","links":{"resolver":"https://pith.science/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2","bundle":"https://pith.science/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/bundle.json","state":"https://pith.science/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQYGJSJKUQJQHRHLO22KLVJ6Y2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PQYGJSJKUQJQHRHLO22KLVJ6Y2","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":"ebc9e6fac703cec50eefdd2fb521bc3a27f382a62b8b82383794e155e1f554cb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-08T19:27:10Z","title_canon_sha256":"f923eb45941ac614219c54377a02b265d23b71eda773c3354715a6319a5b7043"},"schema_version":"1.0","source":{"id":"1605.02352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02352","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02352v2","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02352","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"pith_short_12","alias_value":"PQYGJSJKUQJQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQYGJSJKUQJQHRHL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQYGJSJK","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:bc5cb4ef5dfc8064aaee1db85cea0f3b3c38dae2d2de75a51eb1009d7dee3c9c","target":"graph","created_at":"2026-05-18T00:33:53Z","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":"A fundamental algorithm for selecting ranks from a finite subset of an ordered set is Radix Selection. This algorithm requires the data to be given as strings of symbols over an ordered alphabet, e.g., binary expansions of real numbers. Its complexity is measured by the number of symbols that have to be read. In this paper the model of independent data identically generated from a Markov chain is considered. The complexity is studied as a stochastic process indexed by the set of infinite strings over the given alphabet. The orders of mean and variance of the complexity and, after normalization","authors_text":"Henning Sulzbach, Kevin Leckey, Ralph Neininger","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-08T19:27:10Z","title":"Process convergence for the complexity of Radix Selection on Markov sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02352","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:ee680a0c13fdd27bf51e3dce60198bfdacc6dabd60816331a8d80b17fc469873","target":"record","created_at":"2026-05-18T00:33:53Z","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":"ebc9e6fac703cec50eefdd2fb521bc3a27f382a62b8b82383794e155e1f554cb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-08T19:27:10Z","title_canon_sha256":"f923eb45941ac614219c54377a02b265d23b71eda773c3354715a6319a5b7043"},"schema_version":"1.0","source":{"id":"1605.02352","kind":"arxiv","version":2}},"canonical_sha256":"7c3064c92aa41303c4eb76b4a5d53ec690e931ea0c439e5e9c4c7619f0f6f358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c3064c92aa41303c4eb76b4a5d53ec690e931ea0c439e5e9c4c7619f0f6f358","first_computed_at":"2026-05-18T00:33:53.323411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:53.323411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sg4kn6du/NEkgFXA2jwvQApCIdbaN73hS8jqv+YXQZZXP4f0m3uIk/Q9bz+uVmHGD+I9exvx+OOiHemrdnzfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:53.323973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee680a0c13fdd27bf51e3dce60198bfdacc6dabd60816331a8d80b17fc469873","sha256:bc5cb4ef5dfc8064aaee1db85cea0f3b3c38dae2d2de75a51eb1009d7dee3c9c"],"state_sha256":"367d099c77464187b3abb166d44a103eb473b4f080accc8de5c204e77686da68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"915I5tYX9EjF8UgB6vfJztb0lfeZG7y5AuWK8+c2/LTH0/7So8yt48fttcZxTsoTYjSiavaDpddAzWlK2KbbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:26:45.890962Z","bundle_sha256":"d24a1c9396dab1ef97f396cb04505dfc61e64d9280244530af8ce96a8bd60ae7"}}