{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:URF2OPETHDMH6QVG77WJL6HMUT","short_pith_number":"pith:URF2OPET","schema_version":"1.0","canonical_sha256":"a44ba73c9338d87f42a6ffec95f8eca4fbed06a4c3afd470978d4e0e562cc5b1","source":{"kind":"arxiv","id":"1112.1250","version":1},"attestation_state":"computed","paper":{"title":"Degree distribution in the lower levels of the uniform recursive tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Agnes Backhausz, Tam\\'as F. M\\'ori","submitted_at":"2011-12-06T12:24:48Z","abstract_excerpt":"In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\\log n$ converges to $(1-t)^k$ almost surely, as $n\\to\\infty$, for every $t\\in(0,1)$. In addition, we show that the number of degree $d$ nodes in the first level is asymptotically Poisson distributed with mean 1; moreover, they are asymptotically independent for $d=1,2,...$."},"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":"1112.1250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-06T12:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"5ad3b12e3207091bce77f1cf1579b134a5d437b04424a6756740d80bbc80ad2d","abstract_canon_sha256":"7ddff6225186fbc9e7eb50e7e87522c66b62d36fa98d9f709962ac4d1f98d2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:55.914236Z","signature_b64":"jVBB0CL1daszvuJF8tBgX/RGqWeEq4frVHi2Cf6S+PXlHMuNCy+R9Yj3fY9+rnCb8t/dCK7hNR/Hi2Drr+DKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44ba73c9338d87f42a6ffec95f8eca4fbed06a4c3afd470978d4e0e562cc5b1","last_reissued_at":"2026-05-18T04:06:55.913455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:55.913455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree distribution in the lower levels of the uniform recursive tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Agnes Backhausz, Tam\\'as F. M\\'ori","submitted_at":"2011-12-06T12:24:48Z","abstract_excerpt":"In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\\log n$ converges to $(1-t)^k$ almost surely, as $n\\to\\infty$, for every $t\\in(0,1)$. In addition, we show that the number of degree $d$ nodes in the first level is asymptotically Poisson distributed with mean 1; moreover, they are asymptotically independent for $d=1,2,...$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1250","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":""},"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":"1112.1250","created_at":"2026-05-18T04:06:55.913600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1250v1","created_at":"2026-05-18T04:06:55.913600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1250","created_at":"2026-05-18T04:06:55.913600+00:00"},{"alias_kind":"pith_short_12","alias_value":"URF2OPETHDMH","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"URF2OPETHDMH6QVG","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"URF2OPET","created_at":"2026-05-18T12:26:42.757692+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/URF2OPETHDMH6QVG77WJL6HMUT","json":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT.json","graph_json":"https://pith.science/api/pith-number/URF2OPETHDMH6QVG77WJL6HMUT/graph.json","events_json":"https://pith.science/api/pith-number/URF2OPETHDMH6QVG77WJL6HMUT/events.json","paper":"https://pith.science/paper/URF2OPET"},"agent_actions":{"view_html":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT","download_json":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT.json","view_paper":"https://pith.science/paper/URF2OPET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1250&json=true","fetch_graph":"https://pith.science/api/pith-number/URF2OPETHDMH6QVG77WJL6HMUT/graph.json","fetch_events":"https://pith.science/api/pith-number/URF2OPETHDMH6QVG77WJL6HMUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT/action/storage_attestation","attest_author":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT/action/author_attestation","sign_citation":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT/action/citation_signature","submit_replication":"https://pith.science/pith/URF2OPETHDMH6QVG77WJL6HMUT/action/replication_record"}},"created_at":"2026-05-18T04:06:55.913600+00:00","updated_at":"2026-05-18T04:06:55.913600+00:00"}