{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CQKLUYM6KWOW7SJUS2B63UMMIN","short_pith_number":"pith:CQKLUYM6","canonical_record":{"source":{"id":"1207.3915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-17T08:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"85030019b3893ee41ec751f0249775a52338a5b1625dc158222e649157f02c3f","abstract_canon_sha256":"101c41e78a0581d599b787cf13dc031e73ba855ec80d4da11ba1c34d61984362"},"schema_version":"1.0"},"canonical_sha256":"1414ba619e559d6fc9349683edd18c4356d86275296b7528e2d88b76eb68336c","source":{"kind":"arxiv","id":"1207.3915","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3915","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3915v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3915","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"CQKLUYM6KWOW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CQKLUYM6KWOW7SJU","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CQKLUYM6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CQKLUYM6KWOW7SJUS2B63UMMIN","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-17T08:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"85030019b3893ee41ec751f0249775a52338a5b1625dc158222e649157f02c3f","abstract_canon_sha256":"101c41e78a0581d599b787cf13dc031e73ba855ec80d4da11ba1c34d61984362"},"schema_version":"1.0"},"canonical_sha256":"1414ba619e559d6fc9349683edd18c4356d86275296b7528e2d88b76eb68336c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.719539Z","signature_b64":"q8+9Idn2XfBqCl5MglAZIYUPFeuH4BMRiLRSmMb3T4vOFXLKJQi+bwr2QLh+FkgLyOxUvTxFib7ZJi+k5KiLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1414ba619e559d6fc9349683edd18c4356d86275296b7528e2d88b76eb68336c","last_reissued_at":"2026-05-18T03:25:25.719044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.719044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3915","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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11NQFUaCyiuQSI8rOQK3biovthVgItwCdIYe5/khD8qnWzVD3idpo0HZF4GwKENCWjLLgC6KiT9KZJPXpYaKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:06.900715Z"},"content_sha256":"14e74be5c44d4c1b9568345768c2e2ba031297a56d780fb08ac7ad4bfba424c5","schema_version":"1.0","event_id":"sha256:14e74be5c44d4c1b9568345768c2e2ba031297a56d780fb08ac7ad4bfba424c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CQKLUYM6KWOW7SJUS2B63UMMIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The asymptotic number of different rooted trees of a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yiyang Li, Yongtang Shi","submitted_at":"2012-07-17T08:44:04Z","abstract_excerpt":"Let $\\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\\mu_r+o(1))n$ for almost every tree of $\\mathcal{T}_n$, where $\\mu_r$ is a constant. As an application, we show that the number of any given pattern in $\\mathcal{T}_n$ is also asymptotically normally distributed with mean $\\sim \\mu_M n$ and variance $\\sim \\sigma_M n$, where $\\mu_M, \\sigma_M$ are some constants related to the given pattern. This solves an open question claimed in Kok's thesis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3915","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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FokK9VoYNjAKAkpW/KRRZZXuStdhv9k03lMwEvX99f58lEPOXgCeZP7kNaAKGUgr2w9TC+B6NybL7Wip/TdGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:06.901330Z"},"content_sha256":"aedcd94281957f7a4ce6dfb71ba89e26b6e9ef7c9f0fa00bb82ec1b2fa27dfff","schema_version":"1.0","event_id":"sha256:aedcd94281957f7a4ce6dfb71ba89e26b6e9ef7c9f0fa00bb82ec1b2fa27dfff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/bundle.json","state_url":"https://pith.science/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/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-25T07:37:06Z","links":{"resolver":"https://pith.science/pith/CQKLUYM6KWOW7SJUS2B63UMMIN","bundle":"https://pith.science/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/bundle.json","state":"https://pith.science/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQKLUYM6KWOW7SJUS2B63UMMIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CQKLUYM6KWOW7SJUS2B63UMMIN","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":"101c41e78a0581d599b787cf13dc031e73ba855ec80d4da11ba1c34d61984362","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-17T08:44:04Z","title_canon_sha256":"85030019b3893ee41ec751f0249775a52338a5b1625dc158222e649157f02c3f"},"schema_version":"1.0","source":{"id":"1207.3915","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3915","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3915v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3915","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"CQKLUYM6KWOW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CQKLUYM6KWOW7SJU","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CQKLUYM6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:aedcd94281957f7a4ce6dfb71ba89e26b6e9ef7c9f0fa00bb82ec1b2fa27dfff","target":"graph","created_at":"2026-05-18T03:25:25Z","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 $\\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\\mu_r+o(1))n$ for almost every tree of $\\mathcal{T}_n$, where $\\mu_r$ is a constant. As an application, we show that the number of any given pattern in $\\mathcal{T}_n$ is also asymptotically normally distributed with mean $\\sim \\mu_M n$ and variance $\\sim \\sigma_M n$, where $\\mu_M, \\sigma_M$ are some constants related to the given pattern. This solves an open question claimed in Kok's thesis.","authors_text":"Xueliang Li, Yiyang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-17T08:44:04Z","title":"The asymptotic number of different rooted trees of a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3915","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:14e74be5c44d4c1b9568345768c2e2ba031297a56d780fb08ac7ad4bfba424c5","target":"record","created_at":"2026-05-18T03:25:25Z","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":"101c41e78a0581d599b787cf13dc031e73ba855ec80d4da11ba1c34d61984362","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-17T08:44:04Z","title_canon_sha256":"85030019b3893ee41ec751f0249775a52338a5b1625dc158222e649157f02c3f"},"schema_version":"1.0","source":{"id":"1207.3915","kind":"arxiv","version":2}},"canonical_sha256":"1414ba619e559d6fc9349683edd18c4356d86275296b7528e2d88b76eb68336c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1414ba619e559d6fc9349683edd18c4356d86275296b7528e2d88b76eb68336c","first_computed_at":"2026-05-18T03:25:25.719044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:25.719044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8+9Idn2XfBqCl5MglAZIYUPFeuH4BMRiLRSmMb3T4vOFXLKJQi+bwr2QLh+FkgLyOxUvTxFib7ZJi+k5KiLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:25.719539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3915","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14e74be5c44d4c1b9568345768c2e2ba031297a56d780fb08ac7ad4bfba424c5","sha256:aedcd94281957f7a4ce6dfb71ba89e26b6e9ef7c9f0fa00bb82ec1b2fa27dfff"],"state_sha256":"60480e418a585d6e234928e1153bd564146c52f5695a5f91df64f1ad17e98313"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SS98g3b+zTHGi8i59vl3t+HPaG7Pdjoi1Dw44wrEcv61Ll3m7ZopDOD9AFFSmlDk3BG9WI4jFaEvJJ5CZMLdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:37:06.904604Z","bundle_sha256":"20617438c6cefb6131f12756f46d1d9b2f95615321801d7ece7cbe9486e2f5f0"}}