{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:32TBCH4SNWGKUIOG7WKH6R5O77","short_pith_number":"pith:32TBCH4S","canonical_record":{"source":{"id":"2208.05537","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-10T19:50:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c287f11addc7eb0a148c993e88232a6b3d514ce41ff428b8a209c7cf7f24a43b","abstract_canon_sha256":"8b234196ba952120fbabc66a74b670785716890f221cb29abe28a2a419a65913"},"schema_version":"1.0"},"canonical_sha256":"dea6111f926d8caa21c6fd947f47aeffc59406bdf87ba1d0b429be546abcd7b7","source":{"kind":"arxiv","id":"2208.05537","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05537","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05537v3","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05537","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"32TBCH4SNWGK","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_16","alias_value":"32TBCH4SNWGKUIOG","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_8","alias_value":"32TBCH4S","created_at":"2026-07-05T05:23:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:32TBCH4SNWGKUIOG7WKH6R5O77","target":"record","payload":{"canonical_record":{"source":{"id":"2208.05537","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-10T19:50:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c287f11addc7eb0a148c993e88232a6b3d514ce41ff428b8a209c7cf7f24a43b","abstract_canon_sha256":"8b234196ba952120fbabc66a74b670785716890f221cb29abe28a2a419a65913"},"schema_version":"1.0"},"canonical_sha256":"dea6111f926d8caa21c6fd947f47aeffc59406bdf87ba1d0b429be546abcd7b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:32.551044Z","signature_b64":"qeVfBRp/unreqV135kcMyZ9QZOLg8rlebXHrg5Ot8lraosew1B3h8sjfGtvUkGUn8XbrCLH25eXlbQwWDESCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea6111f926d8caa21c6fd947f47aeffc59406bdf87ba1d0b429be546abcd7b7","last_reissued_at":"2026-07-05T05:23:32.550545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:32.550545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.05537","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0swVzNJqjrD4hE8wtHuCTXtU9zaHU+1bLzlcNJkx8U1rylNvBOJPAmqvAcJPDi4MqDcXwCet7KRAt3x7IEpiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T04:48:14.435643Z"},"content_sha256":"9a59210a64e19fe8d22565d22144708c578378700b40a6b92d01bc3c320ddc20","schema_version":"1.0","event_id":"sha256:9a59210a64e19fe8d22565d22144708c578378700b40a6b92d01bc3c320ddc20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:32TBCH4SNWGKUIOG7WKH6R5O77","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding quantum Tanner codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anthony Leverrier, Gilles Z\\'emor","submitted_at":"2022-08-10T19:50:18Z","abstract_excerpt":"We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum low-density parity-check codes. In this case, our decoders provably correct arbitrary errors of weight linear in the code length, respectively in linear or logarithmic time. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev. Along the way, we exploit recently established bounds on the robustness of random tensor c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05537","kind":"arxiv","version":3},"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/2208.05537/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7D9fypx7bkZesyK4GJVXhPpnHZGTi1H3YyFC1z8xMRCYgwZbzuDYMUvIp3XvQFhS5QMwHix2zPWfDYwn5C5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T04:48:14.436022Z"},"content_sha256":"fcdf1fbd9de7519d3c169a3a49d2fdfbb9f6ec8054d3ddf37ee0c15dd8b8c353","schema_version":"1.0","event_id":"sha256:fcdf1fbd9de7519d3c169a3a49d2fdfbb9f6ec8054d3ddf37ee0c15dd8b8c353"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32TBCH4SNWGKUIOG7WKH6R5O77/bundle.json","state_url":"https://pith.science/pith/32TBCH4SNWGKUIOG7WKH6R5O77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32TBCH4SNWGKUIOG7WKH6R5O77/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-25T04:48:14Z","links":{"resolver":"https://pith.science/pith/32TBCH4SNWGKUIOG7WKH6R5O77","bundle":"https://pith.science/pith/32TBCH4SNWGKUIOG7WKH6R5O77/bundle.json","state":"https://pith.science/pith/32TBCH4SNWGKUIOG7WKH6R5O77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32TBCH4SNWGKUIOG7WKH6R5O77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:32TBCH4SNWGKUIOG7WKH6R5O77","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":"8b234196ba952120fbabc66a74b670785716890f221cb29abe28a2a419a65913","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-10T19:50:18Z","title_canon_sha256":"c287f11addc7eb0a148c993e88232a6b3d514ce41ff428b8a209c7cf7f24a43b"},"schema_version":"1.0","source":{"id":"2208.05537","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05537","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05537v3","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05537","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"32TBCH4SNWGK","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_16","alias_value":"32TBCH4SNWGKUIOG","created_at":"2026-07-05T05:23:32Z"},{"alias_kind":"pith_short_8","alias_value":"32TBCH4S","created_at":"2026-07-05T05:23:32Z"}],"graph_snapshots":[{"event_id":"sha256:fcdf1fbd9de7519d3c169a3a49d2fdfbb9f6ec8054d3ddf37ee0c15dd8b8c353","target":"graph","created_at":"2026-07-05T05:23:32Z","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/2208.05537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum low-density parity-check codes. In this case, our decoders provably correct arbitrary errors of weight linear in the code length, respectively in linear or logarithmic time. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev. Along the way, we exploit recently established bounds on the robustness of random tensor c","authors_text":"Anthony Leverrier, Gilles Z\\'emor","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-10T19:50:18Z","title":"Decoding quantum Tanner codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05537","kind":"arxiv","version":3},"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:9a59210a64e19fe8d22565d22144708c578378700b40a6b92d01bc3c320ddc20","target":"record","created_at":"2026-07-05T05:23:32Z","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":"8b234196ba952120fbabc66a74b670785716890f221cb29abe28a2a419a65913","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-10T19:50:18Z","title_canon_sha256":"c287f11addc7eb0a148c993e88232a6b3d514ce41ff428b8a209c7cf7f24a43b"},"schema_version":"1.0","source":{"id":"2208.05537","kind":"arxiv","version":3}},"canonical_sha256":"dea6111f926d8caa21c6fd947f47aeffc59406bdf87ba1d0b429be546abcd7b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea6111f926d8caa21c6fd947f47aeffc59406bdf87ba1d0b429be546abcd7b7","first_computed_at":"2026-07-05T05:23:32.550545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:32.550545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qeVfBRp/unreqV135kcMyZ9QZOLg8rlebXHrg5Ot8lraosew1B3h8sjfGtvUkGUn8XbrCLH25eXlbQwWDESCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:32.551044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.05537","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a59210a64e19fe8d22565d22144708c578378700b40a6b92d01bc3c320ddc20","sha256:fcdf1fbd9de7519d3c169a3a49d2fdfbb9f6ec8054d3ddf37ee0c15dd8b8c353"],"state_sha256":"164df83d1511e538d5982b174c6734482a9553f5c04f342bbf98b8c1f383a8e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXE5dx16lBm+cmYG7VadQgWIWEOjbGymp+BUx19aLwi6ilEB9HUvD8xAD2F95eKThfSPOLw3s5R1GsbBGCscDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T04:48:14.438617Z","bundle_sha256":"9968b862f19903a8c8654d4172a14ca7a084b23bd49e18ec0e7ba07212224010"}}