{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BCJK3UKBZUJXAA26SYY3L7JFET","short_pith_number":"pith:BCJK3UKB","canonical_record":{"source":{"id":"2604.24633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-04-27T16:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"cb7cf20a5855cfb2de05f290ea9a37d35e7059afd1dab3341106be22d6cce584","abstract_canon_sha256":"f0b86dffabda6ad28d172491eb7a660eab17f14b21af7d06eb3040780d1a5ceb"},"schema_version":"1.0"},"canonical_sha256":"0892add141cd1370035e9631b5fd2524dd1d66435a498bda11ae5248bbaa2afa","source":{"kind":"arxiv","id":"2604.24633","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24633","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24633v2","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24633","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"BCJK3UKBZUJX","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"BCJK3UKBZUJXAA26","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"BCJK3UKB","created_at":"2026-07-07T00:15:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BCJK3UKBZUJXAA26SYY3L7JFET","target":"record","payload":{"canonical_record":{"source":{"id":"2604.24633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-04-27T16:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"cb7cf20a5855cfb2de05f290ea9a37d35e7059afd1dab3341106be22d6cce584","abstract_canon_sha256":"f0b86dffabda6ad28d172491eb7a660eab17f14b21af7d06eb3040780d1a5ceb"},"schema_version":"1.0"},"canonical_sha256":"0892add141cd1370035e9631b5fd2524dd1d66435a498bda11ae5248bbaa2afa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T00:15:55.051558Z","signature_b64":"vEzyFoKwxNCfB+i0OlLwqjZahCdb3i4aEzgPwGIkwt39oo7HEmHd0LZyShRWck2FIcskbwQ+cFfDyPh6JPYmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0892add141cd1370035e9631b5fd2524dd1d66435a498bda11ae5248bbaa2afa","last_reissued_at":"2026-07-07T00:15:55.050745Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T00:15:55.050745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.24633","source_version":2,"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-07T00:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2o9uHJYqtpbp89slA88wH2VwbSSR4Ne3kxkMrklPuJawQDOUpEvuvePbyYhIdnExeObdUmpsMIWxLrxlSJ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:59:08.331453Z"},"content_sha256":"90c96cb0b73f3d74e08ef2e082ba0d4fd510f4893bc2c4d75716571513be8847","schema_version":"1.0","event_id":"sha256:90c96cb0b73f3d74e08ef2e082ba0d4fd510f4893bc2c4d75716571513be8847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BCJK3UKBZUJXAA26SYY3L7JFET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization Using Locally-Quantum Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abid Khan, Andr\\'e Chailloux, Avijit Mandal, John Azariah, Nicholas C. Rubin, Noah Shutty, Quentin Buzet, Ruslan Shaydulin, Sami Boulebnane, Seyoon Ragavan, Stephen P. Jordan","submitted_at":"2026-04-27T16:02:59Z","abstract_excerpt":"It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related to Regev's reduction. LDPC codes have very good decoders, such as Belief Propagation (BP), and this therefore makes D-regular max-k-XORSAT an enticing target for this class of quantum algorithms. However, BP was found insufficient to achieve quantum advantage. Here, we develop an intrinsically quantum decoding technique, which decodes classical LDPC codes subject to coherent superpositions of bit flip errors. For aver"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For average-case instances of D-regular max-k-XORSAT drawn from Gallager's ensemble, this quantum decoder strongly outperforms classical belief propagation at many values of k and D. For some (k,D) the approximate optima achievable using this decoder surpass both Prange's algorithm and simulated annealing.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the described locally-quantum decoder can be realized with feasible quantum resources and that performance on the Gallager ensemble generalizes to the instances of practical interest; the abstract provides no implementation details or resource counts.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A quantum decoder for LDPC codes with coherent errors outperforms belief propagation on average-case D-regular max-k-XORSAT for several k and D, matching an enhanced version of Prange's algorithm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6547818ef03c81e04170df6372e0aee16c3d164ef6d91036f17339d4c0efdf5c"},"source":{"id":"2604.24633","kind":"arxiv","version":2},"verdict":{"id":"9341216f-022c-4004-bbc6-0ed6d3c8d36c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T04:05:39.058084Z","strongest_claim":"For average-case instances of D-regular max-k-XORSAT drawn from Gallager's ensemble, this quantum decoder strongly outperforms classical belief propagation at many values of k and D. For some (k,D) the approximate optima achievable using this decoder surpass both Prange's algorithm and simulated annealing.","one_line_summary":"A quantum decoder for LDPC codes with coherent errors outperforms belief propagation on average-case D-regular max-k-XORSAT for several k and D, matching an enhanced version of Prange's algorithm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the described locally-quantum decoder can be realized with feasible quantum resources and that performance on the Gallager ensemble generalizes to the instances of practical interest; the abstract provides no implementation details or resource counts.","pith_extraction_headline":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.24633/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T06:37:17.431499Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:53:20.143456Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"130371226335e4f4a47bbbcfdf61722d5c47d8f8389f80cb0f232cb4f8b06060"},"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":"9341216f-022c-4004-bbc6-0ed6d3c8d36c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T00:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibXEFgp4GITFYXxrdTEVuxE02PRsAbf2hoTHfUdGcUk7qGG2s4dJk+vwVt2bxvTOdBM+JnZbS5FP5DtQdzY4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:59:08.332194Z"},"content_sha256":"4a2ce6cdb2dc62562b7125372deeeca7c60ed22302740ff089d555f6610c73bf","schema_version":"1.0","event_id":"sha256:4a2ce6cdb2dc62562b7125372deeeca7c60ed22302740ff089d555f6610c73bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCJK3UKBZUJXAA26SYY3L7JFET/bundle.json","state_url":"https://pith.science/pith/BCJK3UKBZUJXAA26SYY3L7JFET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCJK3UKBZUJXAA26SYY3L7JFET/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-08-13T05:59:08Z","links":{"resolver":"https://pith.science/pith/BCJK3UKBZUJXAA26SYY3L7JFET","bundle":"https://pith.science/pith/BCJK3UKBZUJXAA26SYY3L7JFET/bundle.json","state":"https://pith.science/pith/BCJK3UKBZUJXAA26SYY3L7JFET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCJK3UKBZUJXAA26SYY3L7JFET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BCJK3UKBZUJXAA26SYY3L7JFET","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":"f0b86dffabda6ad28d172491eb7a660eab17f14b21af7d06eb3040780d1a5ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-04-27T16:02:59Z","title_canon_sha256":"cb7cf20a5855cfb2de05f290ea9a37d35e7059afd1dab3341106be22d6cce584"},"schema_version":"1.0","source":{"id":"2604.24633","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24633","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24633v2","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24633","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"BCJK3UKBZUJX","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"BCJK3UKBZUJXAA26","created_at":"2026-07-07T00:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"BCJK3UKB","created_at":"2026-07-07T00:15:55Z"}],"graph_snapshots":[{"event_id":"sha256:4a2ce6cdb2dc62562b7125372deeeca7c60ed22302740ff089d555f6610c73bf","target":"graph","created_at":"2026-07-07T00:15:55Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For average-case instances of D-regular max-k-XORSAT drawn from Gallager's ensemble, this quantum decoder strongly outperforms classical belief propagation at many values of k and D. For some (k,D) the approximate optima achievable using this decoder surpass both Prange's algorithm and simulated annealing."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the described locally-quantum decoder can be realized with feasible quantum resources and that performance on the Gallager ensemble generalizes to the instances of practical interest; the abstract provides no implementation details or resource counts."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A quantum decoder for LDPC codes with coherent errors outperforms belief propagation on average-case D-regular max-k-XORSAT for several k and D, matching an enhanced version of Prange's algorithm."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances."}],"snapshot_sha256":"6547818ef03c81e04170df6372e0aee16c3d164ef6d91036f17339d4c0efdf5c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T06:37:17.431499Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:53:20.143456Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.24633/integrity.json","findings":[],"snapshot_sha256":"130371226335e4f4a47bbbcfdf61722d5c47d8f8389f80cb0f232cb4f8b06060","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related to Regev's reduction. LDPC codes have very good decoders, such as Belief Propagation (BP), and this therefore makes D-regular max-k-XORSAT an enticing target for this class of quantum algorithms. However, BP was found insufficient to achieve quantum advantage. Here, we develop an intrinsically quantum decoding technique, which decodes classical LDPC codes subject to coherent superpositions of bit flip errors. For aver","authors_text":"Abid Khan, Andr\\'e Chailloux, Avijit Mandal, John Azariah, Nicholas C. Rubin, Noah Shutty, Quentin Buzet, Ruslan Shaydulin, Sami Boulebnane, Seyoon Ragavan, Stephen P. Jordan","cross_cats":[],"headline":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-04-27T16:02:59Z","title":"Optimization Using Locally-Quantum Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24633","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T04:05:39.058084Z","id":"9341216f-022c-4004-bbc6-0ed6d3c8d36c","model_set":{"reader":"grok-4.3"},"one_line_summary":"A quantum decoder for LDPC codes with coherent errors outperforms belief propagation on average-case D-regular max-k-XORSAT for several k and D, matching an enhanced version of Prange's algorithm.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A locally-quantum decoder for LDPC codes finds better approximate solutions to D-regular max-k-XORSAT than classical belief propagation on average-case instances.","strongest_claim":"For average-case instances of D-regular max-k-XORSAT drawn from Gallager's ensemble, this quantum decoder strongly outperforms classical belief propagation at many values of k and D. For some (k,D) the approximate optima achievable using this decoder surpass both Prange's algorithm and simulated annealing.","weakest_assumption":"That the described locally-quantum decoder can be realized with feasible quantum resources and that performance on the Gallager ensemble generalizes to the instances of practical interest; the abstract provides no implementation details or resource counts."}},"verdict_id":"9341216f-022c-4004-bbc6-0ed6d3c8d36c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90c96cb0b73f3d74e08ef2e082ba0d4fd510f4893bc2c4d75716571513be8847","target":"record","created_at":"2026-07-07T00:15:55Z","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":"f0b86dffabda6ad28d172491eb7a660eab17f14b21af7d06eb3040780d1a5ceb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-04-27T16:02:59Z","title_canon_sha256":"cb7cf20a5855cfb2de05f290ea9a37d35e7059afd1dab3341106be22d6cce584"},"schema_version":"1.0","source":{"id":"2604.24633","kind":"arxiv","version":2}},"canonical_sha256":"0892add141cd1370035e9631b5fd2524dd1d66435a498bda11ae5248bbaa2afa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0892add141cd1370035e9631b5fd2524dd1d66435a498bda11ae5248bbaa2afa","first_computed_at":"2026-07-07T00:15:55.050745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T00:15:55.050745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vEzyFoKwxNCfB+i0OlLwqjZahCdb3i4aEzgPwGIkwt39oo7HEmHd0LZyShRWck2FIcskbwQ+cFfDyPh6JPYmCg==","signature_status":"signed_v1","signed_at":"2026-07-07T00:15:55.051558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24633","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90c96cb0b73f3d74e08ef2e082ba0d4fd510f4893bc2c4d75716571513be8847","sha256:4a2ce6cdb2dc62562b7125372deeeca7c60ed22302740ff089d555f6610c73bf"],"state_sha256":"1df1406023be8a301a1c37505b472aaff2f70703f9c7f5b097a8d59eae0b8f86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4GhOdg4MIXte9clxsU6MRCaMc+waqWeszamQQ2EoZPrvSGHvVBUvzD3Tng6ElkPY9BuWYFnBrTxs5td1cjCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:59:08.336269Z","bundle_sha256":"90c470710a62463a5e534520f2da9a71d7af2ce962b2b389a999335d8088a73e"}}