{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OCDDK7JKLSFUREB4AYAZE6IWKC","short_pith_number":"pith:OCDDK7JK","schema_version":"1.0","canonical_sha256":"7086357d2a5c8b48903c06019279165081436a714da113330634169d7131d53c","source":{"kind":"arxiv","id":"2412.09655","version":1},"attestation_state":"computed","paper":{"title":"The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"David J. Aldous, Svante Janson","submitted_at":"2024-12-12T02:02:03Z","abstract_excerpt":"In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\\propto 1/(i(m-i))$. Study of structure theory and explicit quantitative aspects of the model is an active research topic. It turns out that many results have several different proofs, and detailed studies of analytic proofs are given elsdewhere (via analysis of recursions and via Mellin transforms). This article describes two core probabilistic methods for studying $n \\to \\inf"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.09655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-12-12T02:02:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7752decb51544bcc1bf3efe987c67e05cd807752e620bcfb4005e364c918c2b8","abstract_canon_sha256":"4a7566d1e71ebd3fa7fd04a899421516d2a4abbe92207127f096d79efa74a203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:39.663469Z","signature_b64":"GLwPTuT7k4kEyBb9gku9hxGppvit4LF4sSGzIAp6DOgCwyzJ+YfIoo3SHUqivayN3LUtBY505ABa62rRjz7pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7086357d2a5c8b48903c06019279165081436a714da113330634169d7131d53c","last_reissued_at":"2026-07-05T09:48:39.662980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:39.662980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"David J. Aldous, Svante Janson","submitted_at":"2024-12-12T02:02:03Z","abstract_excerpt":"In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\\propto 1/(i(m-i))$. Study of structure theory and explicit quantitative aspects of the model is an active research topic. It turns out that many results have several different proofs, and detailed studies of analytic proofs are given elsdewhere (via analysis of recursions and via Mellin transforms). This article describes two core probabilistic methods for studying $n \\to \\inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09655","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.09655/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.09655","created_at":"2026-07-05T09:48:39.663051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09655v1","created_at":"2026-07-05T09:48:39.663051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09655","created_at":"2026-07-05T09:48:39.663051+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCDDK7JKLSFU","created_at":"2026-07-05T09:48:39.663051+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCDDK7JKLSFUREB4","created_at":"2026-07-05T09:48:39.663051+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCDDK7JK","created_at":"2026-07-05T09:48:39.663051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24821","citing_title":"Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC","json":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC.json","graph_json":"https://pith.science/api/pith-number/OCDDK7JKLSFUREB4AYAZE6IWKC/graph.json","events_json":"https://pith.science/api/pith-number/OCDDK7JKLSFUREB4AYAZE6IWKC/events.json","paper":"https://pith.science/paper/OCDDK7JK"},"agent_actions":{"view_html":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC","download_json":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC.json","view_paper":"https://pith.science/paper/OCDDK7JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09655&json=true","fetch_graph":"https://pith.science/api/pith-number/OCDDK7JKLSFUREB4AYAZE6IWKC/graph.json","fetch_events":"https://pith.science/api/pith-number/OCDDK7JKLSFUREB4AYAZE6IWKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC/action/storage_attestation","attest_author":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC/action/author_attestation","sign_citation":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC/action/citation_signature","submit_replication":"https://pith.science/pith/OCDDK7JKLSFUREB4AYAZE6IWKC/action/replication_record"}},"created_at":"2026-07-05T09:48:39.663051+00:00","updated_at":"2026-07-05T09:48:39.663051+00:00"}