{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IYMYZ2CRNTB3GEHUWKMWHRAIPK","short_pith_number":"pith:IYMYZ2CR","schema_version":"1.0","canonical_sha256":"46198ce8516cc3b310f4b29963c4087a86e70a6bc83d42d6bd32c6919c4d93a3","source":{"kind":"arxiv","id":"1404.2425","version":2},"attestation_state":"computed","paper":{"title":"Longest paths in random Apollonian networks and largest $r$-ary subtrees of random $d$-ary recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Nick Wormald","submitted_at":"2014-04-09T10:35:29Z","abstract_excerpt":"Let $r$ and $d$ be positive integers with $r<d$. Consider a random $d$-ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and give it $d$ newly created offspring. Let ${\\mathcal T}_t$ be the tree produced after $t$ steps. We show that there exists a fixed $\\delta<1$ depending on $d$ and $r$ such that almost surely for all large $t$, every $r$-ary subtree of ${\\mathcal T}_t$ has less than $t^{\\delta}$ vertices.\n  The proof involves analysis that also yields a related result. Consider the following iterative construction of a random "},"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":"1404.2425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-09T10:35:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7cfb616cdf3e9611e7d7e0036800998fcab9511a2eb5927c4e17e161d2a3b64c","abstract_canon_sha256":"33eb73d8b74a4c02f93774eed88f542abf7767daa7d5b672453decea23f01417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:20.703493Z","signature_b64":"8L7DhQQyZCDMJVCa+I7IMSbARSTnLDChUVkk1329wyoaFKm022ZTmhKPh3JUSSCMNGqoCKLGpYFQJTNlafsABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46198ce8516cc3b310f4b29963c4087a86e70a6bc83d42d6bd32c6919c4d93a3","last_reissued_at":"2026-05-18T02:54:20.703064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:20.703064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest paths in random Apollonian networks and largest $r$-ary subtrees of random $d$-ary recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Abbas Mehrabian, Andrea Collevecchio, Nick Wormald","submitted_at":"2014-04-09T10:35:29Z","abstract_excerpt":"Let $r$ and $d$ be positive integers with $r<d$. Consider a random $d$-ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and give it $d$ newly created offspring. Let ${\\mathcal T}_t$ be the tree produced after $t$ steps. We show that there exists a fixed $\\delta<1$ depending on $d$ and $r$ such that almost surely for all large $t$, every $r$-ary subtree of ${\\mathcal T}_t$ has less than $t^{\\delta}$ vertices.\n  The proof involves analysis that also yields a related result. Consider the following iterative construction of a random "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2425","kind":"arxiv","version":2},"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":"1404.2425","created_at":"2026-05-18T02:54:20.703133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2425v2","created_at":"2026-05-18T02:54:20.703133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2425","created_at":"2026-05-18T02:54:20.703133+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYMYZ2CRNTB3","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYMYZ2CRNTB3GEHU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYMYZ2CR","created_at":"2026-05-18T12:28:33.132498+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/IYMYZ2CRNTB3GEHUWKMWHRAIPK","json":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK.json","graph_json":"https://pith.science/api/pith-number/IYMYZ2CRNTB3GEHUWKMWHRAIPK/graph.json","events_json":"https://pith.science/api/pith-number/IYMYZ2CRNTB3GEHUWKMWHRAIPK/events.json","paper":"https://pith.science/paper/IYMYZ2CR"},"agent_actions":{"view_html":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK","download_json":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK.json","view_paper":"https://pith.science/paper/IYMYZ2CR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2425&json=true","fetch_graph":"https://pith.science/api/pith-number/IYMYZ2CRNTB3GEHUWKMWHRAIPK/graph.json","fetch_events":"https://pith.science/api/pith-number/IYMYZ2CRNTB3GEHUWKMWHRAIPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK/action/storage_attestation","attest_author":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK/action/author_attestation","sign_citation":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK/action/citation_signature","submit_replication":"https://pith.science/pith/IYMYZ2CRNTB3GEHUWKMWHRAIPK/action/replication_record"}},"created_at":"2026-05-18T02:54:20.703133+00:00","updated_at":"2026-05-18T02:54:20.703133+00:00"}