{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:OC3NAFI2MSPFVDOONIWCIEJAKP","short_pith_number":"pith:OC3NAFI2","schema_version":"1.0","canonical_sha256":"70b6d0151a649e5a8dce6a2c24112053f133c25f3bb725430b357c24cab470ff","source":{"kind":"arxiv","id":"quant-ph/0610153","version":1},"attestation_state":"computed","paper":{"title":"Subsystem Codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Klappenecker, Pradeep Kiran Sarvepalli, Salah A. Aly","submitted_at":"2006-10-18T21:19:17Z","abstract_excerpt":"We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]<sub>q</sub> subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits."},"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/0610153","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-10-18T21:19:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8bdc0a4f042932897625b98bc6d3aad48b3f43d9e7388f0f0f5eb3fde509d133","abstract_canon_sha256":"3255a1bac59907e2a78904be37acf0107a3f81f105e59bb067c8ba286bb6008b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:56.833098Z","signature_b64":"dzk8h57Q1f2LbHcKVBSyA7KdHF74vBB2EbJI5QfhCRDars67d2pGx9U4FT+3CaUZG+6VwC/CEEb0G8LAWmipDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b6d0151a649e5a8dce6a2c24112053f133c25f3bb725430b357c24cab470ff","last_reissued_at":"2026-07-04T15:02:56.832706Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:56.832706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subsystem Codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Andreas Klappenecker, Pradeep Kiran Sarvepalli, Salah A. Aly","submitted_at":"2006-10-18T21:19:17Z","abstract_excerpt":"We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]<sub>q</sub> subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0610153","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/0610153/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/0610153","created_at":"2026-07-04T15:02:56.832762+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0610153v1","created_at":"2026-07-04T15:02:56.832762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0610153","created_at":"2026-07-04T15:02:56.832762+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC3NAFI2MSPF","created_at":"2026-07-04T15:02:56.832762+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC3NAFI2MSPFVDOO","created_at":"2026-07-04T15:02:56.832762+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC3NAFI2","created_at":"2026-07-04T15:02:56.832762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.06087","citing_title":"Gauss law codes and vacuum codes from lattice gauge theories","ref_index":106,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP","json":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP.json","graph_json":"https://pith.science/api/pith-number/OC3NAFI2MSPFVDOONIWCIEJAKP/graph.json","events_json":"https://pith.science/api/pith-number/OC3NAFI2MSPFVDOONIWCIEJAKP/events.json","paper":"https://pith.science/paper/OC3NAFI2"},"agent_actions":{"view_html":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP","download_json":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP.json","view_paper":"https://pith.science/paper/OC3NAFI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0610153&json=true","fetch_graph":"https://pith.science/api/pith-number/OC3NAFI2MSPFVDOONIWCIEJAKP/graph.json","fetch_events":"https://pith.science/api/pith-number/OC3NAFI2MSPFVDOONIWCIEJAKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP/action/storage_attestation","attest_author":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP/action/author_attestation","sign_citation":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP/action/citation_signature","submit_replication":"https://pith.science/pith/OC3NAFI2MSPFVDOONIWCIEJAKP/action/replication_record"}},"created_at":"2026-07-04T15:02:56.832762+00:00","updated_at":"2026-07-04T15:02:56.832762+00:00"}