{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:76NUIRQ3WT7QEROO2GAWR5VC7A","short_pith_number":"pith:76NUIRQ3","schema_version":"1.0","canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","source":{"kind":"arxiv","id":"2501.12579","version":2},"attestation_state":"computed","paper":{"title":"Classical and quantum algorithms for characters of the symmetric group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Louis Schatzki, Sergey Bravyi, Vojtech Havlicek","submitted_at":"2025-01-22T01:55:28Z","abstract_excerpt":"Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group $S_n$ is a challenging problem known to be $\\#P$-hard in the worst case. Here we describe a Matrix Product State (MPS) algorithm for characters of $S_n$. The algorithm computes an MPS encoding all irreducible characters of a given permutation. It relies on a mapping from characters of $S_n$ to quantum spin chains proposed by Crichigno and Prakash. We also provide a simpler derivation of this mapping. We complement this result by presenting a $poly(n"},"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":"2501.12579","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T01:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"58905ff09193abbe4e181e8f827450effe48bfecdf8d230a6efc07a75d68bb0d","abstract_canon_sha256":"6583369ac4a1ba11fa23ea810f87d9524ca61a31fe96acc977ae32d2052b7965"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:41.023461Z","signature_b64":"JW26QypLkiDR68nT2B3jcgm4gdOfUcmUnoSPvj9OyfgnpCtLc4H5V3DQ2E+BXPxzQePHA53Br3Vkh1bouXWvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","last_reissued_at":"2026-07-05T10:16:41.023049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:41.023049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical and quantum algorithms for characters of the symmetric group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Louis Schatzki, Sergey Bravyi, Vojtech Havlicek","submitted_at":"2025-01-22T01:55:28Z","abstract_excerpt":"Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group $S_n$ is a challenging problem known to be $\\#P$-hard in the worst case. Here we describe a Matrix Product State (MPS) algorithm for characters of $S_n$. The algorithm computes an MPS encoding all irreducible characters of a given permutation. It relies on a mapping from characters of $S_n$ to quantum spin chains proposed by Crichigno and Prakash. We also provide a simpler derivation of this mapping. We complement this result by presenting a $poly(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12579","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/2501.12579/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":"2501.12579","created_at":"2026-07-05T10:16:41.023103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12579v2","created_at":"2026-07-05T10:16:41.023103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12579","created_at":"2026-07-05T10:16:41.023103+00:00"},{"alias_kind":"pith_short_12","alias_value":"76NUIRQ3WT7Q","created_at":"2026-07-05T10:16:41.023103+00:00"},{"alias_kind":"pith_short_16","alias_value":"76NUIRQ3WT7QEROO","created_at":"2026-07-05T10:16:41.023103+00:00"},{"alias_kind":"pith_short_8","alias_value":"76NUIRQ3","created_at":"2026-07-05T10:16:41.023103+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06384","citing_title":"Unitary matrix models, quantized symmetric functions and spin chain","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A","json":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A.json","graph_json":"https://pith.science/api/pith-number/76NUIRQ3WT7QEROO2GAWR5VC7A/graph.json","events_json":"https://pith.science/api/pith-number/76NUIRQ3WT7QEROO2GAWR5VC7A/events.json","paper":"https://pith.science/paper/76NUIRQ3"},"agent_actions":{"view_html":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A","download_json":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A.json","view_paper":"https://pith.science/paper/76NUIRQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12579&json=true","fetch_graph":"https://pith.science/api/pith-number/76NUIRQ3WT7QEROO2GAWR5VC7A/graph.json","fetch_events":"https://pith.science/api/pith-number/76NUIRQ3WT7QEROO2GAWR5VC7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/action/storage_attestation","attest_author":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/action/author_attestation","sign_citation":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/action/citation_signature","submit_replication":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/action/replication_record"}},"created_at":"2026-07-05T10:16:41.023103+00:00","updated_at":"2026-07-05T10:16:41.023103+00:00"}