{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ERHIOZR6XXSRSBI3ZCPKNCPRUD","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":"0716e235e2f8dc21d2a24900c359feb19ee78334eb1e7ea3b795d6e3db3199bb","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-06T23:08:55Z","title_canon_sha256":"5101dc94e0e1b7bb2bd140bf1ac68f5d8c5f7c5e0b8ff7a03315c373e7ea8132"},"schema_version":"1.0","source":{"id":"2411.04306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.04306","created_at":"2026-07-05T09:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"2411.04306v1","created_at":"2026-07-05T09:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04306","created_at":"2026-07-05T09:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"ERHIOZR6XXSR","created_at":"2026-07-05T09:32:17Z"},{"alias_kind":"pith_short_16","alias_value":"ERHIOZR6XXSRSBI3","created_at":"2026-07-05T09:32:17Z"},{"alias_kind":"pith_short_8","alias_value":"ERHIOZR6","created_at":"2026-07-05T09:32:17Z"}],"graph_snapshots":[{"event_id":"sha256:8e8e874937fefe5ccf227ff99b4fb6eec814700d60e75137dd382dae27829c8f","target":"graph","created_at":"2026-07-05T09:32:17Z","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/2411.04306/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance quantum codes either required access to a classical side channel or were based on algebraic constructions that preclude the LDPC property.\n  Our construction relies on new algorithmic results for codes obtained via the quantum analog of the distance amplification scheme of Alon, Edmonds, and Luby [FOCS 1995]. These results are based on convex relaxations ob","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Shashank Srivastava, Thiago Bergamaschi, Tushant Mittal","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-06T23:08:55Z","title":"List Decodable Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04306","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:878d81e9938d25b5f3e9b4517ad61b38b6fac3e8c7f836feb2c1f6212cab5e7c","target":"record","created_at":"2026-07-05T09:32:17Z","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":"0716e235e2f8dc21d2a24900c359feb19ee78334eb1e7ea3b795d6e3db3199bb","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-06T23:08:55Z","title_canon_sha256":"5101dc94e0e1b7bb2bd140bf1ac68f5d8c5f7c5e0b8ff7a03315c373e7ea8132"},"schema_version":"1.0","source":{"id":"2411.04306","kind":"arxiv","version":1}},"canonical_sha256":"244e87663ebde519051bc89ea689f1a0df5669f06413618ed46a68a818829dcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"244e87663ebde519051bc89ea689f1a0df5669f06413618ed46a68a818829dcc","first_computed_at":"2026-07-05T09:32:17.159596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:32:17.159596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BoM96eBFEI8TXc6aglzpg6Gg9EWNPgizpAyi4LQmT+Nd5icHK0lQ1g9TGnHEXBzOsyldfa4JdHNhs78cXFwKCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:32:17.159971Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.04306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878d81e9938d25b5f3e9b4517ad61b38b6fac3e8c7f836feb2c1f6212cab5e7c","sha256:8e8e874937fefe5ccf227ff99b4fb6eec814700d60e75137dd382dae27829c8f"],"state_sha256":"a8cf60f6150811584efcd1c54b5bb6726ebc084911e6f495e65845fadbb834d2"}