{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:46TOCIQ2EK4STXMGFMKRPNKUIT","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":"60cfa8a29f86af77d6a8bb631035c15c77733a2d793d31ea0db6d4cd7b7d723f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-27T01:35:22Z","title_canon_sha256":"675774376945571959444ce31d076299e926afd540449a54f69b662f4e9f522e"},"schema_version":"1.0","source":{"id":"1804.10319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10319","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10319v1","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10319","created_at":"2026-05-18T00:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"46TOCIQ2EK4S","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"46TOCIQ2EK4STXMG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"46TOCIQ2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:698f7e8f8f1e90562270a8b57d89fa0b9e5c62fed04fb9568425baad9f9c0ac1","target":"graph","created_at":"2026-05-18T00:17:21Z","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"},"paper":{"abstract_excerpt":"Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve near-ML performance in practice. The main idea is to apply iterative decoding to a highly-redundant parity-check (PC) matrix that contains only the minimum-weight dual codewords as rows. As examples, we consider the peeling decoder for the binary erasure channel, linear-programming and belief propagation (BP) decoding for the binary-input additive white Gau","authors_text":"Christian H\\\"ager, Elia Santi, Henry D. Pfister","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-27T01:35:22Z","title":"Decoding Reed-Muller Codes Using Minimum-Weight Parity Checks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10319","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:6ccd9554efeef4a8b429bb54d9f3f02e6c8151cad16050d122921a027784acd2","target":"record","created_at":"2026-05-18T00:17:21Z","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":"60cfa8a29f86af77d6a8bb631035c15c77733a2d793d31ea0db6d4cd7b7d723f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-27T01:35:22Z","title_canon_sha256":"675774376945571959444ce31d076299e926afd540449a54f69b662f4e9f522e"},"schema_version":"1.0","source":{"id":"1804.10319","kind":"arxiv","version":1}},"canonical_sha256":"e7a6e1221a22b929dd862b1517b55444f5522598bfe9cab4bf6710281cdf9613","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7a6e1221a22b929dd862b1517b55444f5522598bfe9cab4bf6710281cdf9613","first_computed_at":"2026-05-18T00:17:21.130791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:21.130791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51I/GiwcpOnlVb2F4oAsGmFrzDDVEHBitbJVAKjUxnM4YFt2hmcFnVoeGCEXcd47ol3bpU4pJbirk3m8z9KTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:21.131402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ccd9554efeef4a8b429bb54d9f3f02e6c8151cad16050d122921a027784acd2","sha256:698f7e8f8f1e90562270a8b57d89fa0b9e5c62fed04fb9568425baad9f9c0ac1"],"state_sha256":"91789b1a7628a2683a315a41716a2dfad3b688b6349be4d3dfc82edf1dc69337"}