{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DCRZWRONFUJM2FJMNCZ4C2H4MJ","short_pith_number":"pith:DCRZWRON","schema_version":"1.0","canonical_sha256":"18a39b45cd2d12cd152c68b3c168fc624de4c7cf887502cca7eea378c3de4a6c","source":{"kind":"arxiv","id":"1207.1443","version":2},"attestation_state":"computed","paper":{"title":"Subsystem surface codes with three-qubit check operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"David Poulin, Guillaume Duclos-Cianci, Martin Suchara, Sergey Bravyi","submitted_at":"2012-07-05T20:01:28Z","abstract_excerpt":"We propose a simplified version of the Kitaev's surface code in which error correction requires only three-qubit parity measurements for Pauli operators XXX and ZZZ. The new code belongs to the class of subsystem stabilizer codes. It inherits many favorable properties of the standard surface code such as encoding of multiple logical qubits on a planar lattice with punctured holes, efficient decoding by either minimum-weight matching or renormalization group methods, and high error threshold. The new subsystem surface code (SSC) gives rise to an exactly solvable Hamiltonian with 3-qubit interac"},"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":"1207.1443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-05T20:01:28Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"67c7f10d83d041a1bd5a13f77b2404aa039b211b2059eb7a3e83135a31bb4137","abstract_canon_sha256":"4a1d84ca17ec305fad388bbb161cd579b632417120e1d40f75ac1ec958290025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:22.686018Z","signature_b64":"+pz9ynzbsjlJXv87ibsuoSvzVv0yA1COPNHJ+J4w1mXeFUZqh/MgHLmZwVT+0RZ9EPwLgHAEoYNnxeMKUC/+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a39b45cd2d12cd152c68b3c168fc624de4c7cf887502cca7eea378c3de4a6c","last_reissued_at":"2026-05-18T03:04:22.685607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:22.685607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subsystem surface codes with three-qubit check operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"David Poulin, Guillaume Duclos-Cianci, Martin Suchara, Sergey Bravyi","submitted_at":"2012-07-05T20:01:28Z","abstract_excerpt":"We propose a simplified version of the Kitaev's surface code in which error correction requires only three-qubit parity measurements for Pauli operators XXX and ZZZ. The new code belongs to the class of subsystem stabilizer codes. It inherits many favorable properties of the standard surface code such as encoding of multiple logical qubits on a planar lattice with punctured holes, efficient decoding by either minimum-weight matching or renormalization group methods, and high error threshold. The new subsystem surface code (SSC) gives rise to an exactly solvable Hamiltonian with 3-qubit interac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1443","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":""},"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":"1207.1443","created_at":"2026-05-18T03:04:22.685669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1443v2","created_at":"2026-05-18T03:04:22.685669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1443","created_at":"2026-05-18T03:04:22.685669+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCRZWRONFUJM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCRZWRONFUJM2FJM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCRZWRON","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2201.07254","citing_title":"Free-Fermion Subsystem Codes","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":154,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04151","citing_title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ","json":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ.json","graph_json":"https://pith.science/api/pith-number/DCRZWRONFUJM2FJMNCZ4C2H4MJ/graph.json","events_json":"https://pith.science/api/pith-number/DCRZWRONFUJM2FJMNCZ4C2H4MJ/events.json","paper":"https://pith.science/paper/DCRZWRON"},"agent_actions":{"view_html":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ","download_json":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ.json","view_paper":"https://pith.science/paper/DCRZWRON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1443&json=true","fetch_graph":"https://pith.science/api/pith-number/DCRZWRONFUJM2FJMNCZ4C2H4MJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DCRZWRONFUJM2FJMNCZ4C2H4MJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ/action/storage_attestation","attest_author":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ/action/author_attestation","sign_citation":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ/action/citation_signature","submit_replication":"https://pith.science/pith/DCRZWRONFUJM2FJMNCZ4C2H4MJ/action/replication_record"}},"created_at":"2026-05-18T03:04:22.685669+00:00","updated_at":"2026-05-18T03:04:22.685669+00:00"}