{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AO26WMTTOOW2H37JXUBNQE7GYQ","short_pith_number":"pith:AO26WMTT","canonical_record":{"source":{"id":"1603.07385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-23T22:55:26Z","cross_cats_sorted":[],"title_canon_sha256":"91a1d0c781f66829750d84c6f4d4d3156a41a992d42809cefeb818c7e0926d88","abstract_canon_sha256":"ee3ec6136a9951b93010351d86c501555c289024dbf75aec84f6c77a55fd311d"},"schema_version":"1.0"},"canonical_sha256":"03b5eb327373ada3efe9bd02d813e6c403aa4dd447f06c635cc713fb18c72c60","source":{"kind":"arxiv","id":"1603.07385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07385","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07385v1","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07385","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"AO26WMTTOOW2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AO26WMTTOOW2H37J","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AO26WMTT","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AO26WMTTOOW2H37JXUBNQE7GYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-23T22:55:26Z","cross_cats_sorted":[],"title_canon_sha256":"91a1d0c781f66829750d84c6f4d4d3156a41a992d42809cefeb818c7e0926d88","abstract_canon_sha256":"ee3ec6136a9951b93010351d86c501555c289024dbf75aec84f6c77a55fd311d"},"schema_version":"1.0"},"canonical_sha256":"03b5eb327373ada3efe9bd02d813e6c403aa4dd447f06c635cc713fb18c72c60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:21.120111Z","signature_b64":"x8CCfT4J7dc8csKfaGDVR3jsUwAkmM8fu30ynaCtzrgdcmWqj/GjHgvm/VY+NtGWBlrRG113puYg4ER6kpLNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b5eb327373ada3efe9bd02d813e6c403aa4dd447f06c635cc713fb18c72c60","last_reissued_at":"2026-05-18T01:18:21.119585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:21.119585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07385","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-18T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCt74cWou6pZtO3XNeTmlXTt+P3pJJA19SYhnQQQ3NMGZh7oXEZeJNKevjkCME2AxJdWUGnB3lhhMMSR0GEjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:48:53.010840Z"},"content_sha256":"0b3cf04a4c1977a84aaf9b4647873274c2cbbecce9cb83df28ccf255d7156ff4","schema_version":"1.0","event_id":"sha256:0b3cf04a4c1977a84aaf9b4647873274c2cbbecce9cb83df28ccf255d7156ff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AO26WMTTOOW2H37JXUBNQE7GYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Radix sort trees in the large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Wakolbinger, Steven N. Evans","submitted_at":"2016-03-23T22:55:26Z","abstract_excerpt":"The trie-based radix sort algorithm stores pairwise different infinite binary strings in the leaves of a binary tree in a way that the Ulam-Harris coding of each leaf equals a prefix (that is, an initial segment) of the corresponding string, with the prefixes being of minimal length so that they are pairwise different. We investigate the {\\em radix sort tree chains} -- the tree-valued Markov chains that arise when successively storing infinite binary strings $Z_1,\\ldots, Z_n$, $n=1,2,\\ldots$ according to the trie-based radix sort algorithm, where the source strings $Z_1, Z_2,\\ldots$ are indepe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07385","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-18T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TN2bjZEAbEjWr9MhEu60Mk8X4IKJiEfEJMn8lEHV17reF+rnPlEcokv2iwa3HllQ1jY+dhI8TlEVI3zHoYU0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:48:53.011496Z"},"content_sha256":"0f23afb45d3499c11aaf07ba5693ee1e9c40282ea635665d8cdd4b0ecb2f7bda","schema_version":"1.0","event_id":"sha256:0f23afb45d3499c11aaf07ba5693ee1e9c40282ea635665d8cdd4b0ecb2f7bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/bundle.json","state_url":"https://pith.science/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/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-30T10:48:53Z","links":{"resolver":"https://pith.science/pith/AO26WMTTOOW2H37JXUBNQE7GYQ","bundle":"https://pith.science/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/bundle.json","state":"https://pith.science/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO26WMTTOOW2H37JXUBNQE7GYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AO26WMTTOOW2H37JXUBNQE7GYQ","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":"ee3ec6136a9951b93010351d86c501555c289024dbf75aec84f6c77a55fd311d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-23T22:55:26Z","title_canon_sha256":"91a1d0c781f66829750d84c6f4d4d3156a41a992d42809cefeb818c7e0926d88"},"schema_version":"1.0","source":{"id":"1603.07385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07385","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07385v1","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07385","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"AO26WMTTOOW2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AO26WMTTOOW2H37J","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AO26WMTT","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:0f23afb45d3499c11aaf07ba5693ee1e9c40282ea635665d8cdd4b0ecb2f7bda","target":"graph","created_at":"2026-05-18T01:18:21Z","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 trie-based radix sort algorithm stores pairwise different infinite binary strings in the leaves of a binary tree in a way that the Ulam-Harris coding of each leaf equals a prefix (that is, an initial segment) of the corresponding string, with the prefixes being of minimal length so that they are pairwise different. We investigate the {\\em radix sort tree chains} -- the tree-valued Markov chains that arise when successively storing infinite binary strings $Z_1,\\ldots, Z_n$, $n=1,2,\\ldots$ according to the trie-based radix sort algorithm, where the source strings $Z_1, Z_2,\\ldots$ are indepe","authors_text":"Anton Wakolbinger, Steven N. Evans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-23T22:55:26Z","title":"Radix sort trees in the large"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07385","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:0b3cf04a4c1977a84aaf9b4647873274c2cbbecce9cb83df28ccf255d7156ff4","target":"record","created_at":"2026-05-18T01:18:21Z","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":"ee3ec6136a9951b93010351d86c501555c289024dbf75aec84f6c77a55fd311d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-23T22:55:26Z","title_canon_sha256":"91a1d0c781f66829750d84c6f4d4d3156a41a992d42809cefeb818c7e0926d88"},"schema_version":"1.0","source":{"id":"1603.07385","kind":"arxiv","version":1}},"canonical_sha256":"03b5eb327373ada3efe9bd02d813e6c403aa4dd447f06c635cc713fb18c72c60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b5eb327373ada3efe9bd02d813e6c403aa4dd447f06c635cc713fb18c72c60","first_computed_at":"2026-05-18T01:18:21.119585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:21.119585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8CCfT4J7dc8csKfaGDVR3jsUwAkmM8fu30ynaCtzrgdcmWqj/GjHgvm/VY+NtGWBlrRG113puYg4ER6kpLNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:21.120111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b3cf04a4c1977a84aaf9b4647873274c2cbbecce9cb83df28ccf255d7156ff4","sha256:0f23afb45d3499c11aaf07ba5693ee1e9c40282ea635665d8cdd4b0ecb2f7bda"],"state_sha256":"e75cfb3e88d92d75a00cad8569e87add442961241e5aaf655274471761c711a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rF3TihekztA0zl2XsrMiCYCIDEg5hMJ7f8ySOKUdmfiEEvNP6V22ElbeFca7kXmoHYb4d6TgUZ3ggXFvOa2UBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:48:53.015401Z","bundle_sha256":"0afa61125eef1da1865705cb5df2c2ef6c85fdd01ed069f586263cf3f5e7f314"}}