{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VXKYQVC263H5X2MJVCLE5CM7Z2","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":"3fbfe202751ac22e320411e0f2df17bc1f53923761f4fdf84154977928e87f0c","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-11T23:14:23Z","title_canon_sha256":"f7982b0c8b107be57e32602f3657ad2ca8e756c076add6aeac719300f9476ab1"},"schema_version":"1.0","source":{"id":"2412.08817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08817","created_at":"2026-07-05T09:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08817v1","created_at":"2026-07-05T09:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08817","created_at":"2026-07-05T09:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"VXKYQVC263H5","created_at":"2026-07-05T09:48:02Z"},{"alias_kind":"pith_short_16","alias_value":"VXKYQVC263H5X2MJ","created_at":"2026-07-05T09:48:02Z"},{"alias_kind":"pith_short_8","alias_value":"VXKYQVC2","created_at":"2026-07-05T09:48:02Z"}],"graph_snapshots":[{"event_id":"sha256:89bf8f4c2cf848deec002023b1b0c52efb1d12edb667925d670a16974d789585","target":"graph","created_at":"2026-07-05T09:48:02Z","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/2412.08817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connelly et al. in 2022. Like the VH decoder, the idea is to first run the peeling decoder and then post-process the resulting stopping set. The cluster decoder breaks the stopping set into a tree of clusters which can be solved sequentially via Gaussian Elimination (GE). By allowing clusters of unconstrained size, this decoder achieves maximum-likelihood (ML) performance with reduced complexity com","authors_text":"Hanwen Yao, Henry D. Pfister, Mert G\\\"okduman","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-11T23:14:23Z","title":"Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08817","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:68fca25341defd630c1bcee4b43ec08e9296fa9d00ad134ec3e321aa60f443cc","target":"record","created_at":"2026-07-05T09:48:02Z","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":"3fbfe202751ac22e320411e0f2df17bc1f53923761f4fdf84154977928e87f0c","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-11T23:14:23Z","title_canon_sha256":"f7982b0c8b107be57e32602f3657ad2ca8e756c076add6aeac719300f9476ab1"},"schema_version":"1.0","source":{"id":"2412.08817","kind":"arxiv","version":1}},"canonical_sha256":"add588545af6cfdbe989a8964e899fceb4a7e26d174ce7170d3792cbf7e42287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add588545af6cfdbe989a8964e899fceb4a7e26d174ce7170d3792cbf7e42287","first_computed_at":"2026-07-05T09:48:02.092699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:48:02.092699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CBgC8sFUOmViUpDEstVJGeHZQVGlIEAXga4+Y0epot5cOHNfPEPvX2Me08D5UqfPHbuKbFsVW88Gg2ROE6lcAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:48:02.093221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.08817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68fca25341defd630c1bcee4b43ec08e9296fa9d00ad134ec3e321aa60f443cc","sha256:89bf8f4c2cf848deec002023b1b0c52efb1d12edb667925d670a16974d789585"],"state_sha256":"45381e0c92dc4d761f1007ff696371b91c25b5bb1f3546ce581ca8fde4cdda97"}