{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:AVQOVLGJUBRLPI7ZXWHIZPUH25","short_pith_number":"pith:AVQOVLGJ","schema_version":"1.0","canonical_sha256":"0560eaacc9a062b7a3f9bd8e8cbe87d74734c045deee464488d2ed4b768e7e8c","source":{"kind":"arxiv","id":"quant-ph/0304153","version":3},"attestation_state":"computed","paper":{"title":"Permutationally Invariant Codes for Quantum Error Correction","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harriet Pollatsek, Mary Beth Ruskai","submitted_at":"2003-04-24T13:13:05Z","abstract_excerpt":"A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible representations, both those of higher dimension and orthogonal bases for the trivial representation, are available for error correction.\n  A number of new (non-additive) binary codes are obtained, including two new 7-bit codes and a large family of new 9-bit codes. It is shown that the degeneracy arising from permutational symmetry facilitates the correction of certain t"},"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":"quant-ph/0304153","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-04-24T13:13:05Z","cross_cats_sorted":[],"title_canon_sha256":"9808c7de9261c5d57ed6e1636201df2aaa3d813aa36039aef7597ba653fd0a65","abstract_canon_sha256":"19a38362f56d5d4486c53affd997895e9d951770f07812ffa5398c47e7463577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:10.266665Z","signature_b64":"/KXN5ZuTyZhQU3IFqpT7imsfka+qn6Q48J0mhCGVcNeqb29mvIsgJLkw30GX947unyGcVD5feWSPWH1dHy30Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0560eaacc9a062b7a3f9bd8e8cbe87d74734c045deee464488d2ed4b768e7e8c","last_reissued_at":"2026-07-04T14:46:10.266323Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:10.266323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutationally Invariant Codes for Quantum Error Correction","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harriet Pollatsek, Mary Beth Ruskai","submitted_at":"2003-04-24T13:13:05Z","abstract_excerpt":"A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible representations, both those of higher dimension and orthogonal bases for the trivial representation, are available for error correction.\n  A number of new (non-additive) binary codes are obtained, including two new 7-bit codes and a large family of new 9-bit codes. It is shown that the degeneracy arising from permutational symmetry facilitates the correction of certain t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0304153","kind":"arxiv","version":3},"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/quant-ph/0304153/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":"quant-ph/0304153","created_at":"2026-07-04T14:46:10.266379+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0304153v3","created_at":"2026-07-04T14:46:10.266379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0304153","created_at":"2026-07-04T14:46:10.266379+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVQOVLGJUBRL","created_at":"2026-07-04T14:46:10.266379+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVQOVLGJUBRLPI7Z","created_at":"2026-07-04T14:46:10.266379+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVQOVLGJ","created_at":"2026-07-04T14:46:10.266379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03413","citing_title":"An angular momentum approach to quantum insertion errors","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25","json":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25.json","graph_json":"https://pith.science/api/pith-number/AVQOVLGJUBRLPI7ZXWHIZPUH25/graph.json","events_json":"https://pith.science/api/pith-number/AVQOVLGJUBRLPI7ZXWHIZPUH25/events.json","paper":"https://pith.science/paper/AVQOVLGJ"},"agent_actions":{"view_html":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25","download_json":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25.json","view_paper":"https://pith.science/paper/AVQOVLGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0304153&json=true","fetch_graph":"https://pith.science/api/pith-number/AVQOVLGJUBRLPI7ZXWHIZPUH25/graph.json","fetch_events":"https://pith.science/api/pith-number/AVQOVLGJUBRLPI7ZXWHIZPUH25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25/action/storage_attestation","attest_author":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25/action/author_attestation","sign_citation":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25/action/citation_signature","submit_replication":"https://pith.science/pith/AVQOVLGJUBRLPI7ZXWHIZPUH25/action/replication_record"}},"created_at":"2026-07-04T14:46:10.266379+00:00","updated_at":"2026-07-04T14:46:10.266379+00:00"}