{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:VXWBF6JMHIHGORNF66SLO7FLIO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"60cbf21e8d2f440b0052a866ba7a5930518dc3c5e241abbcbb0f090a2e07532a","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-07-24T19:20:52Z","title_canon_sha256":"694fbd2cd52468e1d18021ab97a9cea479a0fa3139fba1292cf5f29639877312"},"schema_version":"1.0","source":{"id":"math/0507497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0507497","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"math/0507497v1","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507497","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"VXWBF6JMHIHG","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VXWBF6JMHIHGORNF","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VXWBF6JM","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:5b323c4595f5635e50bbdcadf1d6b25ab0e486836ec18a7b0113eaf523274dde","target":"graph","created_at":"2026-05-18T03:29:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ira M. Gessel, Seunghyun Seo","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-07-24T19:20:52Z","title":"A refinement of Cayley's formula for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507497","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b78dc87a9f5765c6f6cda6f5882833d91789a20b4eb1f45137c478b967cf7fe","target":"record","created_at":"2026-05-18T03:29:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"60cbf21e8d2f440b0052a866ba7a5930518dc3c5e241abbcbb0f090a2e07532a","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-07-24T19:20:52Z","title_canon_sha256":"694fbd2cd52468e1d18021ab97a9cea479a0fa3139fba1292cf5f29639877312"},"schema_version":"1.0","source":{"id":"math/0507497","kind":"arxiv","version":1}},"canonical_sha256":"adec12f92c3a0e6745a5f7a4b77cab439f1ec0a632705f60219719596164b31e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adec12f92c3a0e6745a5f7a4b77cab439f1ec0a632705f60219719596164b31e","first_computed_at":"2026-05-18T03:29:16.818500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:16.818500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q+zSUuIioqOnzzOc4gCyx/KNsYe0HTYL6JhJGU1UV+uQgtc9may8Zl5HDTEkMvSFL9thtQwn0raHXktdXR+bAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:16.819012Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0507497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b78dc87a9f5765c6f6cda6f5882833d91789a20b4eb1f45137c478b967cf7fe","sha256:5b323c4595f5635e50bbdcadf1d6b25ab0e486836ec18a7b0113eaf523274dde"],"state_sha256":"24012494aaa29656bb9e968dbe514b5648dd68a63b499f0f6b80bf8ce20e2ccb"}