{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JMK72OYPINIUU2VWG2UE5BTX45","short_pith_number":"pith:JMK72OYP","canonical_record":{"source":{"id":"1603.08125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-26T17:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"51bda8a50c5aa858e0ddf26ed1ddb3826d14143ade8abfdebe40d6dabcac4abd","abstract_canon_sha256":"ada0fb7bf87ea557388f3d47b3149d6554ed17d93fb0c979d3a1f5e14b02d598"},"schema_version":"1.0"},"canonical_sha256":"4b15fd3b0f43514a6ab636a84e8677e759bf7cee1cf7f13d0760d16f67eb4970","source":{"kind":"arxiv","id":"1603.08125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08125","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08125v1","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08125","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"JMK72OYPINIU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JMK72OYPINIUU2VW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JMK72OYP","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JMK72OYPINIUU2VWG2UE5BTX45","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-26T17:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"51bda8a50c5aa858e0ddf26ed1ddb3826d14143ade8abfdebe40d6dabcac4abd","abstract_canon_sha256":"ada0fb7bf87ea557388f3d47b3149d6554ed17d93fb0c979d3a1f5e14b02d598"},"schema_version":"1.0"},"canonical_sha256":"4b15fd3b0f43514a6ab636a84e8677e759bf7cee1cf7f13d0760d16f67eb4970","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:13.187980Z","signature_b64":"4YqTSW5nK0E9jNNwXNM2TKqo5vqfwot1+SNajMHAvB/l8FWuVamFK8gS7RpGrX4nLJmdtuLhdJYQPrt/7gZnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b15fd3b0f43514a6ab636a84e8677e759bf7cee1cf7f13d0760d16f67eb4970","last_reissued_at":"2026-05-18T01:18:13.187467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:13.187467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08125","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-18T01:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZsR56Wj570XiN9WUy2bvLOCSZajNLR1IMrdUwx7FP/sd3WOHNNXq+z/96Mq1y3OTLIYPJPoyuSDOQpSqAfbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:29.226553Z"},"content_sha256":"9c5c251ba0d62ba48c241e74b18dd0cb40164fd34ae1cbb75aa545a95ea62a2c","schema_version":"1.0","event_id":"sha256:9c5c251ba0d62ba48c241e74b18dd0cb40164fd34ae1cbb75aa545a95ea62a2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JMK72OYPINIUU2VWG2UE5BTX45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multivariate normal limit laws for the numbers of fringe subtrees in $ m $-ary search trees and preferential attachment trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Matas \\v{S}ileikis, Svante Janson","submitted_at":"2016-03-26T17:38:20Z","abstract_excerpt":"We study fringe subtrees of random $ m $-ary search trees and of preferential attachment trees, by putting them in the context of generalised P\\'olya urns. In particular we show that for the random $ m $-ary search trees with $ m\\leq 26 $ and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree $ T $ converges to a normal distribution; more generally, we also prove multivariate normal distribution results for random vectors of such numbers for different fringe subtrees. Furthermore, we show that the number of protected nodes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08125","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-18T01:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ViohMV3Xb+KdqE8efXmvFwcv7ZyUznhT7OHa04WmEpH2CEPdNrjN7F214cOITzC6cEYzMcQQRZRL7eLUWRDiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:29.227200Z"},"content_sha256":"605d51dfa079575a6d4c40865a407c22ab49772911b519ebf9265d9d26fcbc2e","schema_version":"1.0","event_id":"sha256:605d51dfa079575a6d4c40865a407c22ab49772911b519ebf9265d9d26fcbc2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMK72OYPINIUU2VWG2UE5BTX45/bundle.json","state_url":"https://pith.science/pith/JMK72OYPINIUU2VWG2UE5BTX45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMK72OYPINIUU2VWG2UE5BTX45/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-05-25T19:37:29Z","links":{"resolver":"https://pith.science/pith/JMK72OYPINIUU2VWG2UE5BTX45","bundle":"https://pith.science/pith/JMK72OYPINIUU2VWG2UE5BTX45/bundle.json","state":"https://pith.science/pith/JMK72OYPINIUU2VWG2UE5BTX45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMK72OYPINIUU2VWG2UE5BTX45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JMK72OYPINIUU2VWG2UE5BTX45","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":"ada0fb7bf87ea557388f3d47b3149d6554ed17d93fb0c979d3a1f5e14b02d598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-26T17:38:20Z","title_canon_sha256":"51bda8a50c5aa858e0ddf26ed1ddb3826d14143ade8abfdebe40d6dabcac4abd"},"schema_version":"1.0","source":{"id":"1603.08125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08125","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08125v1","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08125","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"JMK72OYPINIU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JMK72OYPINIUU2VW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JMK72OYP","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:605d51dfa079575a6d4c40865a407c22ab49772911b519ebf9265d9d26fcbc2e","target":"graph","created_at":"2026-05-18T01:18:13Z","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 fringe subtrees of random $ m $-ary search trees and of preferential attachment trees, by putting them in the context of generalised P\\'olya urns. In particular we show that for the random $ m $-ary search trees with $ m\\leq 26 $ and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree $ T $ converges to a normal distribution; more generally, we also prove multivariate normal distribution results for random vectors of such numbers for different fringe subtrees. Furthermore, we show that the number of protected nodes","authors_text":"Cecilia Holmgren, Matas \\v{S}ileikis, Svante Janson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-26T17:38:20Z","title":"Multivariate normal limit laws for the numbers of fringe subtrees in $ m $-ary search trees and preferential attachment trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08125","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:9c5c251ba0d62ba48c241e74b18dd0cb40164fd34ae1cbb75aa545a95ea62a2c","target":"record","created_at":"2026-05-18T01:18:13Z","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":"ada0fb7bf87ea557388f3d47b3149d6554ed17d93fb0c979d3a1f5e14b02d598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-26T17:38:20Z","title_canon_sha256":"51bda8a50c5aa858e0ddf26ed1ddb3826d14143ade8abfdebe40d6dabcac4abd"},"schema_version":"1.0","source":{"id":"1603.08125","kind":"arxiv","version":1}},"canonical_sha256":"4b15fd3b0f43514a6ab636a84e8677e759bf7cee1cf7f13d0760d16f67eb4970","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b15fd3b0f43514a6ab636a84e8677e759bf7cee1cf7f13d0760d16f67eb4970","first_computed_at":"2026-05-18T01:18:13.187467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:13.187467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4YqTSW5nK0E9jNNwXNM2TKqo5vqfwot1+SNajMHAvB/l8FWuVamFK8gS7RpGrX4nLJmdtuLhdJYQPrt/7gZnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:13.187980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c5c251ba0d62ba48c241e74b18dd0cb40164fd34ae1cbb75aa545a95ea62a2c","sha256:605d51dfa079575a6d4c40865a407c22ab49772911b519ebf9265d9d26fcbc2e"],"state_sha256":"639a09de1311f6733c843c84e91ae2f41c2d4ff7828863f77fedb2866f537b5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kx08Pa+3e4hZZ4VLr7dU8OWqj/RYkFe1lnr1Esr89QVZQsW0B0/lp3BJJfu+Zp9BfNDgR32LS7fbiAmTRrODCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:37:29.230543Z","bundle_sha256":"f5726b6f684924152dbb3d12535f95ff9821a06595bba5ee4bce0517f47a5817"}}