{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R37XHMNT6CIXYRRCCGJV4QWYI4","short_pith_number":"pith:R37XHMNT","schema_version":"1.0","canonical_sha256":"8eff73b1b3f0917c462211935e42d8471cd08e8f0a8a74e4b7576b85072ec5bd","source":{"kind":"arxiv","id":"2503.12735","version":2},"attestation_state":"computed","paper":{"title":"Sharp character bounds and cutoff for symmetric groups","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CO","math.GR","math.PR"],"primary_cat":"math.RT","authors_text":"Lucas Teyssier, Paul Th\\'evenin, Sam Olesker-Taylor","submitted_at":"2025-03-17T02:01:45Z","abstract_excerpt":"We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character bound with optimal constant $1/2$. We furthermore prove sharp character bounds for conjugacy classes having a macroscopic number of fixed points, and deduce that the random walks on the associated Cayley graphs exhibit a total variation and $L^2$ cutoff."},"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":"2503.12735","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.RT","submitted_at":"2025-03-17T02:01:45Z","cross_cats_sorted":["math.CO","math.GR","math.PR"],"title_canon_sha256":"b9f7ff3d2c04a703f4b2c0c7705588ab5ec4aefd9a3daaecd9a451c02cee48ca","abstract_canon_sha256":"8c08ce31aeadfb8f2953d2c072a8596c25e4b3947ff946486c18e9a4f4656347"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:20.383535Z","signature_b64":"zmfWXFv3U2P3l7IzIhuIrbEuCHylLABBgfOQ6VULlE2y+VmF4HgiN4gzTaPXaMVDX/NY9e5cmx2xa6AWdsFeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eff73b1b3f0917c462211935e42d8471cd08e8f0a8a74e4b7576b85072ec5bd","last_reissued_at":"2026-07-05T11:47:20.383025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:20.383025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp character bounds and cutoff for symmetric groups","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CO","math.GR","math.PR"],"primary_cat":"math.RT","authors_text":"Lucas Teyssier, Paul Th\\'evenin, Sam Olesker-Taylor","submitted_at":"2025-03-17T02:01:45Z","abstract_excerpt":"We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character bound with optimal constant $1/2$. We furthermore prove sharp character bounds for conjugacy classes having a macroscopic number of fixed points, and deduce that the random walks on the associated Cayley graphs exhibit a total variation and $L^2$ cutoff."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12735","kind":"arxiv","version":2},"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/2503.12735/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":"2503.12735","created_at":"2026-07-05T11:47:20.383085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.12735v2","created_at":"2026-07-05T11:47:20.383085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12735","created_at":"2026-07-05T11:47:20.383085+00:00"},{"alias_kind":"pith_short_12","alias_value":"R37XHMNT6CIX","created_at":"2026-07-05T11:47:20.383085+00:00"},{"alias_kind":"pith_short_16","alias_value":"R37XHMNT6CIXYRRC","created_at":"2026-07-05T11:47:20.383085+00:00"},{"alias_kind":"pith_short_8","alias_value":"R37XHMNT","created_at":"2026-07-05T11:47:20.383085+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28770","citing_title":"Cutoff profiles for conjugacy invariant random walks on symmetric groups","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2601.18559","citing_title":"Brownian motion on reflection quantum groups. Construction and cutoff","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23890","citing_title":"The Cutoff Profile for Random Transpositions on Repeated Cards in the Full Range of Parameters","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4","json":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4.json","graph_json":"https://pith.science/api/pith-number/R37XHMNT6CIXYRRCCGJV4QWYI4/graph.json","events_json":"https://pith.science/api/pith-number/R37XHMNT6CIXYRRCCGJV4QWYI4/events.json","paper":"https://pith.science/paper/R37XHMNT"},"agent_actions":{"view_html":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4","download_json":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4.json","view_paper":"https://pith.science/paper/R37XHMNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.12735&json=true","fetch_graph":"https://pith.science/api/pith-number/R37XHMNT6CIXYRRCCGJV4QWYI4/graph.json","fetch_events":"https://pith.science/api/pith-number/R37XHMNT6CIXYRRCCGJV4QWYI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4/action/storage_attestation","attest_author":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4/action/author_attestation","sign_citation":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4/action/citation_signature","submit_replication":"https://pith.science/pith/R37XHMNT6CIXYRRCCGJV4QWYI4/action/replication_record"}},"created_at":"2026-07-05T11:47:20.383085+00:00","updated_at":"2026-07-05T11:47:20.383085+00:00"}