{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VRP6LCSE4VEV37G6PCPORMTUJH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dcdab2f6a7fbb52d4986ceaa9c32a7d548fedbb23f5bfdb855fd7c46069fe64f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-14T02:17:09Z","title_canon_sha256":"00cfaa9f708e0dc96d2e5e486e8449a2bf1cf46efbf62b0530a71a8386b425a2"},"schema_version":"1.0","source":{"id":"2206.06557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06557","created_at":"2026-07-05T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06557v1","created_at":"2026-07-05T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06557","created_at":"2026-07-05T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"VRP6LCSE4VEV","created_at":"2026-07-05T04:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"VRP6LCSE4VEV37G6","created_at":"2026-07-05T04:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"VRP6LCSE","created_at":"2026-07-05T04:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:0fae4d58f6718808fffa3291fdbd927a4c089418806214109de0ab90d3950d5e","target":"graph","created_at":"2026-07-05T04:31:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.06557/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and ef","authors_text":"Christopher A. Pattison, Eugene Tang, Shouzhen Gu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-14T02:17:09Z","title":"An efficient decoder for a linear distance quantum LDPC code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06557","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:51b3382f1f8c1136b8367d00e8a0c05ed985d5ae963f45c98fafbf64356b2a22","target":"record","created_at":"2026-07-05T04:31:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dcdab2f6a7fbb52d4986ceaa9c32a7d548fedbb23f5bfdb855fd7c46069fe64f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-14T02:17:09Z","title_canon_sha256":"00cfaa9f708e0dc96d2e5e486e8449a2bf1cf46efbf62b0530a71a8386b425a2"},"schema_version":"1.0","source":{"id":"2206.06557","kind":"arxiv","version":1}},"canonical_sha256":"ac5fe58a44e5495dfcde789ee8b27449d8caf44c762a8e5595c097c46f48ce25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac5fe58a44e5495dfcde789ee8b27449d8caf44c762a8e5595c097c46f48ce25","first_computed_at":"2026-07-05T04:31:43.450500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:43.450500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e3VpRyX5iHOTWm7zLPZbQjxgDGLtOLiVbPKbXSQosj2I7Wb9lAh/56jVcYHw2CdEyKVTQo/e7XU0YX93qAzODQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:43.450966Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.06557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51b3382f1f8c1136b8367d00e8a0c05ed985d5ae963f45c98fafbf64356b2a22","sha256:0fae4d58f6718808fffa3291fdbd927a4c089418806214109de0ab90d3950d5e"],"state_sha256":"21c2f4394645b273fd96933683fb0074b9d14d15e714115056f444cc1a566d16"}