{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1997:FNC34D6K36FTVE7I2VR7OZAFEF","short_pith_number":"pith:FNC34D6K","canonical_record":{"source":{"id":"quant-ph/9705052","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-05-28T23:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"2209b6c323d04b23962ee0e23c396eb6e7db03d43c06e8bf93106631c5ca53f5","abstract_canon_sha256":"0277cb022cdad6a5023c379717187cc684b41d732da41ebbcd71f3c4b00ef537"},"schema_version":"1.0"},"canonical_sha256":"2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8","source":{"kind":"arxiv","id":"quant-ph/9705052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9705052","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9705052v1","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9705052","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"FNC34D6K36FT","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"FNC34D6K36FTVE7I","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"FNC34D6K","created_at":"2026-07-04T14:47:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1997:FNC34D6K36FTVE7I2VR7OZAFEF","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9705052","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-05-28T23:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"2209b6c323d04b23962ee0e23c396eb6e7db03d43c06e8bf93106631c5ca53f5","abstract_canon_sha256":"0277cb022cdad6a5023c379717187cc684b41d732da41ebbcd71f3c4b00ef537"},"schema_version":"1.0"},"canonical_sha256":"2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:07.239532Z","signature_b64":"I6Vk3V2GZaepShtY7q9B1mSk+TUPrp3bjYmasjFNn3UL+hEm9TzieeHuQs1RDLE+Z/MvXAFpmr6r9FucuLgYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8","last_reissued_at":"2026-07-04T14:47:07.239168Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:07.239168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9705052","source_version":1,"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-04T14:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Nrcvg1UW4YQnMsRjVBtIPbRlzF5m2WtGYUZbi367PqByjvRUNWdZ6PgSAdW3XXhaVHiajyjyGtYnYGruIczBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:02:43.670791Z"},"content_sha256":"0fbba9e2f6dd4e8cf9069305c8c396ae2235ec28c5ed3afa58c1f16212a17cad","schema_version":"1.0","event_id":"sha256:0fbba9e2f6dd4e8cf9069305c8c396ae2235ec28c5ed3afa58c1f16212a17cad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1997:FNC34D6K36FTVE7I2VR7OZAFEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stabilizer Codes and Quantum Error Correction","license":"","headline":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"1997-05-28T23:51:29Z","abstract_excerpt":"Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dd9064b3fb9cf0c938885ce515fd76088d11b8456bcb2881660d5cacabba80a9"},"source":{"id":"quant-ph/9705052","kind":"arxiv","version":1},"verdict":{"id":"5a2e5152-af90-411b-ab94-5a8f103adf49","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T22:00:12.436034Z","strongest_claim":"A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes.","one_line_summary":"The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints.","pith_extraction_headline":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9705052/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":65,"sample":[{"doi":"","year":1936,"title":"An unsolvable problem of elementary number t heory","work_id":"15ff0b43-145d-4e67-a2f6-0811b4cdd021","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1982,"title":"Simulating physics with computers","work_id":"9405bfc1-4233-4095-ab88-653085559a87","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"Algorithms for quantum computation: discrete logarithms and factoring","work_id":"40bcc809-2bcf-4a8f-bc6d-431e21c94f9d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"A fast quantum mechanical algorithm for da tabase search","work_id":"90c59e68-a0b2-43da-a3f5-c604bff348ee","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"Strengths and weaknesses of quantum computing","work_id":"b24814ff-8b66-48fa-85b4-3f96fc38b967","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":65,"snapshot_sha256":"bdb00a5a825104660dbd2b6b898ef5f6539c535b8351c09de504bd66a247312e","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"dd1f05be27b37c86f2ed1edc2de0f83005019550f526a23339ea74e3a9c269f8"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5a2e5152-af90-411b-ab94-5a8f103adf49"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZTndTY3aznNjHOQsi8IvT/MVSJ/I30y0jJYipXMPLgDKAOMUa7Ypp4Cu4/GrYPpqeT9QgiAfJ4I0tGcQYf4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:02:43.671384Z"},"content_sha256":"5afc6c061f11b09a4e5a311314c540ef5fa9e94981367f84a31d32fa3870d088","schema_version":"1.0","event_id":"sha256:5afc6c061f11b09a4e5a311314c540ef5fa9e94981367f84a31d32fa3870d088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF/bundle.json","state_url":"https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNC34D6K36FTVE7I2VR7OZAFEF/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-14T02:02:43Z","links":{"resolver":"https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF","bundle":"https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF/bundle.json","state":"https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNC34D6K36FTVE7I2VR7OZAFEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1997:FNC34D6K36FTVE7I2VR7OZAFEF","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":"0277cb022cdad6a5023c379717187cc684b41d732da41ebbcd71f3c4b00ef537","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-05-28T23:51:29Z","title_canon_sha256":"2209b6c323d04b23962ee0e23c396eb6e7db03d43c06e8bf93106631c5ca53f5"},"schema_version":"1.0","source":{"id":"quant-ph/9705052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9705052","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9705052v1","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9705052","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"FNC34D6K36FT","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"FNC34D6K36FTVE7I","created_at":"2026-07-04T14:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"FNC34D6K","created_at":"2026-07-04T14:47:07Z"}],"graph_snapshots":[{"event_id":"sha256:5afc6c061f11b09a4e5a311314c540ef5fa9e94981367f84a31d32fa3870d088","target":"graph","created_at":"2026-07-04T14:47:07Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes."}],"snapshot_sha256":"dd9064b3fb9cf0c938885ce515fd76088d11b8456bcb2881660d5cacabba80a9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"dd1f05be27b37c86f2ed1edc2de0f83005019550f526a23339ea74e3a9c269f8"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/9705052/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In th","authors_text":"Daniel Gottesman","cross_cats":[],"headline":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.","license":"","primary_cat":"quant-ph","submitted_at":"1997-05-28T23:51:29Z","title":"Stabilizer Codes and Quantum Error Correction"},"references":{"count":65,"internal_anchors":1,"resolved_work":65,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"An unsolvable problem of elementary number t heory","work_id":"15ff0b43-145d-4e67-a2f6-0811b4cdd021","year":1936},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Simulating physics with computers","work_id":"9405bfc1-4233-4095-ab88-653085559a87","year":1982},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Algorithms for quantum computation: discrete logarithms and factoring","work_id":"40bcc809-2bcf-4a8f-bc6d-431e21c94f9d","year":1994},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A fast quantum mechanical algorithm for da tabase search","work_id":"90c59e68-a0b2-43da-a3f5-c604bff348ee","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Strengths and weaknesses of quantum computing","work_id":"b24814ff-8b66-48fa-85b4-3f96fc38b967","year":1997}],"snapshot_sha256":"bdb00a5a825104660dbd2b6b898ef5f6539c535b8351c09de504bd66a247312e"},"source":{"id":"quant-ph/9705052","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-12T22:00:12.436034Z","id":"5a2e5152-af90-411b-ab94-5a8f103adf49","model_set":{"reader":"grok-4.3"},"one_line_summary":"The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.","strongest_claim":"A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes.","weakest_assumption":"That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints."}},"verdict_id":"5a2e5152-af90-411b-ab94-5a8f103adf49"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0fbba9e2f6dd4e8cf9069305c8c396ae2235ec28c5ed3afa58c1f16212a17cad","target":"record","created_at":"2026-07-04T14:47:07Z","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":"0277cb022cdad6a5023c379717187cc684b41d732da41ebbcd71f3c4b00ef537","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-05-28T23:51:29Z","title_canon_sha256":"2209b6c323d04b23962ee0e23c396eb6e7db03d43c06e8bf93106631c5ca53f5"},"schema_version":"1.0","source":{"id":"quant-ph/9705052","kind":"arxiv","version":1}},"canonical_sha256":"2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8","first_computed_at":"2026-07-04T14:47:07.239168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:47:07.239168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I6Vk3V2GZaepShtY7q9B1mSk+TUPrp3bjYmasjFNn3UL+hEm9TzieeHuQs1RDLE+Z/MvXAFpmr6r9FucuLgYDw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:47:07.239532Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9705052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fbba9e2f6dd4e8cf9069305c8c396ae2235ec28c5ed3afa58c1f16212a17cad","sha256:5afc6c061f11b09a4e5a311314c540ef5fa9e94981367f84a31d32fa3870d088"],"state_sha256":"8c39ceb2306a0398e7684c210c36c7c03cead8ac680d656acc0c59e14753beb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQukhXSPtBGnQm8jAZCQkKoRo3i7947y22dEu33HgwDoty3b5wUHPCrTLAoZsXTlvP6dP0KEdj+dbE5R7WfEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:02:43.674410Z","bundle_sha256":"0a58ac32bd885949cad98aa7c136cb4114797e44821820f6620f76af840a3ace"}}