{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:326C4443CZMZXW2WXGZRSLRSFE","short_pith_number":"pith:326C4443","schema_version":"1.0","canonical_sha256":"debc2e739b16599bdb56b9b3192e322928f58ceb2c22e19944c643cad6775ef9","source":{"kind":"arxiv","id":"2109.12735","version":1},"attestation_state":"computed","paper":{"title":"Investigations on Automorphism Groups of Quantum Stabilizer Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanson Hao","submitted_at":"2021-09-27T00:39:47Z","abstract_excerpt":"The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of stabilizer codes, beginning with the analogous notion from the theory of classical codes. Two weakenings of this concept, the weak automorphism group and Clifford-twisted automorphism group, are also discussed, along with many examples highlighting the possible relationships between the types of \"automorphism groups\". In particular, we construct an example "},"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":"2109.12735","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-09-27T00:39:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0661cf2486c6cebc95d9a4b9bd08509d1e3a51c93121d16128a9ab5f538fb39b","abstract_canon_sha256":"609e5d9f15991d314276462854d79fd6947658c5a8bb1aa331a850deefea8db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:36.002821Z","signature_b64":"HzKHA191fsCPjyk1M5axKo07q7hZNuf7r88ImjobYswwjcz0uyz0KcDeOGF2g2hy1P0mfXHI02CQ+DzLQUdxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debc2e739b16599bdb56b9b3192e322928f58ceb2c22e19944c643cad6775ef9","last_reissued_at":"2026-07-05T03:17:36.002404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:36.002404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Investigations on Automorphism Groups of Quantum Stabilizer Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanson Hao","submitted_at":"2021-09-27T00:39:47Z","abstract_excerpt":"The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of stabilizer codes, beginning with the analogous notion from the theory of classical codes. Two weakenings of this concept, the weak automorphism group and Clifford-twisted automorphism group, are also discussed, along with many examples highlighting the possible relationships between the types of \"automorphism groups\". In particular, we construct an example "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12735","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.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":"2109.12735","created_at":"2026-07-05T03:17:36.002469+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.12735v1","created_at":"2026-07-05T03:17:36.002469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12735","created_at":"2026-07-05T03:17:36.002469+00:00"},{"alias_kind":"pith_short_12","alias_value":"326C4443CZMZ","created_at":"2026-07-05T03:17:36.002469+00:00"},{"alias_kind":"pith_short_16","alias_value":"326C4443CZMZXW2W","created_at":"2026-07-05T03:17:36.002469+00:00"},{"alias_kind":"pith_short_8","alias_value":"326C4443","created_at":"2026-07-05T03:17:36.002469+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE","json":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE.json","graph_json":"https://pith.science/api/pith-number/326C4443CZMZXW2WXGZRSLRSFE/graph.json","events_json":"https://pith.science/api/pith-number/326C4443CZMZXW2WXGZRSLRSFE/events.json","paper":"https://pith.science/paper/326C4443"},"agent_actions":{"view_html":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE","download_json":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE.json","view_paper":"https://pith.science/paper/326C4443","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.12735&json=true","fetch_graph":"https://pith.science/api/pith-number/326C4443CZMZXW2WXGZRSLRSFE/graph.json","fetch_events":"https://pith.science/api/pith-number/326C4443CZMZXW2WXGZRSLRSFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE/action/storage_attestation","attest_author":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE/action/author_attestation","sign_citation":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE/action/citation_signature","submit_replication":"https://pith.science/pith/326C4443CZMZXW2WXGZRSLRSFE/action/replication_record"}},"created_at":"2026-07-05T03:17:36.002469+00:00","updated_at":"2026-07-05T03:17:36.002469+00:00"}