{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OM3JSM33RNFOYBCZZBXQCOOCQN","short_pith_number":"pith:OM3JSM33","schema_version":"1.0","canonical_sha256":"733699337b8b4aec0459c86f0139c28361e5c2d689b35994d2d4714f47bb6120","source":{"kind":"arxiv","id":"1210.7168","version":1},"attestation_state":"computed","paper":{"title":"Depth properties of scaled attachment random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Luc Devroye, Nicolas Fraiman, Omar Fawzi","submitted_at":"2012-10-26T15:48:09Z","abstract_excerpt":"We study depth properties of a general class of random recursive trees where each node i attaches to the random node iX_i and X_0, ..., X_n is a sequence of i.i.d. random variables taking values in [0,1). We call such trees scaled attachment random recursive trees (SARRT). We prove that the typical depth D_n, the maximum depth (or height) H_n and the minimum depth M_n of a SARRT are asymptotically given by D_n \\sim \\mu^{-1} \\log n, H_n \\sim \\alpha_{\\max} \\log n and M_n \\sim \\alpha_{\\min} \\log n where \\mu, \\alpha_{\\max} and \\alpha_{\\min} are constants depending only on the distribution of X_0 w"},"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":"1210.7168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-26T15:48:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a7dd134a40f6e3c837de2d864d61de936b6369eb857e3717eb3dfd6df2e69a2a","abstract_canon_sha256":"383897891deda95b46cfb5dd0fb493af79ecf4f92f00fe166fc8f85bb7d59a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:12.517135Z","signature_b64":"bIG14uFmUKWnag3dlpC+R/mfGFRCGU7OAN0Fyg9h1M5VeafYqqS8PohKCgWX4b0QNHeDEjvLRJh36jPB8wP2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"733699337b8b4aec0459c86f0139c28361e5c2d689b35994d2d4714f47bb6120","last_reissued_at":"2026-05-18T03:42:12.516268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:12.516268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth properties of scaled attachment random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Luc Devroye, Nicolas Fraiman, Omar Fawzi","submitted_at":"2012-10-26T15:48:09Z","abstract_excerpt":"We study depth properties of a general class of random recursive trees where each node i attaches to the random node iX_i and X_0, ..., X_n is a sequence of i.i.d. random variables taking values in [0,1). We call such trees scaled attachment random recursive trees (SARRT). We prove that the typical depth D_n, the maximum depth (or height) H_n and the minimum depth M_n of a SARRT are asymptotically given by D_n \\sim \\mu^{-1} \\log n, H_n \\sim \\alpha_{\\max} \\log n and M_n \\sim \\alpha_{\\min} \\log n where \\mu, \\alpha_{\\max} and \\alpha_{\\min} are constants depending only on the distribution of X_0 w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7168","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":"1210.7168","created_at":"2026-05-18T03:42:12.516431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7168v1","created_at":"2026-05-18T03:42:12.516431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7168","created_at":"2026-05-18T03:42:12.516431+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM3JSM33RNFO","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM3JSM33RNFOYBCZ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM3JSM33","created_at":"2026-05-18T12:27:16.716162+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/OM3JSM33RNFOYBCZZBXQCOOCQN","json":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN.json","graph_json":"https://pith.science/api/pith-number/OM3JSM33RNFOYBCZZBXQCOOCQN/graph.json","events_json":"https://pith.science/api/pith-number/OM3JSM33RNFOYBCZZBXQCOOCQN/events.json","paper":"https://pith.science/paper/OM3JSM33"},"agent_actions":{"view_html":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN","download_json":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN.json","view_paper":"https://pith.science/paper/OM3JSM33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7168&json=true","fetch_graph":"https://pith.science/api/pith-number/OM3JSM33RNFOYBCZZBXQCOOCQN/graph.json","fetch_events":"https://pith.science/api/pith-number/OM3JSM33RNFOYBCZZBXQCOOCQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN/action/storage_attestation","attest_author":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN/action/author_attestation","sign_citation":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN/action/citation_signature","submit_replication":"https://pith.science/pith/OM3JSM33RNFOYBCZZBXQCOOCQN/action/replication_record"}},"created_at":"2026-05-18T03:42:12.516431+00:00","updated_at":"2026-05-18T03:42:12.516431+00:00"}