{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:VXWBF6JMHIHGORNF66SLO7FLIO","short_pith_number":"pith:VXWBF6JM","schema_version":"1.0","canonical_sha256":"adec12f92c3a0e6745a5f7a4b77cab439f1ec0a632705f60219719596164b31e","source":{"kind":"arxiv","id":"math/0507497","version":1},"attestation_state":"computed","paper":{"title":"A refinement of Cayley's formula for trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Seunghyun Seo","submitted_at":"2005-07-24T19:20:52Z","abstract_excerpt":"A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all expressed in terms of the polynomials P_n(a,b,c)= c(a+(n-1)b+c)(2a+(n-2)b+c)...((n-1)a+b+c) which reduce to (n+1)^{n-1} for a=b=c=1.\n  Our study of proper vertices was motivated by A. Postnikov's hook length formula for binary trees (arXiv:math.CO/0507163), which was also proved by W. Y. C. Chen and L. L. M. Yang (arXiv:math.CO/0507163) and generalized by R. R. X."},"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":"math/0507497","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-07-24T19:20:52Z","cross_cats_sorted":[],"title_canon_sha256":"694fbd2cd52468e1d18021ab97a9cea479a0fa3139fba1292cf5f29639877312","abstract_canon_sha256":"60cbf21e8d2f440b0052a866ba7a5930518dc3c5e241abbcbb0f090a2e07532a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:16.819012Z","signature_b64":"q+zSUuIioqOnzzOc4gCyx/KNsYe0HTYL6JhJGU1UV+uQgtc9may8Zl5HDTEkMvSFL9thtQwn0raHXktdXR+bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adec12f92c3a0e6745a5f7a4b77cab439f1ec0a632705f60219719596164b31e","last_reissued_at":"2026-05-18T03:29:16.818500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:16.818500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A refinement of Cayley's formula for trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Seunghyun Seo","submitted_at":"2005-07-24T19:20:52Z","abstract_excerpt":"A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all expressed in terms of the polynomials P_n(a,b,c)= c(a+(n-1)b+c)(2a+(n-2)b+c)...((n-1)a+b+c) which reduce to (n+1)^{n-1} for a=b=c=1.\n  Our study of proper vertices was motivated by A. Postnikov's hook length formula for binary trees (arXiv:math.CO/0507163), which was also proved by W. Y. C. Chen and L. L. M. Yang (arXiv:math.CO/0507163) and generalized by R. R. X."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507497","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":"math/0507497","created_at":"2026-05-18T03:29:16.818582+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0507497v1","created_at":"2026-05-18T03:29:16.818582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507497","created_at":"2026-05-18T03:29:16.818582+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXWBF6JMHIHG","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXWBF6JMHIHGORNF","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXWBF6JM","created_at":"2026-05-18T12:25:53.939244+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/VXWBF6JMHIHGORNF66SLO7FLIO","json":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO.json","graph_json":"https://pith.science/api/pith-number/VXWBF6JMHIHGORNF66SLO7FLIO/graph.json","events_json":"https://pith.science/api/pith-number/VXWBF6JMHIHGORNF66SLO7FLIO/events.json","paper":"https://pith.science/paper/VXWBF6JM"},"agent_actions":{"view_html":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO","download_json":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO.json","view_paper":"https://pith.science/paper/VXWBF6JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0507497&json=true","fetch_graph":"https://pith.science/api/pith-number/VXWBF6JMHIHGORNF66SLO7FLIO/graph.json","fetch_events":"https://pith.science/api/pith-number/VXWBF6JMHIHGORNF66SLO7FLIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO/action/storage_attestation","attest_author":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO/action/author_attestation","sign_citation":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO/action/citation_signature","submit_replication":"https://pith.science/pith/VXWBF6JMHIHGORNF66SLO7FLIO/action/replication_record"}},"created_at":"2026-05-18T03:29:16.818582+00:00","updated_at":"2026-05-18T03:29:16.818582+00:00"}