{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LUOJFOX4A2SRVF7YQLDNKT7FTA","short_pith_number":"pith:LUOJFOX4","schema_version":"1.0","canonical_sha256":"5d1c92bafc06a51a97f882c6d54fe5982f67fb62a1ce29cb3ba193a6ce4c3ac2","source":{"kind":"arxiv","id":"1606.08769","version":3},"attestation_state":"computed","paper":{"title":"A note on the scaling limits of random P\\'olya trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernhard Gittenberger, Emma Yu Jin, Michael Wallner","submitted_at":"2016-06-28T16:00:22Z","abstract_excerpt":"Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\\'{o}lya trees: a uniform random P\\'{o}lya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many small forests, where with probability tending to one as $n$ tends to infinity, any forest $F_n(v)$, that is attached to a node $v$ in $C_n$, is maximally of size $\\vert F_n(v)\\vert=O(\\log n)$. Their proof used the framework of a Boltzmann sampler and deviation inequalities.\n  In this paper, first, we employ a unified framework in anal"},"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":"1606.08769","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-28T16:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"f0666855edc326515538a1dc3d6faa8886cdd769958819c61118f359386a4a20","abstract_canon_sha256":"6211dd4019bcdfab81b6c33c5ebd31d85d936fcc6bdddef9d95aee52db0c34a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.233359Z","signature_b64":"LLBSYgZGcMJepffEJRgL1VBYl98W82hBpVgeHPAtEbwxF+8kBh6nn1tD0FSek1Yy0HiPnTiy6OEFQXtKg5CODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1c92bafc06a51a97f882c6d54fe5982f67fb62a1ce29cb3ba193a6ce4c3ac2","last_reissued_at":"2026-05-18T01:00:19.232607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.232607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the scaling limits of random P\\'olya trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernhard Gittenberger, Emma Yu Jin, Michael Wallner","submitted_at":"2016-06-28T16:00:22Z","abstract_excerpt":"Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\\'{o}lya trees: a uniform random P\\'{o}lya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many small forests, where with probability tending to one as $n$ tends to infinity, any forest $F_n(v)$, that is attached to a node $v$ in $C_n$, is maximally of size $\\vert F_n(v)\\vert=O(\\log n)$. Their proof used the framework of a Boltzmann sampler and deviation inequalities.\n  In this paper, first, we employ a unified framework in anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08769","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.08769","created_at":"2026-05-18T01:00:19.232714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08769v3","created_at":"2026-05-18T01:00:19.232714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08769","created_at":"2026-05-18T01:00:19.232714+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUOJFOX4A2SR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUOJFOX4A2SRVF7Y","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUOJFOX4","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA","json":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA.json","graph_json":"https://pith.science/api/pith-number/LUOJFOX4A2SRVF7YQLDNKT7FTA/graph.json","events_json":"https://pith.science/api/pith-number/LUOJFOX4A2SRVF7YQLDNKT7FTA/events.json","paper":"https://pith.science/paper/LUOJFOX4"},"agent_actions":{"view_html":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA","download_json":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA.json","view_paper":"https://pith.science/paper/LUOJFOX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08769&json=true","fetch_graph":"https://pith.science/api/pith-number/LUOJFOX4A2SRVF7YQLDNKT7FTA/graph.json","fetch_events":"https://pith.science/api/pith-number/LUOJFOX4A2SRVF7YQLDNKT7FTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA/action/storage_attestation","attest_author":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA/action/author_attestation","sign_citation":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA/action/citation_signature","submit_replication":"https://pith.science/pith/LUOJFOX4A2SRVF7YQLDNKT7FTA/action/replication_record"}},"created_at":"2026-05-18T01:00:19.232714+00:00","updated_at":"2026-05-18T01:00:19.232714+00:00"}