{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QZ5IIBI7HEY36YYGBM6UCB37Z6","short_pith_number":"pith:QZ5IIBI7","canonical_record":{"source":{"id":"1505.07321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T13:58:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c4e437dfc07300d03a0d37df93cb676a3e6305b526b36521da78e6fb64f4c59d","abstract_canon_sha256":"aeabc4727d5404c6faa01e54d64af16c8522e5ca1ec8d2d627b95cdabec54af2"},"schema_version":"1.0"},"canonical_sha256":"867a84051f3931bf63060b3d41077fcf9a036e65e3d8769835fefef551462149","source":{"kind":"arxiv","id":"1505.07321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07321","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07321v1","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07321","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"QZ5IIBI7HEY3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZ5IIBI7HEY36YYG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZ5IIBI7","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QZ5IIBI7HEY36YYGBM6UCB37Z6","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T13:58:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c4e437dfc07300d03a0d37df93cb676a3e6305b526b36521da78e6fb64f4c59d","abstract_canon_sha256":"aeabc4727d5404c6faa01e54d64af16c8522e5ca1ec8d2d627b95cdabec54af2"},"schema_version":"1.0"},"canonical_sha256":"867a84051f3931bf63060b3d41077fcf9a036e65e3d8769835fefef551462149","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:04.828305Z","signature_b64":"77iSckovuh7UBNvaQoYWAHw4djMzDXaDQqEMShWKQ5tVkrghtOYlWTRO6ALCiPYmIvKACzIKQblvdCYgCxEXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"867a84051f3931bf63060b3d41077fcf9a036e65e3d8769835fefef551462149","last_reissued_at":"2026-05-18T02:02:04.827594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:04.827594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07321","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:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APaYmV9NcrGnyU79DfRfCJjGAov3S1Ix3A6fd3cPE8mWPpwnYORQGnH4LCXrzNhO4SWaJioELaWK37D4Oh2TCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:48:29.735894Z"},"content_sha256":"173c79461081526a1259a1fd83df61d3b1b2e15da6d25791effa2c528cc807ce","schema_version":"1.0","event_id":"sha256:173c79461081526a1259a1fd83df61d3b1b2e15da6d25791effa2c528cc807ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QZ5IIBI7HEY36YYGBM6UCB37Z6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Limit Theorem for Radix Sort and Tries with Markovian Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Kevin Leckey, Ralph Neininger, Wojciech Szpankowski","submitted_at":"2015-05-27T13:58:55Z","abstract_excerpt":"Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under a realistic probabilistic model for the generation of words is of significant importance, its analysis, even for simplest memoryless sources, has proved difficult. In this paper we consider a more realistic model where words are generated by a Markov source. By a novel use of the contraction method combined with moment transfer techniques we prove a central"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07321","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:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBzl9WYWMM5d7Esc/84z2/5889SWaWBB3RXcpvQ2upUlgAQz2wH1IpToOjcLkQl/xEix/TWnUcd8q2Lh/XAmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:48:29.736234Z"},"content_sha256":"1217f39b31cb408e785d76106616006b05b359e3f5ebaba5312a8d23a6512413","schema_version":"1.0","event_id":"sha256:1217f39b31cb408e785d76106616006b05b359e3f5ebaba5312a8d23a6512413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/bundle.json","state_url":"https://pith.science/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/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-06-05T11:48:29Z","links":{"resolver":"https://pith.science/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6","bundle":"https://pith.science/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/bundle.json","state":"https://pith.science/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZ5IIBI7HEY36YYGBM6UCB37Z6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QZ5IIBI7HEY36YYGBM6UCB37Z6","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":"aeabc4727d5404c6faa01e54d64af16c8522e5ca1ec8d2d627b95cdabec54af2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T13:58:55Z","title_canon_sha256":"c4e437dfc07300d03a0d37df93cb676a3e6305b526b36521da78e6fb64f4c59d"},"schema_version":"1.0","source":{"id":"1505.07321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07321","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07321v1","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07321","created_at":"2026-05-18T02:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"QZ5IIBI7HEY3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZ5IIBI7HEY36YYG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZ5IIBI7","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:1217f39b31cb408e785d76106616006b05b359e3f5ebaba5312a8d23a6512413","target":"graph","created_at":"2026-05-18T02:02:04Z","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":"Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under a realistic probabilistic model for the generation of words is of significant importance, its analysis, even for simplest memoryless sources, has proved difficult. In this paper we consider a more realistic model where words are generated by a Markov source. By a novel use of the contraction method combined with moment transfer techniques we prove a central","authors_text":"Kevin Leckey, Ralph Neininger, Wojciech Szpankowski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T13:58:55Z","title":"A Limit Theorem for Radix Sort and Tries with Markovian Input"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07321","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:173c79461081526a1259a1fd83df61d3b1b2e15da6d25791effa2c528cc807ce","target":"record","created_at":"2026-05-18T02:02:04Z","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":"aeabc4727d5404c6faa01e54d64af16c8522e5ca1ec8d2d627b95cdabec54af2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T13:58:55Z","title_canon_sha256":"c4e437dfc07300d03a0d37df93cb676a3e6305b526b36521da78e6fb64f4c59d"},"schema_version":"1.0","source":{"id":"1505.07321","kind":"arxiv","version":1}},"canonical_sha256":"867a84051f3931bf63060b3d41077fcf9a036e65e3d8769835fefef551462149","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"867a84051f3931bf63060b3d41077fcf9a036e65e3d8769835fefef551462149","first_computed_at":"2026-05-18T02:02:04.827594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:04.827594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77iSckovuh7UBNvaQoYWAHw4djMzDXaDQqEMShWKQ5tVkrghtOYlWTRO6ALCiPYmIvKACzIKQblvdCYgCxEXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:04.828305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:173c79461081526a1259a1fd83df61d3b1b2e15da6d25791effa2c528cc807ce","sha256:1217f39b31cb408e785d76106616006b05b359e3f5ebaba5312a8d23a6512413"],"state_sha256":"4fd4c933db8a3a8a9dec321edddbe75f14a8ec7f30aef9ac26fe5160c3840621"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8nadMP2SCrMo6h0Z5Pfn5JUyXtoekON03ikVCExFDBXV64slRPzO5TrIM5hp6czcnMrXRpDxqCdQi5lzFdyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:48:29.738189Z","bundle_sha256":"414be760639cf85d43170eaf5358786f74d9a7a8abc146df8e8c82b99bd45b57"}}