{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3JWCHQVC7QTXOH26IA3HSYX66E","short_pith_number":"pith:3JWCHQVC","canonical_record":{"source":{"id":"1507.05981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T20:29:04Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"21445f385ae073163cf73d54a049da0dd8eb44b6dd51f1b3f4f18b58ed38703a","abstract_canon_sha256":"678f38d6cd4fb1c0f48d4e8627c2cc349df4637db716ba1db168a52d68d63676"},"schema_version":"1.0"},"canonical_sha256":"da6c23c2a2fc27771f5e40367962fef12f6b8f2159ee1922e0edd03c93c09563","source":{"kind":"arxiv","id":"1507.05981","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05981","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05981v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05981","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"3JWCHQVC7QTX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JWCHQVC7QTXOH26","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JWCHQVC","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3JWCHQVC7QTXOH26IA3HSYX66E","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T20:29:04Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"21445f385ae073163cf73d54a049da0dd8eb44b6dd51f1b3f4f18b58ed38703a","abstract_canon_sha256":"678f38d6cd4fb1c0f48d4e8627c2cc349df4637db716ba1db168a52d68d63676"},"schema_version":"1.0"},"canonical_sha256":"da6c23c2a2fc27771f5e40367962fef12f6b8f2159ee1922e0edd03c93c09563","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.871035Z","signature_b64":"dXHicvZYjml104Oa0iQ58girZX+FGsZaipu+IUcSEs6Mg+vDR8lNcW7EObVhFmfaGMFnVHoxGBlt1i/Yv7U1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6c23c2a2fc27771f5e40367962fef12f6b8f2159ee1922e0edd03c93c09563","last_reissued_at":"2026-05-18T00:08:36.870154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.870154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05981","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpoTZKaELPgLeNp9FuHkOLK2pF04x7pggOxu7WwS0WHTxOwxUTDvlpyFDJ0zrj4uJrCdawrNmNCljgeOWEZ5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:41:30.507759Z"},"content_sha256":"e5cb4930455bff4f69411bbd9937ced5596e382332e63d1738df28f81ae0c007","schema_version":"1.0","event_id":"sha256:e5cb4930455bff4f69411bbd9937ced5596e382332e63d1738df28f81ae0c007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3JWCHQVC7QTXOH26IA3HSYX66E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High degrees of random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Laura Eslava, Louigi Addario-Berry","submitted_at":"2015-07-21T20:29:04Z","abstract_excerpt":"For $n\\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\\{1,\\ldots,n\\}$. Let $\\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the maximum degree $\\Delta_n$ of $T_n$ satisfies $\\Delta_n/\\lfloor \\log_2 n\\rfloor \\to 1$ almost surely; Goh and Schmutz showed distributional convergence of $\\Delta_n - \\lfloor \\log_2 n \\rfloor$ along suitable subsequences. In this work we show how a version of Kingman's coalescent can be used to access much finer properties of the degree distribution in $T_n$.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05981","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZ8Az7eVmBC+wExKJVhSYBVg+be1V1BPW5Pp2aBKvekjn7/vcdRQ3Z6pBKW6ukiZW75ZI6OYas/4tQuyQr2YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:41:30.508478Z"},"content_sha256":"d012b162c1d16b23eb757ba52d467599c07ee3bf6b4d2fce303fb5bcc1524deb","schema_version":"1.0","event_id":"sha256:d012b162c1d16b23eb757ba52d467599c07ee3bf6b4d2fce303fb5bcc1524deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JWCHQVC7QTXOH26IA3HSYX66E/bundle.json","state_url":"https://pith.science/pith/3JWCHQVC7QTXOH26IA3HSYX66E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JWCHQVC7QTXOH26IA3HSYX66E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T16:41:30Z","links":{"resolver":"https://pith.science/pith/3JWCHQVC7QTXOH26IA3HSYX66E","bundle":"https://pith.science/pith/3JWCHQVC7QTXOH26IA3HSYX66E/bundle.json","state":"https://pith.science/pith/3JWCHQVC7QTXOH26IA3HSYX66E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JWCHQVC7QTXOH26IA3HSYX66E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3JWCHQVC7QTXOH26IA3HSYX66E","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":"678f38d6cd4fb1c0f48d4e8627c2cc349df4637db716ba1db168a52d68d63676","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T20:29:04Z","title_canon_sha256":"21445f385ae073163cf73d54a049da0dd8eb44b6dd51f1b3f4f18b58ed38703a"},"schema_version":"1.0","source":{"id":"1507.05981","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05981","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05981v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05981","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"3JWCHQVC7QTX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JWCHQVC7QTXOH26","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JWCHQVC","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:d012b162c1d16b23eb757ba52d467599c07ee3bf6b4d2fce303fb5bcc1524deb","target":"graph","created_at":"2026-05-18T00:08:36Z","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":"For $n\\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\\{1,\\ldots,n\\}$. Let $\\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the maximum degree $\\Delta_n$ of $T_n$ satisfies $\\Delta_n/\\lfloor \\log_2 n\\rfloor \\to 1$ almost surely; Goh and Schmutz showed distributional convergence of $\\Delta_n - \\lfloor \\log_2 n \\rfloor$ along suitable subsequences. In this work we show how a version of Kingman's coalescent can be used to access much finer properties of the degree distribution in $T_n$.\n  ","authors_text":"Laura Eslava, Louigi Addario-Berry","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T20:29:04Z","title":"High degrees of random recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05981","kind":"arxiv","version":2},"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:e5cb4930455bff4f69411bbd9937ced5596e382332e63d1738df28f81ae0c007","target":"record","created_at":"2026-05-18T00:08:36Z","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":"678f38d6cd4fb1c0f48d4e8627c2cc349df4637db716ba1db168a52d68d63676","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T20:29:04Z","title_canon_sha256":"21445f385ae073163cf73d54a049da0dd8eb44b6dd51f1b3f4f18b58ed38703a"},"schema_version":"1.0","source":{"id":"1507.05981","kind":"arxiv","version":2}},"canonical_sha256":"da6c23c2a2fc27771f5e40367962fef12f6b8f2159ee1922e0edd03c93c09563","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6c23c2a2fc27771f5e40367962fef12f6b8f2159ee1922e0edd03c93c09563","first_computed_at":"2026-05-18T00:08:36.870154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:36.870154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dXHicvZYjml104Oa0iQ58girZX+FGsZaipu+IUcSEs6Mg+vDR8lNcW7EObVhFmfaGMFnVHoxGBlt1i/Yv7U1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:36.871035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05981","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5cb4930455bff4f69411bbd9937ced5596e382332e63d1738df28f81ae0c007","sha256:d012b162c1d16b23eb757ba52d467599c07ee3bf6b4d2fce303fb5bcc1524deb"],"state_sha256":"9e0bd4dcdfcc2c9da7dc4551278a7816051ef380bbd0980035ca09feccfe5a75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiZnGm5u/dGSmvzgLoG0jWLXJTxzFSWERkyOIw5CCyNlwVVN1RnIlig896Hhfo+I1udJY3j4kwmyeNN8/oH8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:41:30.512136Z","bundle_sha256":"695c548a372ea10245761b055f2d2d5c23f818352f188a46309e462110589566"}}