{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:TETACHQOJI3VIW5SOINMVOCVOA","short_pith_number":"pith:TETACHQO","schema_version":"1.0","canonical_sha256":"9926011e0e4a37545bb2721acab8557017d4eeefbce3f50d50070fa620662a86","source":{"kind":"arxiv","id":"quant-ph/0602063","version":2},"attestation_state":"computed","paper":{"title":"Topological Quantum Error Correction with Optimal Encoding Rate","license":"","headline":"","cross_cats":["cond-mat.str-el","cs.GR","hep-th","math-ph","math.AT","math.CO","math.MP"],"primary_cat":"quant-ph","authors_text":"H. Bombin, M.A. Martin-Delgado","submitted_at":"2006-02-06T10:43:50Z","abstract_excerpt":"We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbitrary genus. We find a class of regular toric codes that are optimal. For physical implementations, we present planar topological codes."},"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/0602063","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-06T10:43:50Z","cross_cats_sorted":["cond-mat.str-el","cs.GR","hep-th","math-ph","math.AT","math.CO","math.MP"],"title_canon_sha256":"6faeb740958d913bf7aa166175cbab459c6915b0932535f04bf087b0020cfd58","abstract_canon_sha256":"8864036b9e3ed6917d443b78cccfa9c1ffea7069a49565841583b15b872f2ef9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:02.676454Z","signature_b64":"uVVSsr9iMcBlwwyaA6/tvYa6VilG9HCx7RAnRV2qxISc3Uutug0OOI40jKYl+kllvL0c4UPy2gIijO62FErXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9926011e0e4a37545bb2721acab8557017d4eeefbce3f50d50070fa620662a86","last_reissued_at":"2026-05-18T01:05:02.675833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:02.675833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Quantum Error Correction with Optimal Encoding Rate","license":"","headline":"","cross_cats":["cond-mat.str-el","cs.GR","hep-th","math-ph","math.AT","math.CO","math.MP"],"primary_cat":"quant-ph","authors_text":"H. Bombin, M.A. Martin-Delgado","submitted_at":"2006-02-06T10:43:50Z","abstract_excerpt":"We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbitrary genus. We find a class of regular toric codes that are optimal. For physical implementations, we present planar topological codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0602063","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":"quant-ph/0602063","created_at":"2026-05-18T01:05:02.675933+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0602063v2","created_at":"2026-05-18T01:05:02.675933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0602063","created_at":"2026-05-18T01:05:02.675933+00:00"},{"alias_kind":"pith_short_12","alias_value":"TETACHQOJI3V","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"TETACHQOJI3VIW5S","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"TETACHQO","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20387","citing_title":"A small and interesting architecture for early fault-tolerant quantum computers","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA","json":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA.json","graph_json":"https://pith.science/api/pith-number/TETACHQOJI3VIW5SOINMVOCVOA/graph.json","events_json":"https://pith.science/api/pith-number/TETACHQOJI3VIW5SOINMVOCVOA/events.json","paper":"https://pith.science/paper/TETACHQO"},"agent_actions":{"view_html":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA","download_json":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA.json","view_paper":"https://pith.science/paper/TETACHQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0602063&json=true","fetch_graph":"https://pith.science/api/pith-number/TETACHQOJI3VIW5SOINMVOCVOA/graph.json","fetch_events":"https://pith.science/api/pith-number/TETACHQOJI3VIW5SOINMVOCVOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA/action/storage_attestation","attest_author":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA/action/author_attestation","sign_citation":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA/action/citation_signature","submit_replication":"https://pith.science/pith/TETACHQOJI3VIW5SOINMVOCVOA/action/replication_record"}},"created_at":"2026-05-18T01:05:02.675933+00:00","updated_at":"2026-05-18T01:05:02.675933+00:00"}