{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:45LNJVXUWZHEABT2GLTVWWCYSX","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":"d8bd29435d17069a31a7d2e4580e739fce2f17349c997c68554e4ea5273076de","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-01T17:16:28Z","title_canon_sha256":"2544a721f47dfa427125452012950550e520a6d17896c444aec651d637de6b1a"},"schema_version":"1.0","source":{"id":"2208.01002","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.01002","created_at":"2026-07-05T08:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"2208.01002v3","created_at":"2026-07-05T08:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.01002","created_at":"2026-07-05T08:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"45LNJVXUWZHE","created_at":"2026-07-05T08:59:48Z"},{"alias_kind":"pith_short_16","alias_value":"45LNJVXUWZHEABT2","created_at":"2026-07-05T08:59:48Z"},{"alias_kind":"pith_short_8","alias_value":"45LNJVXU","created_at":"2026-07-05T08:59:48Z"}],"graph_snapshots":[{"event_id":"sha256:4618c11184f23783436b0752267e60e08c90aba13772624ce6c606906817c655","target":"graph","created_at":"2026-07-05T08:59:48Z","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.01002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show that this decoder provides a close approximation of the maximum likelihood decoder that can be implemented in O(N^2) bit operations where N is the length of the quantum code. A probabilistic version of this decoder can be implemented in O(N^1.5) bit operations.","authors_text":"Anthony Leverrier, Nicholas Connolly, Nicolas Delfosse, Vivien Londe","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-01T17:16:28Z","title":"Fast erasure decoder for hypergraph product codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.01002","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:3f3bc370a02799da424d24531d054c8d7976ed6ea6c12cf2091b3ab94c15a4b3","target":"record","created_at":"2026-07-05T08:59:48Z","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":"d8bd29435d17069a31a7d2e4580e739fce2f17349c997c68554e4ea5273076de","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-08-01T17:16:28Z","title_canon_sha256":"2544a721f47dfa427125452012950550e520a6d17896c444aec651d637de6b1a"},"schema_version":"1.0","source":{"id":"2208.01002","kind":"arxiv","version":3}},"canonical_sha256":"e756d4d6f4b64e40067a32e75b585895ccc4b62940c68a0c849afe4c7418d71d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e756d4d6f4b64e40067a32e75b585895ccc4b62940c68a0c849afe4c7418d71d","first_computed_at":"2026-07-05T08:59:48.475969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:59:48.475969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1eygU0U3qHDRfAuQMxHWTxlBxgDZ6/ThDXy70ddPytVgj9+58Z+nIfDZD8mb+f1saHyOv0CSPx3bopu3QBuDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:59:48.476423Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.01002","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3bc370a02799da424d24531d054c8d7976ed6ea6c12cf2091b3ab94c15a4b3","sha256:4618c11184f23783436b0752267e60e08c90aba13772624ce6c606906817c655"],"state_sha256":"9a4c46e4d65051c929245efc40d92aed98eb332f31c200e122a7c9d9a3b1e79d"}