{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PFCO6RNDX3P5Q2JGWZ73A4MSND","short_pith_number":"pith:PFCO6RND","canonical_record":{"source":{"id":"1102.2541","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-12T22:26:27Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b283c845037db9c30c4710e53c1ead03f11a2bb8151eb9bbc6f5db8e7603c82f","abstract_canon_sha256":"2138993e20ce20e34470b0666fae4c35fff57ad824f0e295e1c2e548908753d8"},"schema_version":"1.0"},"canonical_sha256":"7944ef45a3bedfd86926b67fb0719268eb9fa7508a0d051446a8a045291b3e6a","source":{"kind":"arxiv","id":"1102.2541","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2541","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2541v3","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2541","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"PFCO6RNDX3P5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PFCO6RNDX3P5Q2JG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PFCO6RND","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PFCO6RNDX3P5Q2JGWZ73A4MSND","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2541","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-12T22:26:27Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b283c845037db9c30c4710e53c1ead03f11a2bb8151eb9bbc6f5db8e7603c82f","abstract_canon_sha256":"2138993e20ce20e34470b0666fae4c35fff57ad824f0e295e1c2e548908753d8"},"schema_version":"1.0"},"canonical_sha256":"7944ef45a3bedfd86926b67fb0719268eb9fa7508a0d051446a8a045291b3e6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:42.307910Z","signature_b64":"0/YPqpf0XcJl+9VI+SKVCXASR8I56Zg2CMjDe5clbxksK57pZN1O4/UUGpLRp/435BMVODYiInYOGrIWJsOzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7944ef45a3bedfd86926b67fb0719268eb9fa7508a0d051446a8a045291b3e6a","last_reissued_at":"2026-05-18T03:41:42.307109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:42.307109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2541","source_version":3,"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-18T03:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SKy5lEe9yv0V/TpZYtdTR68ckotcoBoH6oHqe3RnkLqbrCTkn07RHX92kO2rzEHn5uuvm7AtfA6EPcECxEhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:25:07.426413Z"},"content_sha256":"fa10039b289fa141d2e53d9cf443387f2ed6da4e6e8c88263511d04f44474cf7","schema_version":"1.0","event_id":"sha256:fa10039b289fa141d2e53d9cf443387f2ed6da4e6e8c88263511d04f44474cf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PFCO6RNDX3P5Q2JGWZ73A4MSND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The total path length of split trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Nicolas Broutin","submitted_at":"2011-02-12T22:26:27Z","abstract_excerpt":"We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewal theory, we prove convergence in distribution of the total path length toward a distribution characterized uniquely by a fixed point equation. Our result covers, using a unified approach, many data str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2541","kind":"arxiv","version":3},"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-18T03:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dn/oeREIM/W6l8teFpox3udJZR1Tc680rti77s/Azi3+bd87BlxCIoTrtSNlQZrlX2jLkGWqxefqy79PHQ6RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:25:07.427074Z"},"content_sha256":"b0808b5956e48786899eaf9a9b954a12e208b66366fb789f537cbc5517c2b092","schema_version":"1.0","event_id":"sha256:b0808b5956e48786899eaf9a9b954a12e208b66366fb789f537cbc5517c2b092"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/bundle.json","state_url":"https://pith.science/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/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-26T13:25:07Z","links":{"resolver":"https://pith.science/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND","bundle":"https://pith.science/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/bundle.json","state":"https://pith.science/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFCO6RNDX3P5Q2JGWZ73A4MSND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PFCO6RNDX3P5Q2JGWZ73A4MSND","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":"2138993e20ce20e34470b0666fae4c35fff57ad824f0e295e1c2e548908753d8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-12T22:26:27Z","title_canon_sha256":"b283c845037db9c30c4710e53c1ead03f11a2bb8151eb9bbc6f5db8e7603c82f"},"schema_version":"1.0","source":{"id":"1102.2541","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2541","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2541v3","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2541","created_at":"2026-05-18T03:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"PFCO6RNDX3P5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PFCO6RNDX3P5Q2JG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PFCO6RND","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:b0808b5956e48786899eaf9a9b954a12e208b66366fb789f537cbc5517c2b092","target":"graph","created_at":"2026-05-18T03:41:42Z","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":"We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewal theory, we prove convergence in distribution of the total path length toward a distribution characterized uniquely by a fixed point equation. Our result covers, using a unified approach, many data str","authors_text":"Cecilia Holmgren, Nicolas Broutin","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-12T22:26:27Z","title":"The total path length of split trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2541","kind":"arxiv","version":3},"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:fa10039b289fa141d2e53d9cf443387f2ed6da4e6e8c88263511d04f44474cf7","target":"record","created_at":"2026-05-18T03:41:42Z","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":"2138993e20ce20e34470b0666fae4c35fff57ad824f0e295e1c2e548908753d8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-12T22:26:27Z","title_canon_sha256":"b283c845037db9c30c4710e53c1ead03f11a2bb8151eb9bbc6f5db8e7603c82f"},"schema_version":"1.0","source":{"id":"1102.2541","kind":"arxiv","version":3}},"canonical_sha256":"7944ef45a3bedfd86926b67fb0719268eb9fa7508a0d051446a8a045291b3e6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7944ef45a3bedfd86926b67fb0719268eb9fa7508a0d051446a8a045291b3e6a","first_computed_at":"2026-05-18T03:41:42.307109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:42.307109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/YPqpf0XcJl+9VI+SKVCXASR8I56Zg2CMjDe5clbxksK57pZN1O4/UUGpLRp/435BMVODYiInYOGrIWJsOzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:42.307910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2541","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa10039b289fa141d2e53d9cf443387f2ed6da4e6e8c88263511d04f44474cf7","sha256:b0808b5956e48786899eaf9a9b954a12e208b66366fb789f537cbc5517c2b092"],"state_sha256":"640f37de167318919c45ec5273afb71bc992eac5ab83b7593afd0aa8d4eb2225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6JHC+zluUFrDRFvTko7OCZkJzLoyjMUntu+x0amIW9KWpkG+R0N71Sd6gynLsx4loVYdIAwL+EcOTAxLEW4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:25:07.430474Z","bundle_sha256":"bbba89e0f839148ff495fe3fb681d73fa20e7234f9692adfc21fa54eb7227994"}}