{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IKH5NRPG7C2BH6QNLRN3GVVWS4","short_pith_number":"pith:IKH5NRPG","schema_version":"1.0","canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","source":{"kind":"arxiv","id":"1206.3362","version":1},"attestation_state":"computed","paper":{"title":"An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Caizhi Zhu, Feng Qi, Hailin Zhang, Kexiang Ma, Yongzhao Li","submitted_at":"2012-06-15T03:08:40Z","abstract_excerpt":"Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of choosing the bit flipped. Because of its partially parallel structure, the novel strategy can be well incorporated into the LDPC decoder [1]. The analysis of the decoding delay demonstrates that, the decodi"},"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":"1206.3362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T03:08:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d489b6780526db75faf64edb27f66dba495606b6ee32a2bbd6f093b860d5a59","abstract_canon_sha256":"0331478ee7a4c55e28fd36c48bc4c8ec8eaf5a2bd43ff04c0465c19eaa07540f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.499203Z","signature_b64":"rcU0eFf+iYUSIKSD4yd7c3x7X4kEtnH1423D2e6WC29AAmEd1K/tg+AeP0n8yf7KC9qnTKBWqQo0I72nzBk3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","last_reissued_at":"2026-05-18T03:53:30.498696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.498696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Caizhi Zhu, Feng Qi, Hailin Zhang, Kexiang Ma, Yongzhao Li","submitted_at":"2012-06-15T03:08:40Z","abstract_excerpt":"Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of choosing the bit flipped. Because of its partially parallel structure, the novel strategy can be well incorporated into the LDPC decoder [1]. The analysis of the decoding delay demonstrates that, the decodi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3362","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":"1206.3362","created_at":"2026-05-18T03:53:30.498766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3362v1","created_at":"2026-05-18T03:53:30.498766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3362","created_at":"2026-05-18T03:53:30.498766+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKH5NRPG7C2B","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKH5NRPG7C2BH6QN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKH5NRPG","created_at":"2026-05-18T12:27:09.501522+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/IKH5NRPG7C2BH6QNLRN3GVVWS4","json":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4.json","graph_json":"https://pith.science/api/pith-number/IKH5NRPG7C2BH6QNLRN3GVVWS4/graph.json","events_json":"https://pith.science/api/pith-number/IKH5NRPG7C2BH6QNLRN3GVVWS4/events.json","paper":"https://pith.science/paper/IKH5NRPG"},"agent_actions":{"view_html":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4","download_json":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4.json","view_paper":"https://pith.science/paper/IKH5NRPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3362&json=true","fetch_graph":"https://pith.science/api/pith-number/IKH5NRPG7C2BH6QNLRN3GVVWS4/graph.json","fetch_events":"https://pith.science/api/pith-number/IKH5NRPG7C2BH6QNLRN3GVVWS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/action/storage_attestation","attest_author":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/action/author_attestation","sign_citation":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/action/citation_signature","submit_replication":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/action/replication_record"}},"created_at":"2026-05-18T03:53:30.498766+00:00","updated_at":"2026-05-18T03:53:30.498766+00:00"}