{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UQULX4JV7WJGBU5LKHWNZXGA63","short_pith_number":"pith:UQULX4JV","schema_version":"1.0","canonical_sha256":"a428bbf135fd9260d3ab51ecdcdcc0f6c93614a75832b194a9d3f6e7e102d91e","source":{"kind":"arxiv","id":"1103.4068","version":1},"attestation_state":"computed","paper":{"title":"On Han's Hook Length Formulas for Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oliver X.Q. Gao, Peter L. Guo, William Y.C. Chen","submitted_at":"2011-03-21T16:19:22Z","abstract_excerpt":"Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give combinatorial proofs of Yang's formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees with staircase labelings."},"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":"1103.4068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-21T16:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"57632c0588cb008ab9adee9c74bf17b9f26fafd861e30a7be11576becfe3f9ee","abstract_canon_sha256":"bb71c244b460d2398cbc300b969b046901a33dcdcfcd295ad1ef3781e853107b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:21.878781Z","signature_b64":"v/fn19J/SIGO6qYZnuA1ofNnMdJdaIsp51pzprQohEykz8oYv8uNNJG/HnF9QwW0E5XqfLEtTpPsAuf/CpSgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a428bbf135fd9260d3ab51ecdcdcc0f6c93614a75832b194a9d3f6e7e102d91e","last_reissued_at":"2026-05-18T04:26:21.878345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:21.878345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Han's Hook Length Formulas for Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oliver X.Q. Gao, Peter L. Guo, William Y.C. Chen","submitted_at":"2011-03-21T16:19:22Z","abstract_excerpt":"Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give combinatorial proofs of Yang's formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees with staircase labelings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4068","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":"1103.4068","created_at":"2026-05-18T04:26:21.878405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4068v1","created_at":"2026-05-18T04:26:21.878405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4068","created_at":"2026-05-18T04:26:21.878405+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQULX4JV7WJG","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQULX4JV7WJGBU5L","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQULX4JV","created_at":"2026-05-18T12:26:42.757692+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/UQULX4JV7WJGBU5LKHWNZXGA63","json":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63.json","graph_json":"https://pith.science/api/pith-number/UQULX4JV7WJGBU5LKHWNZXGA63/graph.json","events_json":"https://pith.science/api/pith-number/UQULX4JV7WJGBU5LKHWNZXGA63/events.json","paper":"https://pith.science/paper/UQULX4JV"},"agent_actions":{"view_html":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63","download_json":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63.json","view_paper":"https://pith.science/paper/UQULX4JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4068&json=true","fetch_graph":"https://pith.science/api/pith-number/UQULX4JV7WJGBU5LKHWNZXGA63/graph.json","fetch_events":"https://pith.science/api/pith-number/UQULX4JV7WJGBU5LKHWNZXGA63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63/action/storage_attestation","attest_author":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63/action/author_attestation","sign_citation":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63/action/citation_signature","submit_replication":"https://pith.science/pith/UQULX4JV7WJGBU5LKHWNZXGA63/action/replication_record"}},"created_at":"2026-05-18T04:26:21.878405+00:00","updated_at":"2026-05-18T04:26:21.878405+00:00"}