{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PQFRYHOOQLGKVCY45ASX6BHSDK","short_pith_number":"pith:PQFRYHOO","canonical_record":{"source":{"id":"1406.6883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-26T13:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"6ba79b1e34c3f79ee1750e76b92bcb2553425b8b755d0a6927e48a2729763666","abstract_canon_sha256":"b1306ead99259d3e6ea450496d5083973866f3ca5b056cc72940e303ba138b76"},"schema_version":"1.0"},"canonical_sha256":"7c0b1c1dce82ccaa8b1ce8257f04f21abb9270a6234420a0e572913e7efae72d","source":{"kind":"arxiv","id":"1406.6883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6883","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6883v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6883","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"PQFRYHOOQLGK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQFRYHOOQLGKVCY4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQFRYHOO","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PQFRYHOOQLGKVCY45ASX6BHSDK","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-26T13:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"6ba79b1e34c3f79ee1750e76b92bcb2553425b8b755d0a6927e48a2729763666","abstract_canon_sha256":"b1306ead99259d3e6ea450496d5083973866f3ca5b056cc72940e303ba138b76"},"schema_version":"1.0"},"canonical_sha256":"7c0b1c1dce82ccaa8b1ce8257f04f21abb9270a6234420a0e572913e7efae72d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.580640Z","signature_b64":"+3iNraJJMIlRZoPNvUV1hRAjZopjUEP5PzD9lXs5UAroMGcCD3ZDGDg4onqK+smLhpiYmmk3VZrewPqsxdzeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c0b1c1dce82ccaa8b1ce8257f04f21abb9270a6234420a0e572913e7efae72d","last_reissued_at":"2026-05-18T02:48:55.579931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.579931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6883","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvjs5Fv23rDH0akfMEI5kfvuGOLXFhoU1QfDC59ZJZ2BNcV6TpXa94qtCSrAO/7zJ9HSt/WpY2+rJEHLRS2CBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:52:17.942892Z"},"content_sha256":"2212eea74c0063a7bfe11c6c42f30aca546253aa3e5d2f6c230e88718213f879","schema_version":"1.0","event_id":"sha256:2212eea74c0063a7bfe11c6c42f30aca546253aa3e5d2f6c230e88718213f879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PQFRYHOOQLGKVCY45ASX6BHSDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limit Laws for Functions of Fringe trees for Binary Search Trees and Recursive Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Svante Janson","submitted_at":"2014-06-26T13:33:37Z","abstract_excerpt":"We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree and the random recursive tree (of total size $ n $) asymptotically has a Poisson distribution if $ k\\rightarrow\\infty $, and that the distribution is asymptotically normal for $ k=o(\\sqrt{n}) $. Furthermore, we prove similar results for the number of subtrees of size $ k $ with some required property $ P $, for example the number of copies of a certain fixed s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6883","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8e3CjARfF/I5e6MUbWaQDzmUs+VfNcGZVu4FzJ3aQJSxmxQcqNDar3yvFwM/jlttHG0u1UztT47r3Hv6VAoyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:52:17.943595Z"},"content_sha256":"3da174f726485620e9b029cd3f2fd8d0a933f286d54d6e34153c7ea27062c42c","schema_version":"1.0","event_id":"sha256:3da174f726485620e9b029cd3f2fd8d0a933f286d54d6e34153c7ea27062c42c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/bundle.json","state_url":"https://pith.science/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/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-25T16:52:17Z","links":{"resolver":"https://pith.science/pith/PQFRYHOOQLGKVCY45ASX6BHSDK","bundle":"https://pith.science/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/bundle.json","state":"https://pith.science/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQFRYHOOQLGKVCY45ASX6BHSDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PQFRYHOOQLGKVCY45ASX6BHSDK","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":"b1306ead99259d3e6ea450496d5083973866f3ca5b056cc72940e303ba138b76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-26T13:33:37Z","title_canon_sha256":"6ba79b1e34c3f79ee1750e76b92bcb2553425b8b755d0a6927e48a2729763666"},"schema_version":"1.0","source":{"id":"1406.6883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6883","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6883v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6883","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"PQFRYHOOQLGK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQFRYHOOQLGKVCY4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQFRYHOO","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:3da174f726485620e9b029cd3f2fd8d0a933f286d54d6e34153c7ea27062c42c","target":"graph","created_at":"2026-05-18T02:48:55Z","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 prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree and the random recursive tree (of total size $ n $) asymptotically has a Poisson distribution if $ k\\rightarrow\\infty $, and that the distribution is asymptotically normal for $ k=o(\\sqrt{n}) $. Furthermore, we prove similar results for the number of subtrees of size $ k $ with some required property $ P $, for example the number of copies of a certain fixed s","authors_text":"Cecilia Holmgren, Svante Janson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-26T13:33:37Z","title":"Limit Laws for Functions of Fringe trees for Binary Search Trees and Recursive Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6883","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:2212eea74c0063a7bfe11c6c42f30aca546253aa3e5d2f6c230e88718213f879","target":"record","created_at":"2026-05-18T02:48:55Z","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":"b1306ead99259d3e6ea450496d5083973866f3ca5b056cc72940e303ba138b76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-26T13:33:37Z","title_canon_sha256":"6ba79b1e34c3f79ee1750e76b92bcb2553425b8b755d0a6927e48a2729763666"},"schema_version":"1.0","source":{"id":"1406.6883","kind":"arxiv","version":1}},"canonical_sha256":"7c0b1c1dce82ccaa8b1ce8257f04f21abb9270a6234420a0e572913e7efae72d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c0b1c1dce82ccaa8b1ce8257f04f21abb9270a6234420a0e572913e7efae72d","first_computed_at":"2026-05-18T02:48:55.579931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.579931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3iNraJJMIlRZoPNvUV1hRAjZopjUEP5PzD9lXs5UAroMGcCD3ZDGDg4onqK+smLhpiYmmk3VZrewPqsxdzeAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.580640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2212eea74c0063a7bfe11c6c42f30aca546253aa3e5d2f6c230e88718213f879","sha256:3da174f726485620e9b029cd3f2fd8d0a933f286d54d6e34153c7ea27062c42c"],"state_sha256":"fad0c3c980ac21020ae51bfce85cfde956de1b864556a6b0d3e6f401234ae711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jtdt1PJw2hPkJNYq/7UeGiuE62zS6k4eOKpJB0Udqm2tGtgmxmQjaAvVBcn1UrxV6pB5OFQDZp7LrAgeWV6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:52:17.947289Z","bundle_sha256":"3d95915b61f626fa630627a8d9bb640288675bfc1ea7be6a16099489206ab066"}}