{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:DPWQEKNTP27JXYIQFX4G6TX6IO","short_pith_number":"pith:DPWQEKNT","schema_version":"1.0","canonical_sha256":"1bed0229b37ebe9be1102df86f4efe43baa74d14fa4de3fae9d2bb11bcbe4bac","source":{"kind":"arxiv","id":"quant-ph/9602019","version":1},"attestation_state":"computed","paper":{"title":"Perfect Quantum Error Correction Code","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cesar Miquel, Juan Pablo Paz, Raymond Laflamme, Wojciech Hubert Zurek","submitted_at":"1996-02-27T17:27:56Z","abstract_excerpt":"We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We give a simple circuit which takes the initial state with four extra qubits in the state |0> to the encoded state. The circuit can be converted into a decoding one by simply running it backward. Reading the extra four qubits at the decoder's output we learn which one of the six"},"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/9602019","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-02-27T17:27:56Z","cross_cats_sorted":[],"title_canon_sha256":"8456e3753951eb290fbf359b5f1c868c1b97c47b19c258e40dc817b0a6e1b6c0","abstract_canon_sha256":"25b83d2fafc5d82525f7463b103a66feadfac09610d54db498b77f0b68f61ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:04.172289Z","signature_b64":"/2hFCtN+FDytPgj3rcKKVONyVaLONW/LXS9OLoUUmMZgeTNMl8vvLB9Yo0Dgp9Wp+toMzvRRnioZvqnRaKcrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bed0229b37ebe9be1102df86f4efe43baa74d14fa4de3fae9d2bb11bcbe4bac","last_reissued_at":"2026-07-04T14:47:04.171924Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:04.171924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Quantum Error Correction Code","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cesar Miquel, Juan Pablo Paz, Raymond Laflamme, Wojciech Hubert Zurek","submitted_at":"1996-02-27T17:27:56Z","abstract_excerpt":"We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We give a simple circuit which takes the initial state with four extra qubits in the state |0> to the encoded state. The circuit can be converted into a decoding one by simply running it backward. Reading the extra four qubits at the decoder's output we learn which one of the six"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9602019","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/quant-ph/9602019/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/9602019","created_at":"2026-07-04T14:47:04.171982+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9602019v1","created_at":"2026-07-04T14:47:04.171982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9602019","created_at":"2026-07-04T14:47:04.171982+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPWQEKNTP27J","created_at":"2026-07-04T14:47:04.171982+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPWQEKNTP27JXYIQ","created_at":"2026-07-04T14:47:04.171982+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPWQEKNT","created_at":"2026-07-04T14:47:04.171982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.21298","citing_title":"Preparation Circuits for Matrix Product States by Classical Variational Disentanglement","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"quant-ph/9807006","citing_title":"The Heisenberg Representation of Quantum Computers","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO","json":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO.json","graph_json":"https://pith.science/api/pith-number/DPWQEKNTP27JXYIQFX4G6TX6IO/graph.json","events_json":"https://pith.science/api/pith-number/DPWQEKNTP27JXYIQFX4G6TX6IO/events.json","paper":"https://pith.science/paper/DPWQEKNT"},"agent_actions":{"view_html":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO","download_json":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO.json","view_paper":"https://pith.science/paper/DPWQEKNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9602019&json=true","fetch_graph":"https://pith.science/api/pith-number/DPWQEKNTP27JXYIQFX4G6TX6IO/graph.json","fetch_events":"https://pith.science/api/pith-number/DPWQEKNTP27JXYIQFX4G6TX6IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO/action/storage_attestation","attest_author":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO/action/author_attestation","sign_citation":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO/action/citation_signature","submit_replication":"https://pith.science/pith/DPWQEKNTP27JXYIQFX4G6TX6IO/action/replication_record"}},"created_at":"2026-07-04T14:47:04.171982+00:00","updated_at":"2026-07-04T14:47:04.171982+00:00"}