{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:52VNVKCTVNJS36AB3B4HVNSYZO","short_pith_number":"pith:52VNVKCT","schema_version":"1.0","canonical_sha256":"eeaadaa853ab532df801d8787ab658cbb81e2b4a52755b074578269d912e53fb","source":{"kind":"arxiv","id":"1209.0273","version":1},"attestation_state":"computed","paper":{"title":"Trees with given degree sequences that have minimal subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Dong Zhang, Xiu-Mei Zhang","submitted_at":"2012-09-03T08:49:07Z","abstract_excerpt":"In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence $\\pi=(d_1, ..., d_5, 1,..., 1)$ have been characterized."},"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":"1209.0273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-03T08:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"2b98e4a18502f1bc95de36940a358a3920c57e9fa0df9ca326531353238a783a","abstract_canon_sha256":"85dff320a9daf2e4b16d426cf0f6289621db1afaf0b7731e7da6eadf0b192235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:29.542911Z","signature_b64":"rK9QpYSfbkIULisTv2+mtT6l4hzwSsvjtA5JTbhnu/ZJzXgScdBM7ZwqyGaVLSoOBPhqyoMGS+YK4diaqp4MDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeaadaa853ab532df801d8787ab658cbb81e2b4a52755b074578269d912e53fb","last_reissued_at":"2026-05-18T03:46:29.541725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:29.541725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees with given degree sequences that have minimal subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Dong Zhang, Xiu-Mei Zhang","submitted_at":"2012-09-03T08:49:07Z","abstract_excerpt":"In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence $\\pi=(d_1, ..., d_5, 1,..., 1)$ have been characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0273","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":"1209.0273","created_at":"2026-05-18T03:46:29.541991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0273v1","created_at":"2026-05-18T03:46:29.541991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0273","created_at":"2026-05-18T03:46:29.541991+00:00"},{"alias_kind":"pith_short_12","alias_value":"52VNVKCTVNJS","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"52VNVKCTVNJS36AB","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"52VNVKCT","created_at":"2026-05-18T12:26:53.410803+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/52VNVKCTVNJS36AB3B4HVNSYZO","json":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO.json","graph_json":"https://pith.science/api/pith-number/52VNVKCTVNJS36AB3B4HVNSYZO/graph.json","events_json":"https://pith.science/api/pith-number/52VNVKCTVNJS36AB3B4HVNSYZO/events.json","paper":"https://pith.science/paper/52VNVKCT"},"agent_actions":{"view_html":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO","download_json":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO.json","view_paper":"https://pith.science/paper/52VNVKCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0273&json=true","fetch_graph":"https://pith.science/api/pith-number/52VNVKCTVNJS36AB3B4HVNSYZO/graph.json","fetch_events":"https://pith.science/api/pith-number/52VNVKCTVNJS36AB3B4HVNSYZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO/action/storage_attestation","attest_author":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO/action/author_attestation","sign_citation":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO/action/citation_signature","submit_replication":"https://pith.science/pith/52VNVKCTVNJS36AB3B4HVNSYZO/action/replication_record"}},"created_at":"2026-05-18T03:46:29.541991+00:00","updated_at":"2026-05-18T03:46:29.541991+00:00"}