{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TS2HDKBYXSCBEFHZIS56VGEMEC","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":"2472adfc74dc13906941ad07b283a0e43c6403cbeab712cd8715026e0f5a047c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:36:28Z","title_canon_sha256":"9806d951658f696c46624169dbf95ada73aabbf5f5c041b6df840957edd804d9"},"schema_version":"1.0","source":{"id":"2605.12821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12821","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12821v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12821","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"TS2HDKBYXSCB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TS2HDKBYXSCBEFHZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TS2HDKBY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1f647b0a9c80b098dc3249d6e9a3e59eb9251acde4488df280f2a7d9ca1966b4","target":"graph","created_at":"2026-05-18T03:09:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The probability of having 2m deepest leaves satisfies κ[m] ∼ 4^{-m+1}; the limiting distribution is characterized by a functional equation obtained via the Fatou coordinate of an Abel equation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The truncation error in the critical scaling regime of the Catalan iteration admits a three-zone dominated-convergence analysis that produces clean square-root singular expansions for the associated generating functions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In random binary trees the number of deepest leaves follows a distribution with mean approximately 2.8037, P(exactly two) approximately 0.7009, and tail probability decaying as 4 to the minus m."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In random plane binary trees, the number of leaves at maximum depth has a limiting distribution with probability of exactly 2m such leaves asymptotically equal to 4^{-m+1}."}],"snapshot_sha256":"04c75352848c59063fe27b3688a33bee471f7115874027b48cac8e27425c4454"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the extreme local structure of plane binary trees through the distribution of leaves at maximum depth. We first address two basic questions: (i) the asymptotic probability that exactly two leaves occur at the deepest level, and (ii) the asymptotic mean number of leaves at that level. These problems lead to generating functions coupled with the Catalan iteration $I_{k+1}(z)=1+zI_k(z)^2$ through quasi-logistic recurrences. We show that both associated series have dominant singularity $\\rho=1/4$ and admit square-root singular expansions. The singular terms are obtained through a three-zo","authors_text":"Antoine Genitrini, Khaydar Nurligareev, Olivier Bodini","cross_cats":[],"headline":"In random plane binary trees, the number of leaves at maximum depth has a limiting distribution with probability of exactly 2m such leaves asymptotically equal to 4^{-m+1}.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:36:28Z","title":"The Distribution of the Deepest Leaves in Binary Trees"},"references":{"count":18,"internal_anchors":0,"resolved_work":18,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bodini, O. and Genitrini, A. and Nurligareev, K. , title =. 2026 , howpublished =","work_id":"8f0f264c-5834-40ea-9ab0-b2feb31daac1","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Aldous, D. , title =. Ann. Probab. , volume =","work_id":"d8958933-6045-4df2-ba12-6ffab539f6dc","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Aldous, D. , title =. Stochastic Analysis: Proceedings of the Durham Symposium on Stochastic Analysis, 1990 , publisher=. 1991 , pages=","work_id":"a7bb728d-0ece-4d17-abdb-e2445d4b2e44","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Colloquium on trees in algebra and programming , pages=","work_id":"aef85853-58a6-48f2-9dc5-635df9c0aac3","year":1992},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bodini, O. and Genitrini, A. and Gittenberger, B. and Wagner, S. , title =. Discrete Math. , volume =","work_id":"0a20fe5e-be0f-4b21-b13d-313e0884a129","year":null}],"snapshot_sha256":"6c663a87f79bf8f4e3492caba43bd738964f68f56e218dd91bfbbf570088fdcb"},"source":{"id":"2605.12821","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:26:08.897937Z","id":"6f065195-bbe0-4c79-a8e0-26554c75e431","model_set":{"reader":"grok-4.3"},"one_line_summary":"In random binary trees the number of deepest leaves follows a distribution with mean approximately 2.8037, P(exactly two) approximately 0.7009, and tail probability decaying as 4 to the minus m.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In random plane binary trees, the number of leaves at maximum depth has a limiting distribution with probability of exactly 2m such leaves asymptotically equal to 4^{-m+1}.","strongest_claim":"The probability of having 2m deepest leaves satisfies κ[m] ∼ 4^{-m+1}; the limiting distribution is characterized by a functional equation obtained via the Fatou coordinate of an Abel equation.","weakest_assumption":"The truncation error in the critical scaling regime of the Catalan iteration admits a three-zone dominated-convergence analysis that produces clean square-root singular expansions for the associated generating functions."}},"verdict_id":"6f065195-bbe0-4c79-a8e0-26554c75e431"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:533855d4d15179b55e35d504f7a6ab90e59123b5ad1d7cf166474a172b5af7a3","target":"record","created_at":"2026-05-18T03:09:12Z","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":"2472adfc74dc13906941ad07b283a0e43c6403cbeab712cd8715026e0f5a047c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T23:36:28Z","title_canon_sha256":"9806d951658f696c46624169dbf95ada73aabbf5f5c041b6df840957edd804d9"},"schema_version":"1.0","source":{"id":"2605.12821","kind":"arxiv","version":1}},"canonical_sha256":"9cb471a838bc841214f944bbea988c20bb32cdc8e1d932846e77053ccebb6cc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cb471a838bc841214f944bbea988c20bb32cdc8e1d932846e77053ccebb6cc0","first_computed_at":"2026-05-18T03:09:12.217677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.217677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ek3GBU7rcZDzGM4EUDLOO++Tnrzjw56eNHwKiVz6diO1S9rLxdTolnoN7dAR2dmJgyNo0qTUPQowuviGQDL5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.218199Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12821","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533855d4d15179b55e35d504f7a6ab90e59123b5ad1d7cf166474a172b5af7a3","sha256:1f647b0a9c80b098dc3249d6e9a3e59eb9251acde4488df280f2a7d9ca1966b4"],"state_sha256":"38799282f7997af1366a05eb7acc81412e62336068cf8b508b5de372adbad624"}