{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZAB27UJTCZ3FG4ELNLFTRDRNMU","short_pith_number":"pith:ZAB27UJT","schema_version":"1.0","canonical_sha256":"c803afd133167653708b6acb388e2d651e76cfa2a7e7e5247cf5769c0caa0840","source":{"kind":"arxiv","id":"1707.00366","version":1},"attestation_state":"computed","paper":{"title":"On the $p'$-subgraph of the Young graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.RT","authors_text":"Eugenio Giannelli, Stacey Law, Stuart Martin","submitted_at":"2017-07-02T22:57:04Z","abstract_excerpt":"Let $p$ be a prime number. In this article we study the restriction to $\\mathfrak{S}_{n-1}$ of irreducible characters of degree coprime to $p$ of $\\mathfrak{S}_n$. In particular, we study the combinatorial properties of the subgraph $\\mathbb{Y}_{p'}$ of the Young graph $\\mathbb{Y}$. This is an extension to odd primes of the work done by Ayyer, Prasad and Spallone for $p=2$."},"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":"1707.00366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2017-07-02T22:57:04Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"efb3690577247585706e371b31cf313a166980debc464cccdda6695afb5b0b9a","abstract_canon_sha256":"2811bc4b8284c778fa73ed5985139a5e0169b6e7f57229f33466386c77886e2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.620402Z","signature_b64":"R/362R9YO0LM/7tyxUZo07ns+4sSoFUTjDFnHUnRBrv9gBG0wqkhc3fgLIaKHs9mY9R3ghgpSS7P67rdHUYpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c803afd133167653708b6acb388e2d651e76cfa2a7e7e5247cf5769c0caa0840","last_reissued_at":"2026-05-18T00:41:03.619768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.619768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $p'$-subgraph of the Young graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.RT","authors_text":"Eugenio Giannelli, Stacey Law, Stuart Martin","submitted_at":"2017-07-02T22:57:04Z","abstract_excerpt":"Let $p$ be a prime number. In this article we study the restriction to $\\mathfrak{S}_{n-1}$ of irreducible characters of degree coprime to $p$ of $\\mathfrak{S}_n$. In particular, we study the combinatorial properties of the subgraph $\\mathbb{Y}_{p'}$ of the Young graph $\\mathbb{Y}$. This is an extension to odd primes of the work done by Ayyer, Prasad and Spallone for $p=2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00366","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":"1707.00366","created_at":"2026-05-18T00:41:03.619874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00366v1","created_at":"2026-05-18T00:41:03.619874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00366","created_at":"2026-05-18T00:41:03.619874+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAB27UJTCZ3F","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAB27UJTCZ3FG4EL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAB27UJT","created_at":"2026-05-18T12:31:59.375834+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/ZAB27UJTCZ3FG4ELNLFTRDRNMU","json":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU.json","graph_json":"https://pith.science/api/pith-number/ZAB27UJTCZ3FG4ELNLFTRDRNMU/graph.json","events_json":"https://pith.science/api/pith-number/ZAB27UJTCZ3FG4ELNLFTRDRNMU/events.json","paper":"https://pith.science/paper/ZAB27UJT"},"agent_actions":{"view_html":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU","download_json":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU.json","view_paper":"https://pith.science/paper/ZAB27UJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00366&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAB27UJTCZ3FG4ELNLFTRDRNMU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAB27UJTCZ3FG4ELNLFTRDRNMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU/action/storage_attestation","attest_author":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU/action/author_attestation","sign_citation":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU/action/citation_signature","submit_replication":"https://pith.science/pith/ZAB27UJTCZ3FG4ELNLFTRDRNMU/action/replication_record"}},"created_at":"2026-05-18T00:41:03.619874+00:00","updated_at":"2026-05-18T00:41:03.619874+00:00"}