{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","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":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012"},"schema_version":"1.0","source":{"id":"1103.0801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0801v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"UKSAJGU6ROMK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UKSAJGU6ROMKFWRK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UKSAJGU6","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its \"strength.\" The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algo","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title":"Two-Bit Bit Flipping Decoding of LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0801","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:d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366","target":"record","created_at":"2026-05-18T00:58:43Z","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":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012"},"schema_version":"1.0","source":{"id":"1103.0801","kind":"arxiv","version":1}},"canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","first_computed_at":"2026-05-18T00:58:43.594800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.594800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ImCBfDgnvcrdLSsS+Kp5GZVOXHS+d215f8bx4HLU6FTSCghrQIfoicCosTQ+bCfC91gVDlwV/YWLl2qgFT0fBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.595426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366","sha256:359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e"],"state_sha256":"3a70c2adc78fab8e2c8a6fe28f4e870dc3ef1682a4585ae313e37391a38b7387"}