{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JVTCXA3UCN52MALXRWOZSPQSHU","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":"92bb6188625fc540bc46bda6eff4a2425c96fe282bbb17c63b782b7124604836","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-28T00:10:52Z","title_canon_sha256":"3ff0e9026d78d381ef16f9acd93581aa62a6a8a06dc5e18c282c9312cd667201"},"schema_version":"1.0","source":{"id":"1202.6095","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6095","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6095v4","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6095","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"JVTCXA3UCN52","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JVTCXA3UCN52MALX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JVTCXA3U","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:abba1f9fafa6a9f711e7165ed08fb20bdf04ad5afd2a4968b587285cc4e41e13","target":"graph","created_at":"2026-05-18T00:44:18Z","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":"A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterativ","authors_text":"Henry D. Pfister, Krishna R. Narayanan, Yung-Yih Jian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-28T00:10:52Z","title":"Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6095","kind":"arxiv","version":4},"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:09f490c7170f7616e87511d51dd1129b705655865f7f14d6c6cb9e1e8454d63c","target":"record","created_at":"2026-05-18T00:44:18Z","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":"92bb6188625fc540bc46bda6eff4a2425c96fe282bbb17c63b782b7124604836","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-28T00:10:52Z","title_canon_sha256":"3ff0e9026d78d381ef16f9acd93581aa62a6a8a06dc5e18c282c9312cd667201"},"schema_version":"1.0","source":{"id":"1202.6095","kind":"arxiv","version":4}},"canonical_sha256":"4d662b8374137ba601778d9d993e123d09d6e71227d1173dd1cc295e3c4adf17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d662b8374137ba601778d9d993e123d09d6e71227d1173dd1cc295e3c4adf17","first_computed_at":"2026-05-18T00:44:18.901739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:18.901739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhx9gjhfNKjaxdCuZN1bPrHKsBm8gX3jutf//OJ8FL5Zi+4OXrhOKjKJlINWeyEZzo4U1ZN7jdVW0J9Vcu8kAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:18.902149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6095","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09f490c7170f7616e87511d51dd1129b705655865f7f14d6c6cb9e1e8454d63c","sha256:abba1f9fafa6a9f711e7165ed08fb20bdf04ad5afd2a4968b587285cc4e41e13"],"state_sha256":"1d3bd3a2bab50cb6e8f01199e2ba48ae6a88222b0215e3831843e4b738f7f011"}