{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WM3GL7L5BRY6HHTMMSH6CWJM5J","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":"81c032e3eebae27cc833a3062d5615d328420e9e0ba4f619a5b37ea1767c1f80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T22:33:45Z","title_canon_sha256":"4c170adb87b3ce0a470d23fc3332076ae1c185358852a8bc236ecb18bb4c0757"},"schema_version":"1.0","source":{"id":"1103.0795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0795","created_at":"2026-05-18T04:27:26Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0795v1","created_at":"2026-05-18T04:27:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0795","created_at":"2026-05-18T04:27:26Z"},{"alias_kind":"pith_short_12","alias_value":"WM3GL7L5BRY6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WM3GL7L5BRY6HHTM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WM3GL7L5","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:788839e51cbaeed8858aa6f5d75761c8f1b9e88e4a4b7f5f613b4a189e7ad991","target":"graph","created_at":"2026-05-18T04:27:26Z","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":"Finite alphabet iterative decoders (FAID) with multilevel messages that can surpass BP in the error floor region for LDPC codes on the BSC were previously proposed. In this paper, we propose decimation-enhanced decoders. The technique of decimation which is incorporated into the message update rule, involves fixing certain bits of the code to a particular value. Under appropriately chosen rules, decimation can significantly reduce the number of iterations required to correct a fixed number of errors, while maintaining the good performance of the original decoder in the error floor region. At t","authors_text":"Bane Vasic, David Declercq, Shiva Kumar Planjery","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T22:33:45Z","title":"Decimation-Enhanced Finite Alphabet Iterative Decoders for LDPC codes on the BSC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0795","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:9b3af3b1fb15a256820ca52c6242a168ded9f0d1a711e6deba1aef1d6c377c65","target":"record","created_at":"2026-05-18T04:27:26Z","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":"81c032e3eebae27cc833a3062d5615d328420e9e0ba4f619a5b37ea1767c1f80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T22:33:45Z","title_canon_sha256":"4c170adb87b3ce0a470d23fc3332076ae1c185358852a8bc236ecb18bb4c0757"},"schema_version":"1.0","source":{"id":"1103.0795","kind":"arxiv","version":1}},"canonical_sha256":"b33665fd7d0c71e39e6c648fe1592cea4d0084b0471a0fd5732d290397abee96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b33665fd7d0c71e39e6c648fe1592cea4d0084b0471a0fd5732d290397abee96","first_computed_at":"2026-05-18T04:27:26.261514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:26.261514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fDQMEGpYRRhRIe1K+5r3ef/vKOjNGWo3YkMEALcRdVa/YSrGisH6o8p33ScplMJUtN4z684g5zvQYEA/Kc2QAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:26.262185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b3af3b1fb15a256820ca52c6242a168ded9f0d1a711e6deba1aef1d6c377c65","sha256:788839e51cbaeed8858aa6f5d75761c8f1b9e88e4a4b7f5f613b4a189e7ad991"],"state_sha256":"292dc4445147a697f92f57b27d030d7b9c9cdcd01f98b298554acc7b0b3e1d84"}