{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:XL74BWUPANFC2DRWE3YXGTWVWI","short_pith_number":"pith:XL74BWUP","schema_version":"1.0","canonical_sha256":"baffc0da8f034a2d0e3626f1734ed5b230ab0cb4dc8794b4fa17de626f4a3534","source":{"kind":"arxiv","id":"math/0409554","version":1},"attestation_state":"computed","paper":{"title":"Expectations of hook products on large partitions","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Alexei Borodin, Mark Adler, Pierre van Moerbeke","submitted_at":"2004-09-28T15:39:48Z","abstract_excerpt":"Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word\n (i) contains a subsequence of letters (p, p-1,...,1) in that order and\n (ii) that the maximal length of the disjoint union of p-1 increasing subsequences of the word is \\leq M-N . A generating function for this probability has the form of an integral over the Grassmannian of p-planes in complex C^n. The present paper shows that the asymptotics of this probability, when N tends to infinity, is related to the kth moment of the chi^2-distribution of parameter 2p^2. This is relate"},"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/0409554","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-09-28T15:39:48Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"dec4a797d70328aac328c0d540613b261b9214fbdee17ce948e5e7d4267646f7","abstract_canon_sha256":"cc6ffb05c7050ac92cdb38c98d15f59a0195b5fc4b42c613d23bb5720911291b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:25.946901Z","signature_b64":"Irq8kduescqtODeqCQylTf7yWBZSHTft1KYiXYkkp4KpDhbsiTNKw2z9K2pin4Izu40XrdHiGW+yahUbMecRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baffc0da8f034a2d0e3626f1734ed5b230ab0cb4dc8794b4fa17de626f4a3534","last_reissued_at":"2026-05-18T01:05:25.946182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:25.946182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expectations of hook products on large partitions","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Alexei Borodin, Mark Adler, Pierre van Moerbeke","submitted_at":"2004-09-28T15:39:48Z","abstract_excerpt":"Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word\n (i) contains a subsequence of letters (p, p-1,...,1) in that order and\n (ii) that the maximal length of the disjoint union of p-1 increasing subsequences of the word is \\leq M-N . A generating function for this probability has the form of an integral over the Grassmannian of p-planes in complex C^n. The present paper shows that the asymptotics of this probability, when N tends to infinity, is related to the kth moment of the chi^2-distribution of parameter 2p^2. This is relate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0409554","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/0409554","created_at":"2026-05-18T01:05:25.946298+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0409554v1","created_at":"2026-05-18T01:05:25.946298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0409554","created_at":"2026-05-18T01:05:25.946298+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL74BWUPANFC","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL74BWUPANFC2DRW","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL74BWUP","created_at":"2026-05-18T12:25:52.687210+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/XL74BWUPANFC2DRWE3YXGTWVWI","json":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI.json","graph_json":"https://pith.science/api/pith-number/XL74BWUPANFC2DRWE3YXGTWVWI/graph.json","events_json":"https://pith.science/api/pith-number/XL74BWUPANFC2DRWE3YXGTWVWI/events.json","paper":"https://pith.science/paper/XL74BWUP"},"agent_actions":{"view_html":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI","download_json":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI.json","view_paper":"https://pith.science/paper/XL74BWUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0409554&json=true","fetch_graph":"https://pith.science/api/pith-number/XL74BWUPANFC2DRWE3YXGTWVWI/graph.json","fetch_events":"https://pith.science/api/pith-number/XL74BWUPANFC2DRWE3YXGTWVWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI/action/storage_attestation","attest_author":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI/action/author_attestation","sign_citation":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI/action/citation_signature","submit_replication":"https://pith.science/pith/XL74BWUPANFC2DRWE3YXGTWVWI/action/replication_record"}},"created_at":"2026-05-18T01:05:25.946298+00:00","updated_at":"2026-05-18T01:05:25.946298+00:00"}