{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IKH5NRPG7C2BH6QNLRN3GVVWS4","short_pith_number":"pith:IKH5NRPG","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"},"canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","source":{"kind":"arxiv","id":"1206.3362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3362","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3362v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3362","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"IKH5NRPG7C2B","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKH5NRPG7C2BH6QN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKH5NRPG","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IKH5NRPG7C2BH6QNLRN3GVVWS4","target":"record","payload":{"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"},"canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","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"},"source_kind":"arxiv","source_id":"1206.3362","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQNz+2OajS6OZnoMnQxnKp3Trl44W3Zfw9K4/FsjSVKtcbtX1CJHhtBWuU6WcmoZqcRSZ6J1rkp/QRR5iNE9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:31:49.021241Z"},"content_sha256":"00866db5a8ee374a4656c921c19100ea2357527e8f238a2cbac762b4e67d1072","schema_version":"1.0","event_id":"sha256:00866db5a8ee374a4656c921c19100ea2357527e8f238a2cbac762b4e67d1072"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IKH5NRPG7C2BH6QNLRN3GVVWS4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7wpj3a0qZwmwoinZoxRA5YbOnUVUn3+2vzt1QVkGwMDp6Y0urQNxJ8TM6jHbHpY9fed7qgyz4IquST0P/LkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:31:49.021611Z"},"content_sha256":"55e75bc72f030d2704fdf0c7317025f1486cac0eb753e1e46cd2877d72ea95b3","schema_version":"1.0","event_id":"sha256:55e75bc72f030d2704fdf0c7317025f1486cac0eb753e1e46cd2877d72ea95b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/bundle.json","state_url":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T20:31:49Z","links":{"resolver":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4","bundle":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/bundle.json","state":"https://pith.science/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKH5NRPG7C2BH6QNLRN3GVVWS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IKH5NRPG7C2BH6QNLRN3GVVWS4","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":"0331478ee7a4c55e28fd36c48bc4c8ec8eaf5a2bd43ff04c0465c19eaa07540f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T03:08:40Z","title_canon_sha256":"9d489b6780526db75faf64edb27f66dba495606b6ee32a2bbd6f093b860d5a59"},"schema_version":"1.0","source":{"id":"1206.3362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3362","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3362v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3362","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"IKH5NRPG7C2B","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKH5NRPG7C2BH6QN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKH5NRPG","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:55e75bc72f030d2704fdf0c7317025f1486cac0eb753e1e46cd2877d72ea95b3","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"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","authors_text":"Caizhi Zhu, Feng Qi, Hailin Zhang, Kexiang Ma, Yongzhao Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T03:08:40Z","title":"An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3362","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:00866db5a8ee374a4656c921c19100ea2357527e8f238a2cbac762b4e67d1072","target":"record","created_at":"2026-05-18T03:53:30Z","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":"0331478ee7a4c55e28fd36c48bc4c8ec8eaf5a2bd43ff04c0465c19eaa07540f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T03:08:40Z","title_canon_sha256":"9d489b6780526db75faf64edb27f66dba495606b6ee32a2bbd6f093b860d5a59"},"schema_version":"1.0","source":{"id":"1206.3362","kind":"arxiv","version":1}},"canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428fd6c5e6f8b413fa0d5c5bb356b6972ab33206efdba08ab71e2a30f336153d","first_computed_at":"2026-05-18T03:53:30.498696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.498696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcU0eFf+iYUSIKSD4yd7c3x7X4kEtnH1423D2e6WC29AAmEd1K/tg+AeP0n8yf7KC9qnTKBWqQo0I72nzBk3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.499203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00866db5a8ee374a4656c921c19100ea2357527e8f238a2cbac762b4e67d1072","sha256:55e75bc72f030d2704fdf0c7317025f1486cac0eb753e1e46cd2877d72ea95b3"],"state_sha256":"1c083920e8c751038007da33266f24b8cdc9bb2fdd1a378c32764317c3e0648f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sM/7R16KlGfYD7EkRsOWd8duQgji+pUrVfl2h9Toex4UyIfMqEjwal0dini5h1uN3g7TpJ2zSjvO/nCdxLhpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:31:49.023858Z","bundle_sha256":"a3539052717d63beaea404a32f02815b673ae7c339ffc3c2dab7aab937f21588"}}