{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KP7DQECYKDKFQYMJG3VHH7EYH4","short_pith_number":"pith:KP7DQECY","schema_version":"1.0","canonical_sha256":"53fe38105850d458618936ea73fc983f35308aeee7670955b22ecfc39e8a3ad7","source":{"kind":"arxiv","id":"1702.01744","version":1},"attestation_state":"computed","paper":{"title":"A recursive algorithm for trees and forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Song Guo, Victor J. W. Guo","submitted_at":"2017-02-06T11:47:19Z","abstract_excerpt":"Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations."},"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":"1702.01744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-06T11:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"6157502c3c9883e39389e00ec9f0d987fdfb6f5a1740bb1ec7fe46807b92a464","abstract_canon_sha256":"af37714e89da1fd5acbbd5d14ace71bc22bd953138ed2369baf4de980571869f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:11.385281Z","signature_b64":"ytJQNB7T75YCVeR7LcgVVd0cNxGAW7QXdeYzM7y+GGiV1nXlBRzn8o5AeLYi+g6rMQnlrhIrC23+h3QIr65hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53fe38105850d458618936ea73fc983f35308aeee7670955b22ecfc39e8a3ad7","last_reissued_at":"2026-05-18T00:51:11.384456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:11.384456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A recursive algorithm for trees and forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Song Guo, Victor J. W. Guo","submitted_at":"2017-02-06T11:47:19Z","abstract_excerpt":"Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01744","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":"1702.01744","created_at":"2026-05-18T00:51:11.384604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01744v1","created_at":"2026-05-18T00:51:11.384604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01744","created_at":"2026-05-18T00:51:11.384604+00:00"},{"alias_kind":"pith_short_12","alias_value":"KP7DQECYKDKF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KP7DQECYKDKFQYMJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KP7DQECY","created_at":"2026-05-18T12:31:24.725408+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/KP7DQECYKDKFQYMJG3VHH7EYH4","json":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4.json","graph_json":"https://pith.science/api/pith-number/KP7DQECYKDKFQYMJG3VHH7EYH4/graph.json","events_json":"https://pith.science/api/pith-number/KP7DQECYKDKFQYMJG3VHH7EYH4/events.json","paper":"https://pith.science/paper/KP7DQECY"},"agent_actions":{"view_html":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4","download_json":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4.json","view_paper":"https://pith.science/paper/KP7DQECY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01744&json=true","fetch_graph":"https://pith.science/api/pith-number/KP7DQECYKDKFQYMJG3VHH7EYH4/graph.json","fetch_events":"https://pith.science/api/pith-number/KP7DQECYKDKFQYMJG3VHH7EYH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4/action/storage_attestation","attest_author":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4/action/author_attestation","sign_citation":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4/action/citation_signature","submit_replication":"https://pith.science/pith/KP7DQECYKDKFQYMJG3VHH7EYH4/action/replication_record"}},"created_at":"2026-05-18T00:51:11.384604+00:00","updated_at":"2026-05-18T00:51:11.384604+00:00"}