{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6MO44I24QFBYTTOVXT3LACKVDR","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":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2"},"schema_version":"1.0","source":{"id":"1212.6465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6465v2","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"6MO44I24QFBY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MO44I24QFBYTTOV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MO44I24","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5","target":"graph","created_at":"2026-05-18T03:13:46Z","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":"The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping sets, absorbing sets, or pseudocodewords -- in a Tanner graph representation of the code. Many approaches have been proposed to lower the error floor by designing new LDPC codes with fewer such substructures or by modifying the decoding algorithm. Using a theoretical analysis of iterative MP decoding in an idealized trapping set scenario, we show that a contri","authors_text":"Paul H. Siegel, Xiaojie Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title":"Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6465","kind":"arxiv","version":2},"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:02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083","target":"record","created_at":"2026-05-18T03:13:46Z","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":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2"},"schema_version":"1.0","source":{"id":"1212.6465","kind":"arxiv","version":2}},"canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","first_computed_at":"2026-05-18T03:13:46.282766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:46.282766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+juyFks/w5hNQh8irNEw/oOPzLUoiCqvcn6mbyMZH3SFSB1KokEwmo3ppr7fJLPawRU+SWRdplucd1Jonfq8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:46.283437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083","sha256:679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5"],"state_sha256":"289184a3f2e9b213bbbbb08f92d3e6c1ce63afbcd04d92d63ed09b83b94bbd8b"}