{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:I2UIL23OI6MIOJNYDX3QWAM7W2","short_pith_number":"pith:I2UIL23O","canonical_record":{"source":{"id":"2501.18466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-01-30T16:35:33Z","cross_cats_sorted":[],"title_canon_sha256":"5f628182ce9a09642e546f4056d1d683f248a42e0bda16e47afa9e162bddb0c1","abstract_canon_sha256":"4d6d3a94cf1280a96c3de09fa0cecbf4e30a68eef397fb181ec66b6df173330a"},"schema_version":"1.0"},"canonical_sha256":"46a885eb6e47988725b81df70b019fb680bf8dc3ac2a6a195bd765ffd34aca55","source":{"kind":"arxiv","id":"2501.18466","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18466","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18466v3","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18466","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"I2UIL23OI6MI","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_16","alias_value":"I2UIL23OI6MIOJNY","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_8","alias_value":"I2UIL23O","created_at":"2026-06-19T16:11:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:I2UIL23OI6MIOJNYDX3QWAM7W2","target":"record","payload":{"canonical_record":{"source":{"id":"2501.18466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-01-30T16:35:33Z","cross_cats_sorted":[],"title_canon_sha256":"5f628182ce9a09642e546f4056d1d683f248a42e0bda16e47afa9e162bddb0c1","abstract_canon_sha256":"4d6d3a94cf1280a96c3de09fa0cecbf4e30a68eef397fb181ec66b6df173330a"},"schema_version":"1.0"},"canonical_sha256":"46a885eb6e47988725b81df70b019fb680bf8dc3ac2a6a195bd765ffd34aca55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:09.688420Z","signature_b64":"Sdim9S7QyqemWXwa0B9MdV8Q946ezzuDyEFQGYpO/lEcxKHmMPUGuz1lcutbi9TdE3aSiprLSjShuGTTR9cDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a885eb6e47988725b81df70b019fb680bf8dc3ac2a6a195bd765ffd34aca55","last_reissued_at":"2026-06-19T16:11:09.687956Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:09.687956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.18466","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-06-19T16:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uztNi6YDgyot9I1fVEXwve4QBPEogmPdGseeExrzEEG/EEpI6p0o5tgHC+osz6eyb0GepkSDTyLmIb2XkffvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:38:02.816076Z"},"content_sha256":"ed11cd0517a3299850598387c72c36a4255bb2981664b4a0317fc98fd8b847bc","schema_version":"1.0","event_id":"sha256:ed11cd0517a3299850598387c72c36a4255bb2981664b4a0317fc98fd8b847bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:I2UIL23OI6MIOJNYDX3QWAM7W2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A random recursive tree model with doubling events","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C\\'ecile Mailler, Jakob E. Bj\\\"ornberg","submitted_at":"2025-01-30T16:35:33Z","abstract_excerpt":"We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional \"doubling events\" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size of this tree at large times, its degree distribution, and its height profile. We also prove a lower bound for its height. Because of the doubling events that affect the tree globally, the proofs are all much more intricate than in the case of the random recursive tree in which the growing operation is always local."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18466","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.18466/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-19T16:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIZRyBbuf7gYwNguOcw4E5iO5X0Vt3IHUCMp9HHzY/OYD1bb6Exco2uNoK2Hf+5KRsb508tCg4k4e7WcH/jeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:38:02.816475Z"},"content_sha256":"d59f4690c22530bdf454282cd942b88a98d4680cc69a33d2d2a764ead5938a76","schema_version":"1.0","event_id":"sha256:d59f4690c22530bdf454282cd942b88a98d4680cc69a33d2d2a764ead5938a76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/bundle.json","state_url":"https://pith.science/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/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-21T12:38:02Z","links":{"resolver":"https://pith.science/pith/I2UIL23OI6MIOJNYDX3QWAM7W2","bundle":"https://pith.science/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/bundle.json","state":"https://pith.science/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2UIL23OI6MIOJNYDX3QWAM7W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:I2UIL23OI6MIOJNYDX3QWAM7W2","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":"4d6d3a94cf1280a96c3de09fa0cecbf4e30a68eef397fb181ec66b6df173330a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-01-30T16:35:33Z","title_canon_sha256":"5f628182ce9a09642e546f4056d1d683f248a42e0bda16e47afa9e162bddb0c1"},"schema_version":"1.0","source":{"id":"2501.18466","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18466","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18466v3","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18466","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"I2UIL23OI6MI","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_16","alias_value":"I2UIL23OI6MIOJNY","created_at":"2026-06-19T16:11:09Z"},{"alias_kind":"pith_short_8","alias_value":"I2UIL23O","created_at":"2026-06-19T16:11:09Z"}],"graph_snapshots":[{"event_id":"sha256:d59f4690c22530bdf454282cd942b88a98d4680cc69a33d2d2a764ead5938a76","target":"graph","created_at":"2026-06-19T16:11:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.18466/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional \"doubling events\" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size of this tree at large times, its degree distribution, and its height profile. We also prove a lower bound for its height. Because of the doubling events that affect the tree globally, the proofs are all much more intricate than in the case of the random recursive tree in which the growing operation is always local.","authors_text":"C\\'ecile Mailler, Jakob E. Bj\\\"ornberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-01-30T16:35:33Z","title":"A random recursive tree model with doubling events"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18466","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:ed11cd0517a3299850598387c72c36a4255bb2981664b4a0317fc98fd8b847bc","target":"record","created_at":"2026-06-19T16:11:09Z","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":"4d6d3a94cf1280a96c3de09fa0cecbf4e30a68eef397fb181ec66b6df173330a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-01-30T16:35:33Z","title_canon_sha256":"5f628182ce9a09642e546f4056d1d683f248a42e0bda16e47afa9e162bddb0c1"},"schema_version":"1.0","source":{"id":"2501.18466","kind":"arxiv","version":3}},"canonical_sha256":"46a885eb6e47988725b81df70b019fb680bf8dc3ac2a6a195bd765ffd34aca55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a885eb6e47988725b81df70b019fb680bf8dc3ac2a6a195bd765ffd34aca55","first_computed_at":"2026-06-19T16:11:09.687956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:09.687956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sdim9S7QyqemWXwa0B9MdV8Q946ezzuDyEFQGYpO/lEcxKHmMPUGuz1lcutbi9TdE3aSiprLSjShuGTTR9cDAg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:09.688420Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.18466","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed11cd0517a3299850598387c72c36a4255bb2981664b4a0317fc98fd8b847bc","sha256:d59f4690c22530bdf454282cd942b88a98d4680cc69a33d2d2a764ead5938a76"],"state_sha256":"56b79f65a6f9a448860cab71844964b74a0b4054ba8f1eef3afc6a70e94734c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cKbdhaA7x6SISN+PMncjcz+cMgZ6lBsqHceGtrdvAQqGmzCd2na7PF/xSCIwRDx4DTtL3vLBjnGbZJpTRhpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:38:02.818532Z","bundle_sha256":"23250411d4308a2e5bbef18b6d42438ba07058c30cbfe916e96813bac4522c7f"}}