{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XR6C7DXEF7QKQV2RQT24AX7ELC","short_pith_number":"pith:XR6C7DXE","schema_version":"1.0","canonical_sha256":"bc7c2f8ee42fe0a8575184f5c05fe458b316a7d124b9dd151c20309a275b8686","source":{"kind":"arxiv","id":"2606.18145","version":1},"attestation_state":"computed","paper":{"title":"A polynomial-time approximation scheme for minimum-weight decoding of topological codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Lily Wang, Shouzhen Gu","submitted_at":"2026-06-16T16:44:08Z","abstract_excerpt":"Two-dimensional topological translationally invariant (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation, but using them requires solving the decoding problem. Minimum-weight decoding of these codes was recently shown to be NP-hard, even in basic settings, such as the color code with Pauli $Z$ errors and the toric code with Pauli $X$, $Y$ and $Z$ errors. Here, we prove that minimum-weight decoding of 2D TTI codes nonetheless admits a polynomial-time approximation scheme (PTAS), i.e., for any constant $\\varepsilon>0$, a recovery operator of weight within a multipli"},"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":"2606.18145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-16T16:44:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"92de64f897d6133951214f507a9022a0e52f6678efc4ac446f5573e3b583847a","abstract_canon_sha256":"e9e1408bda16c97b64675bb224e69e3737746892804438bd50a665ec0b440230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:49.470480Z","signature_b64":"g8R3C6yHdu+faSfMiI9fz0raRBfGL+etd62VWxyidueHDO1mGLJIghR34IZysw0WQMTJSXOHsyFjf9dpUZgCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7c2f8ee42fe0a8575184f5c05fe458b316a7d124b9dd151c20309a275b8686","last_reissued_at":"2026-06-19T16:10:49.470125Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:49.470125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial-time approximation scheme for minimum-weight decoding of topological codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Lily Wang, Shouzhen Gu","submitted_at":"2026-06-16T16:44:08Z","abstract_excerpt":"Two-dimensional topological translationally invariant (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation, but using them requires solving the decoding problem. Minimum-weight decoding of these codes was recently shown to be NP-hard, even in basic settings, such as the color code with Pauli $Z$ errors and the toric code with Pauli $X$, $Y$ and $Z$ errors. Here, we prove that minimum-weight decoding of 2D TTI codes nonetheless admits a polynomial-time approximation scheme (PTAS), i.e., for any constant $\\varepsilon>0$, a recovery operator of weight within a multipli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18145","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/2606.18145/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":"2606.18145","created_at":"2026-06-19T16:10:49.470186+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18145v1","created_at":"2026-06-19T16:10:49.470186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18145","created_at":"2026-06-19T16:10:49.470186+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR6C7DXEF7QK","created_at":"2026-06-19T16:10:49.470186+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR6C7DXEF7QKQV2R","created_at":"2026-06-19T16:10:49.470186+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR6C7DXE","created_at":"2026-06-19T16:10:49.470186+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC","json":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC.json","graph_json":"https://pith.science/api/pith-number/XR6C7DXEF7QKQV2RQT24AX7ELC/graph.json","events_json":"https://pith.science/api/pith-number/XR6C7DXEF7QKQV2RQT24AX7ELC/events.json","paper":"https://pith.science/paper/XR6C7DXE"},"agent_actions":{"view_html":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC","download_json":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC.json","view_paper":"https://pith.science/paper/XR6C7DXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18145&json=true","fetch_graph":"https://pith.science/api/pith-number/XR6C7DXEF7QKQV2RQT24AX7ELC/graph.json","fetch_events":"https://pith.science/api/pith-number/XR6C7DXEF7QKQV2RQT24AX7ELC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC/action/storage_attestation","attest_author":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC/action/author_attestation","sign_citation":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC/action/citation_signature","submit_replication":"https://pith.science/pith/XR6C7DXEF7QKQV2RQT24AX7ELC/action/replication_record"}},"created_at":"2026-06-19T16:10:49.470186+00:00","updated_at":"2026-06-19T16:10:49.470186+00:00"}