{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","short_pith_number":"pith:UKSAJGU6","schema_version":"1.0","canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","source":{"kind":"arxiv","id":"1103.0801","version":1},"attestation_state":"computed","paper":{"title":"Two-Bit Bit Flipping Decoding of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin","submitted_at":"2011-03-03T23:08:04Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.0801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012","abstract_canon_sha256":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.595426Z","signature_b64":"ImCBfDgnvcrdLSsS+Kp5GZVOXHS+d215f8bx4HLU6FTSCghrQIfoicCosTQ+bCfC91gVDlwV/YWLl2qgFT0fBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","last_reissued_at":"2026-05-18T00:58:43.594800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.594800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Bit Bit Flipping Decoding of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin","submitted_at":"2011-03-03T23:08:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0801","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.0801","created_at":"2026-05-18T00:58:43.594875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0801v1","created_at":"2026-05-18T00:58:43.594875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0801","created_at":"2026-05-18T00:58:43.594875+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKSAJGU6ROMK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKSAJGU6ROMKFWRK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKSAJGU6","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK","json":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK.json","graph_json":"https://pith.science/api/pith-number/UKSAJGU6ROMKFWRK75JQ6DECAK/graph.json","events_json":"https://pith.science/api/pith-number/UKSAJGU6ROMKFWRK75JQ6DECAK/events.json","paper":"https://pith.science/paper/UKSAJGU6"},"agent_actions":{"view_html":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK","download_json":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK.json","view_paper":"https://pith.science/paper/UKSAJGU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0801&json=true","fetch_graph":"https://pith.science/api/pith-number/UKSAJGU6ROMKFWRK75JQ6DECAK/graph.json","fetch_events":"https://pith.science/api/pith-number/UKSAJGU6ROMKFWRK75JQ6DECAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/action/storage_attestation","attest_author":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/action/author_attestation","sign_citation":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/action/citation_signature","submit_replication":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/action/replication_record"}},"created_at":"2026-05-18T00:58:43.594875+00:00","updated_at":"2026-05-18T00:58:43.594875+00:00"}