{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UGVCDTGHJFEPHPKYIQ72Q7VKCS","short_pith_number":"pith:UGVCDTGH","schema_version":"1.0","canonical_sha256":"a1aa21ccc74948f3bd58443fa87eaa14b16d93c2e404b828e29a80022cbffc80","source":{"kind":"arxiv","id":"2105.13750","version":1},"attestation_state":"computed","paper":{"title":"A Refinement of the Murnaghan-Nakayama Rule by Descents for Border Strip Tableaux","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stephan Pfannerer","submitted_at":"2021-05-28T11:36:28Z","abstract_excerpt":"Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields the number of border strip tableaux with all strips of size $k$, up to sign. This is essentially the special case of the Murnaghan-Nakayama rule for evaluating an irreducible character of the symmetric group at a rectangular partition.\n  We refine this result to standard Young tableaux and border strip tableaux with a given number of descents. To do so, we in"},"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":"2105.13750","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-28T11:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"d8465b701316be7a7bc32b0289658200783282a3f821627eee64bbe7e8a0b5fe","abstract_canon_sha256":"10026deab8e910955667f1c689040c61d35c12f57343e896a45dfbe736b37c6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:11.097663Z","signature_b64":"J8I+Bx416GXeXaEIT/srx43N+HgU461Z6iJN1EqPSi8aMQbgbDYU93KPXJIQcrM4qAGy55XmapWkNhwKNjd4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1aa21ccc74948f3bd58443fa87eaa14b16d93c2e404b828e29a80022cbffc80","last_reissued_at":"2026-07-05T02:44:11.097306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:11.097306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Refinement of the Murnaghan-Nakayama Rule by Descents for Border Strip Tableaux","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stephan Pfannerer","submitted_at":"2021-05-28T11:36:28Z","abstract_excerpt":"Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields the number of border strip tableaux with all strips of size $k$, up to sign. This is essentially the special case of the Murnaghan-Nakayama rule for evaluating an irreducible character of the symmetric group at a rectangular partition.\n  We refine this result to standard Young tableaux and border strip tableaux with a given number of descents. To do so, we in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13750","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/2105.13750/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":"2105.13750","created_at":"2026-07-05T02:44:11.097377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.13750v1","created_at":"2026-07-05T02:44:11.097377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13750","created_at":"2026-07-05T02:44:11.097377+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGVCDTGHJFEP","created_at":"2026-07-05T02:44:11.097377+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGVCDTGHJFEPHPKY","created_at":"2026-07-05T02:44:11.097377+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGVCDTGH","created_at":"2026-07-05T02:44:11.097377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15514","citing_title":"AM-PPO: (Advantage) Alpha-Modulation with Proximal Policy Optimization","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS","json":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS.json","graph_json":"https://pith.science/api/pith-number/UGVCDTGHJFEPHPKYIQ72Q7VKCS/graph.json","events_json":"https://pith.science/api/pith-number/UGVCDTGHJFEPHPKYIQ72Q7VKCS/events.json","paper":"https://pith.science/paper/UGVCDTGH"},"agent_actions":{"view_html":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS","download_json":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS.json","view_paper":"https://pith.science/paper/UGVCDTGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.13750&json=true","fetch_graph":"https://pith.science/api/pith-number/UGVCDTGHJFEPHPKYIQ72Q7VKCS/graph.json","fetch_events":"https://pith.science/api/pith-number/UGVCDTGHJFEPHPKYIQ72Q7VKCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS/action/storage_attestation","attest_author":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS/action/author_attestation","sign_citation":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS/action/citation_signature","submit_replication":"https://pith.science/pith/UGVCDTGHJFEPHPKYIQ72Q7VKCS/action/replication_record"}},"created_at":"2026-07-05T02:44:11.097377+00:00","updated_at":"2026-07-05T02:44:11.097377+00:00"}