{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J7N6XZ5PFG5R3TJRHFDORDFI3V","short_pith_number":"pith:J7N6XZ5P","schema_version":"1.0","canonical_sha256":"4fdbebe7af29bb1dcd313946e88ca8dd7256272110128acce4e3b918077a4d07","source":{"kind":"arxiv","id":"1104.5435","version":3},"attestation_state":"computed","paper":{"title":"A multiset hook length formula and some applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guo-Niu Han, Paul-Olivier Dehaye","submitted_at":"2011-04-28T16:18:38Z","abstract_excerpt":"A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir, Raza and Saleem, who have made use of the cyclic symmetry of the topological vertex. A multiset hook-content formula is also proved."},"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":"1104.5435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-28T16:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"d7b5b16449747b3ad1f03f8e6617ebc36420f44819a2ddeddcbfed0bd2113790","abstract_canon_sha256":"3ce679022ec6440a44a73379e57a023802df5b611e5a5ab1b5d260a0190f71cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:39.654482Z","signature_b64":"g+ck6XVmw6tlBJ8ysgRkmkoO4MpfAYBEFE78PJcG13Dw1DqcBL37bytB8bM+8K7hwmVRKxSCupYGQe4pn71zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fdbebe7af29bb1dcd313946e88ca8dd7256272110128acce4e3b918077a4d07","last_reissued_at":"2026-05-18T04:22:39.654053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:39.654053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A multiset hook length formula and some applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guo-Niu Han, Paul-Olivier Dehaye","submitted_at":"2011-04-28T16:18:38Z","abstract_excerpt":"A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir, Raza and Saleem, who have made use of the cyclic symmetry of the topological vertex. A multiset hook-content formula is also proved."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5435","kind":"arxiv","version":3},"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":"1104.5435","created_at":"2026-05-18T04:22:39.654118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5435v3","created_at":"2026-05-18T04:22:39.654118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5435","created_at":"2026-05-18T04:22:39.654118+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7N6XZ5PFG5R","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7N6XZ5PFG5R3TJR","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7N6XZ5P","created_at":"2026-05-18T12:26:32.869790+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/J7N6XZ5PFG5R3TJRHFDORDFI3V","json":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V.json","graph_json":"https://pith.science/api/pith-number/J7N6XZ5PFG5R3TJRHFDORDFI3V/graph.json","events_json":"https://pith.science/api/pith-number/J7N6XZ5PFG5R3TJRHFDORDFI3V/events.json","paper":"https://pith.science/paper/J7N6XZ5P"},"agent_actions":{"view_html":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V","download_json":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V.json","view_paper":"https://pith.science/paper/J7N6XZ5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5435&json=true","fetch_graph":"https://pith.science/api/pith-number/J7N6XZ5PFG5R3TJRHFDORDFI3V/graph.json","fetch_events":"https://pith.science/api/pith-number/J7N6XZ5PFG5R3TJRHFDORDFI3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V/action/storage_attestation","attest_author":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V/action/author_attestation","sign_citation":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V/action/citation_signature","submit_replication":"https://pith.science/pith/J7N6XZ5PFG5R3TJRHFDORDFI3V/action/replication_record"}},"created_at":"2026-05-18T04:22:39.654118+00:00","updated_at":"2026-05-18T04:22:39.654118+00:00"}