{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OM3JSM33RNFOYBCZZBXQCOOCQN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"383897891deda95b46cfb5dd0fb493af79ecf4f92f00fe166fc8f85bb7d59a76","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-26T15:48:09Z","title_canon_sha256":"a7dd134a40f6e3c837de2d864d61de936b6369eb857e3717eb3dfd6df2e69a2a"},"schema_version":"1.0","source":{"id":"1210.7168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7168","created_at":"2026-05-18T03:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7168v1","created_at":"2026-05-18T03:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7168","created_at":"2026-05-18T03:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"OM3JSM33RNFO","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OM3JSM33RNFOYBCZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OM3JSM33","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:8f6a1c051fedfdb3cfc3967ff9fc6cfddcfd4af2eeb7a2ece2599a97de35f1f4","target":"graph","created_at":"2026-05-18T03:42:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Luc Devroye, Nicolas Fraiman, Omar Fawzi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-26T15:48:09Z","title":"Depth properties of scaled attachment random recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7168","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa17559b1cf4ce161fefa9bcac9dd2594636f6a22e85ed55d34fcf3fbd9bc805","target":"record","created_at":"2026-05-18T03:42:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"383897891deda95b46cfb5dd0fb493af79ecf4f92f00fe166fc8f85bb7d59a76","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-26T15:48:09Z","title_canon_sha256":"a7dd134a40f6e3c837de2d864d61de936b6369eb857e3717eb3dfd6df2e69a2a"},"schema_version":"1.0","source":{"id":"1210.7168","kind":"arxiv","version":1}},"canonical_sha256":"733699337b8b4aec0459c86f0139c28361e5c2d689b35994d2d4714f47bb6120","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"733699337b8b4aec0459c86f0139c28361e5c2d689b35994d2d4714f47bb6120","first_computed_at":"2026-05-18T03:42:12.516268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:12.516268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bIG14uFmUKWnag3dlpC+R/mfGFRCGU7OAN0Fyg9h1M5VeafYqqS8PohKCgWX4b0QNHeDEjvLRJh36jPB8wP2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:12.517135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa17559b1cf4ce161fefa9bcac9dd2594636f6a22e85ed55d34fcf3fbd9bc805","sha256:8f6a1c051fedfdb3cfc3967ff9fc6cfddcfd4af2eeb7a2ece2599a97de35f1f4"],"state_sha256":"5afad64d75fe5d70896a083f26f354ba205da5b0ceb442aa8ef7befeddf87d53"}