{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FLNVB7PIA2DVT7XA3IFWX6RONP","short_pith_number":"pith:FLNVB7PI","canonical_record":{"source":{"id":"1206.2975","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T00:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"7c858733e0decfd12c0a16ebe8a1631742a4e56af810d8353640b3cf2aeda74b","abstract_canon_sha256":"6db556735ff0c6c24912e690c926b12e36c952a16b9c503464be6341bbff777d"},"schema_version":"1.0"},"canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","source":{"kind":"arxiv","id":"1206.2975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2975","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2975v1","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2975","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"pith_short_12","alias_value":"FLNVB7PIA2DV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FLNVB7PIA2DVT7XA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FLNVB7PI","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FLNVB7PIA2DVT7XA3IFWX6RONP","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2975","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T00:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"7c858733e0decfd12c0a16ebe8a1631742a4e56af810d8353640b3cf2aeda74b","abstract_canon_sha256":"6db556735ff0c6c24912e690c926b12e36c952a16b9c503464be6341bbff777d"},"schema_version":"1.0"},"canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:33.226003Z","signature_b64":"DZPI7s6TzP09PBxQ0ke/PH+VtgEChmxHVZm/hqwpCdxD1pYZDMaxd9pfNF8dGXorG0pu4d4oJW6X4ZlNHYNaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","last_reissued_at":"2026-05-18T03:53:33.225299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:33.225299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2975","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-18T03:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FF96i2Azqcn2QeI30k3I0IM+B8K5OSbv7ZQdTrzMnh7sY+wQpXASR5nZWJlZ8ZG2fuZVOO24bDqM3CHnBz8CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:23.275176Z"},"content_sha256":"8392c2772eeee74f1a6346fb98fda0aff82cd6edc71be1e65fcfade70193c2fd","schema_version":"1.0","event_id":"sha256:8392c2772eeee74f1a6346fb98fda0aff82cd6edc71be1e65fcfade70193c2fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FLNVB7PIA2DVT7XA3IFWX6RONP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating the total number of subtrees of trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Shujing Wang","submitted_at":"2012-06-14T00:38:25Z","abstract_excerpt":"Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\\ (1)\\, Sharp upper bound on the total number of subtrees (resp. leaf containing subtrees) among $n$-vertex trees with a given matching number is determined; as a consequence, the $n$-vertex tree with domination number $\\gamma$ maximizing the total number of subtrees (resp. leaf containing subtrees) is characterized. (2)\\, Sharp lower bound on the total number of leaf containing subtrees among $n$-vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2975","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-18T03:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3icX86qfwz+zGYHzJ0HcspBF0pC/0Hyn9qOLG3pFGjmN8OMVQc4MmKQiA2weYrtHIgLdzH1EQhqpYDb6VIQ2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:02:23.275934Z"},"content_sha256":"38bcb8cdccd44fe6f9a48886964c6fee88e076d559a07d3d504c714d1c5ab217","schema_version":"1.0","event_id":"sha256:38bcb8cdccd44fe6f9a48886964c6fee88e076d559a07d3d504c714d1c5ab217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/bundle.json","state_url":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/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-08T19:02:23Z","links":{"resolver":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP","bundle":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/bundle.json","state":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FLNVB7PIA2DVT7XA3IFWX6RONP","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":"6db556735ff0c6c24912e690c926b12e36c952a16b9c503464be6341bbff777d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T00:38:25Z","title_canon_sha256":"7c858733e0decfd12c0a16ebe8a1631742a4e56af810d8353640b3cf2aeda74b"},"schema_version":"1.0","source":{"id":"1206.2975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2975","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2975v1","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2975","created_at":"2026-05-18T03:53:33Z"},{"alias_kind":"pith_short_12","alias_value":"FLNVB7PIA2DV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FLNVB7PIA2DVT7XA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FLNVB7PI","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:38bcb8cdccd44fe6f9a48886964c6fee88e076d559a07d3d504c714d1c5ab217","target":"graph","created_at":"2026-05-18T03:53:33Z","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":"Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\\ (1)\\, Sharp upper bound on the total number of subtrees (resp. leaf containing subtrees) among $n$-vertex trees with a given matching number is determined; as a consequence, the $n$-vertex tree with domination number $\\gamma$ maximizing the total number of subtrees (resp. leaf containing subtrees) is characterized. (2)\\, Sharp lower bound on the total number of leaf containing subtrees among $n$-vert","authors_text":"Shuchao Li, Shujing Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T00:38:25Z","title":"Enumerating the total number of subtrees of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2975","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:8392c2772eeee74f1a6346fb98fda0aff82cd6edc71be1e65fcfade70193c2fd","target":"record","created_at":"2026-05-18T03:53:33Z","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":"6db556735ff0c6c24912e690c926b12e36c952a16b9c503464be6341bbff777d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T00:38:25Z","title_canon_sha256":"7c858733e0decfd12c0a16ebe8a1631742a4e56af810d8353640b3cf2aeda74b"},"schema_version":"1.0","source":{"id":"1206.2975","kind":"arxiv","version":1}},"canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","first_computed_at":"2026-05-18T03:53:33.225299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:33.225299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DZPI7s6TzP09PBxQ0ke/PH+VtgEChmxHVZm/hqwpCdxD1pYZDMaxd9pfNF8dGXorG0pu4d4oJW6X4ZlNHYNaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:33.226003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8392c2772eeee74f1a6346fb98fda0aff82cd6edc71be1e65fcfade70193c2fd","sha256:38bcb8cdccd44fe6f9a48886964c6fee88e076d559a07d3d504c714d1c5ab217"],"state_sha256":"0795ce8826f4aae7cc44dc85e4b141e6f13a3f227407e6c0dd554d2ae2521d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeRq3xNwywl2YygxQjrEgDA7y/Qb/zLHEwsx1A+aTx1EBMOE+FdRZMBYGij1/dgQo9PvpekpiFFMIe9mseb5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:02:23.278955Z","bundle_sha256":"362d25dfbd9d48aebe62b6471f52965ee35d642a6e72f2ad968cae20fbf6f18c"}}