{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FLNVB7PIA2DVT7XA3IFWX6RONP","short_pith_number":"pith:FLNVB7PI","schema_version":"1.0","canonical_sha256":"2adb50fde8068759fee0da0b6bfa2e6bf0d9c138cb9137a2733288e4068321c8","source":{"kind":"arxiv","id":"1206.2975","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.2975","created_at":"2026-05-18T03:53:33.225425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2975v1","created_at":"2026-05-18T03:53:33.225425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2975","created_at":"2026-05-18T03:53:33.225425+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLNVB7PIA2DV","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLNVB7PIA2DVT7XA","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLNVB7PI","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP","json":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP.json","graph_json":"https://pith.science/api/pith-number/FLNVB7PIA2DVT7XA3IFWX6RONP/graph.json","events_json":"https://pith.science/api/pith-number/FLNVB7PIA2DVT7XA3IFWX6RONP/events.json","paper":"https://pith.science/paper/FLNVB7PI"},"agent_actions":{"view_html":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP","download_json":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP.json","view_paper":"https://pith.science/paper/FLNVB7PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2975&json=true","fetch_graph":"https://pith.science/api/pith-number/FLNVB7PIA2DVT7XA3IFWX6RONP/graph.json","fetch_events":"https://pith.science/api/pith-number/FLNVB7PIA2DVT7XA3IFWX6RONP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/action/storage_attestation","attest_author":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/action/author_attestation","sign_citation":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/action/citation_signature","submit_replication":"https://pith.science/pith/FLNVB7PIA2DVT7XA3IFWX6RONP/action/replication_record"}},"created_at":"2026-05-18T03:53:33.225425+00:00","updated_at":"2026-05-18T03:53:33.225425+00:00"}