{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4L2UC5ZZK6UDIYO3APLGM37KPK","short_pith_number":"pith:4L2UC5ZZ","canonical_record":{"source":{"id":"1801.04606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T19:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c9155ab13b357491e22351ed29c1eec6550860ad22f42de3d3e7c5e0702fb00","abstract_canon_sha256":"43db986ab23360298a85a78ce260f3b4bb6e9c21719a5bff74a1d5ea4a7d767a"},"schema_version":"1.0"},"canonical_sha256":"e2f541773957a83461db03d6666fea7a9173a52d0cd116f49d9487ad0dd88fd4","source":{"kind":"arxiv","id":"1801.04606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04606","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04606v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04606","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"4L2UC5ZZK6UD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4L2UC5ZZK6UDIYO3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4L2UC5ZZ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4L2UC5ZZK6UDIYO3APLGM37KPK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T19:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c9155ab13b357491e22351ed29c1eec6550860ad22f42de3d3e7c5e0702fb00","abstract_canon_sha256":"43db986ab23360298a85a78ce260f3b4bb6e9c21719a5bff74a1d5ea4a7d767a"},"schema_version":"1.0"},"canonical_sha256":"e2f541773957a83461db03d6666fea7a9173a52d0cd116f49d9487ad0dd88fd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.876749Z","signature_b64":"EdGK6Sh9Anesj8Mze/SD/miIfojSgCS79QAaZnOJof9a6JvRWm6S7JBEBQxFPSZ1oRiueNkZWWbZUyV5solBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f541773957a83461db03d6666fea7a9173a52d0cd116f49d9487ad0dd88fd4","last_reissued_at":"2026-05-18T00:26:03.876086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.876086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04606","source_version":1,"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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajCqob0tNO+Ne+mu/3wBGvuL+Y0PjFct7ckOlBAbM3ZAqeduTOuw0RXJLGQcljfhlTYsW2tmtM/qXyRMM9fbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:38:54.945092Z"},"content_sha256":"6e77a043cdad2364249b2e801fa8a9c144c82275636fd288c0823dfccb4a3ad0","schema_version":"1.0","event_id":"sha256:6e77a043cdad2364249b2e801fa8a9c144c82275636fd288c0823dfccb4a3ad0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4L2UC5ZZK6UDIYO3APLGM37KPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A functional limit theorem for the profile of random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Iksanov, Zakhar Kabluchko","submitted_at":"2018-01-14T19:52:08Z","abstract_excerpt":"Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\\ldots, X_{[n^t]}(k))_{t\\geq 0}$, for each $k\\in\\mathbb N$. We show that after proper centering and normalization, this process converges weakly to a vector-valued Gaussian process whose components are integrated Brownian motions. This result is deduced from a functional limit theorem for Crump-Mode-Jagers branching processes generated by increasing random walks with increments that have finite second moment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04606","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"},"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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MHIMA8wPIXvnfFKZDUEh5YYPnrwU3e7x2srJbhDib6rIeLgbbbpBU9u/pTD0jUn1+M9ccyhkW6qfdX54cIxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:38:54.945501Z"},"content_sha256":"b33552fc4fed8c9c90131dea101213be135bd7cb35ee42ca9fc93045ac36df09","schema_version":"1.0","event_id":"sha256:b33552fc4fed8c9c90131dea101213be135bd7cb35ee42ca9fc93045ac36df09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/bundle.json","state_url":"https://pith.science/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/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-02T08:38:54Z","links":{"resolver":"https://pith.science/pith/4L2UC5ZZK6UDIYO3APLGM37KPK","bundle":"https://pith.science/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/bundle.json","state":"https://pith.science/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4L2UC5ZZK6UDIYO3APLGM37KPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4L2UC5ZZK6UDIYO3APLGM37KPK","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":"43db986ab23360298a85a78ce260f3b4bb6e9c21719a5bff74a1d5ea4a7d767a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T19:52:08Z","title_canon_sha256":"9c9155ab13b357491e22351ed29c1eec6550860ad22f42de3d3e7c5e0702fb00"},"schema_version":"1.0","source":{"id":"1801.04606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04606","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04606v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04606","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"4L2UC5ZZK6UD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4L2UC5ZZK6UDIYO3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4L2UC5ZZ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:b33552fc4fed8c9c90131dea101213be135bd7cb35ee42ca9fc93045ac36df09","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\\ldots, X_{[n^t]}(k))_{t\\geq 0}$, for each $k\\in\\mathbb N$. We show that after proper centering and normalization, this process converges weakly to a vector-valued Gaussian process whose components are integrated Brownian motions. This result is deduced from a functional limit theorem for Crump-Mode-Jagers branching processes generated by increasing random walks with increments that have finite second moment.","authors_text":"Alexander Iksanov, Zakhar Kabluchko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T19:52:08Z","title":"A functional limit theorem for the profile of random recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04606","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:6e77a043cdad2364249b2e801fa8a9c144c82275636fd288c0823dfccb4a3ad0","target":"record","created_at":"2026-05-18T00:26:03Z","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":"43db986ab23360298a85a78ce260f3b4bb6e9c21719a5bff74a1d5ea4a7d767a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-14T19:52:08Z","title_canon_sha256":"9c9155ab13b357491e22351ed29c1eec6550860ad22f42de3d3e7c5e0702fb00"},"schema_version":"1.0","source":{"id":"1801.04606","kind":"arxiv","version":1}},"canonical_sha256":"e2f541773957a83461db03d6666fea7a9173a52d0cd116f49d9487ad0dd88fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2f541773957a83461db03d6666fea7a9173a52d0cd116f49d9487ad0dd88fd4","first_computed_at":"2026-05-18T00:26:03.876086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.876086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EdGK6Sh9Anesj8Mze/SD/miIfojSgCS79QAaZnOJof9a6JvRWm6S7JBEBQxFPSZ1oRiueNkZWWbZUyV5solBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.876749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e77a043cdad2364249b2e801fa8a9c144c82275636fd288c0823dfccb4a3ad0","sha256:b33552fc4fed8c9c90131dea101213be135bd7cb35ee42ca9fc93045ac36df09"],"state_sha256":"67a86238a612d83df39fd6d07b99102bc2be62f5e2696e1839c222edcb2b32be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhDqJP95YlgmAoOEyOlj7eMOoMDuxeZgFOSLNR6suDuYdixMdJiawezBCSc2/1CrWZlkLSVjMoImHjYWAEtMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:38:54.947557Z","bundle_sha256":"473e70ad52f1a967d15e2ac1608e7602c9dd7988d877c625bfc1eb2d2e115332"}}