{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:IPZENYRDK4CV5NPGBGQUV42LJ2","short_pith_number":"pith:IPZENYRD","schema_version":"1.0","canonical_sha256":"43f246e22357055eb5e609a14af34b4e8b7eff4560f39a61c9d3f6747e02ab0e","source":{"kind":"arxiv","id":"0804.4716","version":1},"attestation_state":"computed","paper":{"title":"On Combinatorial Formulas for Macdonald Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Cristian Lenart","submitted_at":"2008-04-30T13:15:00Z","abstract_excerpt":"A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, whi"},"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":"0804.4716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-04-30T13:15:00Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"e906931b87a9e9505e0da75a9fa9ff1f2036a414733ae9e9c7c11ca6b47cb660","abstract_canon_sha256":"c5064e9e02e703da4e71485a2ef4d32cf898dc1d984a4436dcad655fe737f022"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:15.269507Z","signature_b64":"ErLyCRtGWCT01nZTWAIuM7L2bMMEnj4R6kGsvdNXr7ue27hecUaQ0zhmagmZLTWwmIHFN1anyhRh8klWG+G4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43f246e22357055eb5e609a14af34b4e8b7eff4560f39a61c9d3f6747e02ab0e","last_reissued_at":"2026-07-04T15:11:15.269119Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:15.269119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Combinatorial Formulas for Macdonald Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.CO","authors_text":"Cristian Lenart","submitted_at":"2008-04-30T13:15:00Z","abstract_excerpt":"A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0804.4716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0804.4716","created_at":"2026-07-04T15:11:15.269185+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.4716v1","created_at":"2026-07-04T15:11:15.269185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4716","created_at":"2026-07-04T15:11:15.269185+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPZENYRDK4CV","created_at":"2026-07-04T15:11:15.269185+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPZENYRDK4CV5NPG","created_at":"2026-07-04T15:11:15.269185+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPZENYRD","created_at":"2026-07-04T15:11:15.269185+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.02810","citing_title":"Formulas for Koornwinder polynomials","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2","json":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2.json","graph_json":"https://pith.science/api/pith-number/IPZENYRDK4CV5NPGBGQUV42LJ2/graph.json","events_json":"https://pith.science/api/pith-number/IPZENYRDK4CV5NPGBGQUV42LJ2/events.json","paper":"https://pith.science/paper/IPZENYRD"},"agent_actions":{"view_html":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2","download_json":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2.json","view_paper":"https://pith.science/paper/IPZENYRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.4716&json=true","fetch_graph":"https://pith.science/api/pith-number/IPZENYRDK4CV5NPGBGQUV42LJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/IPZENYRDK4CV5NPGBGQUV42LJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2/action/storage_attestation","attest_author":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2/action/author_attestation","sign_citation":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2/action/citation_signature","submit_replication":"https://pith.science/pith/IPZENYRDK4CV5NPGBGQUV42LJ2/action/replication_record"}},"created_at":"2026-07-04T15:11:15.269185+00:00","updated_at":"2026-07-04T15:11:15.269185+00:00"}