{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WTMXOSY2JFELJHHQSTL733IKUM","short_pith_number":"pith:WTMXOSY2","schema_version":"1.0","canonical_sha256":"b4d9774b1a4948b49cf094d7fded0aa309b2dbef3c06a0e5b4a4bfd517a56469","source":{"kind":"arxiv","id":"1210.2871","version":1},"attestation_state":"computed","paper":{"title":"Trees with the most subtrees -- an algorithmic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Gray, Hua Wang, Xiao-Dong Zhang, Xiu-Mei Zhang","submitted_at":"2012-10-10T11:10:34Z","abstract_excerpt":"When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in applications. The number of subtrees in the extremal cases constitute sequences which are of interest to number theorists. The structures which maximize or minimize the number of subtrees among general trees, binary trees and trees with a given maximum degree have been identified previously. Most recently, results of this nature are generalized to trees with a giv"},"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":"1210.2871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-10T11:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"80f4878c9d43fe26aa538ee815ea87d79da33351a9ffca9f63d38262e5b41ad2","abstract_canon_sha256":"409ef629aadda597c1988f1b2aabc5246d9a45068196708b4f58c13aec654995"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:31.321402Z","signature_b64":"J9uI4MeOma1eSNmyy+mUYue1ARwSLtXx2xJSWjFtj3eh19XEdGTi38xHo0C0AJSLkxgFqos8ex+enMXE/64lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d9774b1a4948b49cf094d7fded0aa309b2dbef3c06a0e5b4a4bfd517a56469","last_reissued_at":"2026-05-18T03:43:31.320695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:31.320695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees with the most subtrees -- an algorithmic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Gray, Hua Wang, Xiao-Dong Zhang, Xiu-Mei Zhang","submitted_at":"2012-10-10T11:10:34Z","abstract_excerpt":"When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in applications. The number of subtrees in the extremal cases constitute sequences which are of interest to number theorists. The structures which maximize or minimize the number of subtrees among general trees, binary trees and trees with a given maximum degree have been identified previously. Most recently, results of this nature are generalized to trees with a giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2871","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":"1210.2871","created_at":"2026-05-18T03:43:31.320796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2871v1","created_at":"2026-05-18T03:43:31.320796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2871","created_at":"2026-05-18T03:43:31.320796+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTMXOSY2JFEL","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTMXOSY2JFELJHHQ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTMXOSY2","created_at":"2026-05-18T12:27:27.928770+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/WTMXOSY2JFELJHHQSTL733IKUM","json":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM.json","graph_json":"https://pith.science/api/pith-number/WTMXOSY2JFELJHHQSTL733IKUM/graph.json","events_json":"https://pith.science/api/pith-number/WTMXOSY2JFELJHHQSTL733IKUM/events.json","paper":"https://pith.science/paper/WTMXOSY2"},"agent_actions":{"view_html":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM","download_json":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM.json","view_paper":"https://pith.science/paper/WTMXOSY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2871&json=true","fetch_graph":"https://pith.science/api/pith-number/WTMXOSY2JFELJHHQSTL733IKUM/graph.json","fetch_events":"https://pith.science/api/pith-number/WTMXOSY2JFELJHHQSTL733IKUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM/action/storage_attestation","attest_author":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM/action/author_attestation","sign_citation":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM/action/citation_signature","submit_replication":"https://pith.science/pith/WTMXOSY2JFELJHHQSTL733IKUM/action/replication_record"}},"created_at":"2026-05-18T03:43:31.320796+00:00","updated_at":"2026-05-18T03:43:31.320796+00:00"}