{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SBIQ3SF4NZVFHFT42GPKEEFZGY","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":"ec76a4d4cf5869877f23b52f2e813bcb60adab06bbad57a96a2e0e20b3f945f5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:34:11Z","title_canon_sha256":"f3431d89fc89a9f1a04e92c2f9b9bf0112e8a2779aeea7f19f27c16b9c5d354f"},"schema_version":"1.0","source":{"id":"2606.20513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20513","created_at":"2026-06-19T16:13:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20513v1","created_at":"2026-06-19T16:13:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20513","created_at":"2026-06-19T16:13:14Z"},{"alias_kind":"pith_short_12","alias_value":"SBIQ3SF4NZVF","created_at":"2026-06-19T16:13:14Z"},{"alias_kind":"pith_short_16","alias_value":"SBIQ3SF4NZVFHFT4","created_at":"2026-06-19T16:13:14Z"},{"alias_kind":"pith_short_8","alias_value":"SBIQ3SF4","created_at":"2026-06-19T16:13:14Z"}],"graph_snapshots":[{"event_id":"sha256:973ec5e75918544680902acd96314abaefd412a4cfb303f2c7eb34ba90e3e7c6","target":"graph","created_at":"2026-06-19T16:13:14Z","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/2606.20513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the Frontier decoder, a pruned dynamic-programming decoder for sparse quantum decoding problems. Frontier processes error variables in a chosen order, merges prefixes with the same residual syndrome and logical label, and approximates logical-coset posterior masses by retaining only a narrow scored frontier. Without pruning, the recursion is exact ordered inference with exponential complexity.\n  In the code-capacity setting, the decoder reaches thresholds close to optimal for the surface code and the color code. In the circuit-level noise model, it achieves state-of-the-art perfor","authors_text":"Anthony Leverrier, R\\\"udiger Urbanke","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:34:11Z","title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20513","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:e26a17613641b4632e13586bdcb47567140303126eee3d377fcbc639bcd1abd1","target":"record","created_at":"2026-06-19T16:13:14Z","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":"ec76a4d4cf5869877f23b52f2e813bcb60adab06bbad57a96a2e0e20b3f945f5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:34:11Z","title_canon_sha256":"f3431d89fc89a9f1a04e92c2f9b9bf0112e8a2779aeea7f19f27c16b9c5d354f"},"schema_version":"1.0","source":{"id":"2606.20513","kind":"arxiv","version":1}},"canonical_sha256":"90510dc8bc6e6a53967cd19ea210b936199ae3ba24820285af4993012ede836d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90510dc8bc6e6a53967cd19ea210b936199ae3ba24820285af4993012ede836d","first_computed_at":"2026-06-19T16:13:14.125309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:14.125309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LH5Ew83NoAjYSaPRMmsc2QFsfHpGfEluaF4MXTP5FKiiz/KDAjrwU0yVgxtxWSiw9Y5I0GhaUsvFZCWavoIOAg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:14.125816Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e26a17613641b4632e13586bdcb47567140303126eee3d377fcbc639bcd1abd1","sha256:973ec5e75918544680902acd96314abaefd412a4cfb303f2c7eb34ba90e3e7c6"],"state_sha256":"c8dca11a415945f1ec0a7595fe57dcffb981104985034d55efbe634e4157fcde"}