{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:76NUIRQ3WT7QEROO2GAWR5VC7A","short_pith_number":"pith:76NUIRQ3","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"},"canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","source":{"kind":"arxiv","id":"2501.12579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12579","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12579v2","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12579","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"76NUIRQ3WT7Q","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_16","alias_value":"76NUIRQ3WT7QEROO","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_8","alias_value":"76NUIRQ3","created_at":"2026-07-05T10:16:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:76NUIRQ3WT7QEROO2GAWR5VC7A","target":"record","payload":{"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"},"canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","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"},"source_kind":"arxiv","source_id":"2501.12579","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91ql4wdMcmolHbKXGSW2JiVTUX9YdZEl+aFMx1F/jYhp9xXuKs1LOG0U008/E9Ji69CvdzrgThkx28wPKzlSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:47:17.470285Z"},"content_sha256":"021324efb214920244a14bbade7bb83d99187dccc5653f75a54a64f1773f03fd","schema_version":"1.0","event_id":"sha256:021324efb214920244a14bbade7bb83d99187dccc5653f75a54a64f1773f03fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:76NUIRQ3WT7QEROO2GAWR5VC7A","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqGF/yywgsDQgONqA0rENdT6tZRdlWEHTvKA7Hf+OYGaY369QmMye/nTJiX05zxUKm5BFBNBNV4lqn0SLW5+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:47:17.470954Z"},"content_sha256":"28662c03494c51a4ab9d79c080f9fbdbd7e278900d3e0d45d5b8368a247aa03d","schema_version":"1.0","event_id":"sha256:28662c03494c51a4ab9d79c080f9fbdbd7e278900d3e0d45d5b8368a247aa03d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/bundle.json","state_url":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T11:47:17Z","links":{"resolver":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A","bundle":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/bundle.json","state":"https://pith.science/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76NUIRQ3WT7QEROO2GAWR5VC7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:76NUIRQ3WT7QEROO2GAWR5VC7A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6583369ac4a1ba11fa23ea810f87d9524ca61a31fe96acc977ae32d2052b7965","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T01:55:28Z","title_canon_sha256":"58905ff09193abbe4e181e8f827450effe48bfecdf8d230a6efc07a75d68bb0d"},"schema_version":"1.0","source":{"id":"2501.12579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12579","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12579v2","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12579","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"76NUIRQ3WT7Q","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_16","alias_value":"76NUIRQ3WT7QEROO","created_at":"2026-07-05T10:16:41Z"},{"alias_kind":"pith_short_8","alias_value":"76NUIRQ3","created_at":"2026-07-05T10:16:41Z"}],"graph_snapshots":[{"event_id":"sha256:28662c03494c51a4ab9d79c080f9fbdbd7e278900d3e0d45d5b8368a247aa03d","target":"graph","created_at":"2026-07-05T10:16:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.12579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Gosset, Louis Schatzki, Sergey Bravyi, Vojtech Havlicek","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T01:55:28Z","title":"Classical and quantum algorithms for characters of the symmetric group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12579","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:021324efb214920244a14bbade7bb83d99187dccc5653f75a54a64f1773f03fd","target":"record","created_at":"2026-07-05T10:16:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6583369ac4a1ba11fa23ea810f87d9524ca61a31fe96acc977ae32d2052b7965","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-22T01:55:28Z","title_canon_sha256":"58905ff09193abbe4e181e8f827450effe48bfecdf8d230a6efc07a75d68bb0d"},"schema_version":"1.0","source":{"id":"2501.12579","kind":"arxiv","version":2}},"canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9b44461bb4ff0245ced18168f6a2f836e2f5e028bb36b1c8c6d7a39e2b71f0","first_computed_at":"2026-07-05T10:16:41.023049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:41.023049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JW26QypLkiDR68nT2B3jcgm4gdOfUcmUnoSPvj9OyfgnpCtLc4H5V3DQ2E+BXPxzQePHA53Br3Vkh1bouXWvAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:41.023461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:021324efb214920244a14bbade7bb83d99187dccc5653f75a54a64f1773f03fd","sha256:28662c03494c51a4ab9d79c080f9fbdbd7e278900d3e0d45d5b8368a247aa03d"],"state_sha256":"b714665bd36b5f6f298bc97210614b77127f2032686ba0531b999be9e7e71f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n7oq/T3YHI0D6GWrLPKxSyxaMtflhI37/6Ilrz50/9T5kYw0Ad7OhDkXqiCBMCONmEQfvR1u20/ZKYQ4rG6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:47:17.477743Z","bundle_sha256":"00c45f6abbec4e36abb5a1409c11d03257290334f3ef69f55d210f26183507df"}}