{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:GR6ETOI5ZYBI3HLPJNN6MH63MW","short_pith_number":"pith:GR6ETOI5","canonical_record":{"source":{"id":"0901.2090","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T18:59:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4a7cc0fa5ded157fe2095b43ebd8b3260be04402cfc1612dc834a46048d5108","abstract_canon_sha256":"652c66a23ab0a4323a4874f1848f155b9235102ceb5b5d85a66866448ab093da"},"schema_version":"1.0"},"canonical_sha256":"347c49b91dce028d9d6f4b5be61fdb65a4dd4450713ce5bc5661e355b95e13c9","source":{"kind":"arxiv","id":"0901.2090","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2090","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2090v3","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2090","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"GR6ETOI5ZYBI","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GR6ETOI5ZYBI3HLP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GR6ETOI5","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:GR6ETOI5ZYBI3HLPJNN6MH63MW","target":"record","payload":{"canonical_record":{"source":{"id":"0901.2090","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T18:59:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4a7cc0fa5ded157fe2095b43ebd8b3260be04402cfc1612dc834a46048d5108","abstract_canon_sha256":"652c66a23ab0a4323a4874f1848f155b9235102ceb5b5d85a66866448ab093da"},"schema_version":"1.0"},"canonical_sha256":"347c49b91dce028d9d6f4b5be61fdb65a4dd4450713ce5bc5661e355b95e13c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.415214Z","signature_b64":"YqKezdETSkF/OL7ZKUiMDE4D4zVjfF09g/rsX0hiVD9ydjHNEGJPy3L1bGaicH5hb6mu8FhbeHf3Hha347d7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347c49b91dce028d9d6f4b5be61fdb65a4dd4450713ce5bc5661e355b95e13c9","last_reissued_at":"2026-05-18T00:58:20.414641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.414641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.2090","source_version":3,"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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeCuuFEMVAYWCOCRKGIw7GMrKFOFLsJlyd74HiKWRtOmW+Jnc2gcrE3xXLlZ2vbH2kt7IL4+HcKbfpyk1FhAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:15:33.763677Z"},"content_sha256":"50c768098661a527cbc50dc50430243f1b85c37ea0c40b9402c88aad487be109","schema_version":"1.0","event_id":"sha256:50c768098661a527cbc50dc50430243f1b85c37ea0c40b9402c88aad487be109"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:GR6ETOI5ZYBI3HLPJNN6MH63MW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Lucile Sassatelli, Shashi Kiran Chilappagari","submitted_at":"2009-01-14T18:59:53Z","abstract_excerpt":"In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of performance. More complex decoders such as the ones based on belief propagation exhibit superior performance but lead to slower decoders. The approach in this paper is to consider message passing decoders that have larger message alphabet (thereby providing performance improvement) as well as low complexity (thereby ensuring fast decoding). We propose a class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2090","kind":"arxiv","version":3},"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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkIAONfcQ1Y3Phx6DjDFysNOj1HxyM4PXV/NSO3YzRAqcHLJ0FOELCIlo3tTAd3xbN8j3+cCDr0DFHxJGgHCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:15:33.764023Z"},"content_sha256":"6bf0687fabe9b402014f9e76f16434ae4f2d753f76187d257bb4160d0f29e839","schema_version":"1.0","event_id":"sha256:6bf0687fabe9b402014f9e76f16434ae4f2d753f76187d257bb4160d0f29e839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/bundle.json","state_url":"https://pith.science/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/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-04T09:15:33Z","links":{"resolver":"https://pith.science/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW","bundle":"https://pith.science/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/bundle.json","state":"https://pith.science/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR6ETOI5ZYBI3HLPJNN6MH63MW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GR6ETOI5ZYBI3HLPJNN6MH63MW","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":"652c66a23ab0a4323a4874f1848f155b9235102ceb5b5d85a66866448ab093da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T18:59:53Z","title_canon_sha256":"e4a7cc0fa5ded157fe2095b43ebd8b3260be04402cfc1612dc834a46048d5108"},"schema_version":"1.0","source":{"id":"0901.2090","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.2090","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0901.2090v3","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2090","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"GR6ETOI5ZYBI","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GR6ETOI5ZYBI3HLP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GR6ETOI5","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:6bf0687fabe9b402014f9e76f16434ae4f2d753f76187d257bb4160d0f29e839","target":"graph","created_at":"2026-05-18T00:58:20Z","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 consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of performance. More complex decoders such as the ones based on belief propagation exhibit superior performance but lead to slower decoders. The approach in this paper is to consider message passing decoders that have larger message alphabet (thereby providing performance improvement) as well as low complexity (thereby ensuring fast decoding). We propose a class of ","authors_text":"Bane Vasic, David Declercq, Lucile Sassatelli, Shashi Kiran Chilappagari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T18:59:53Z","title":"Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2090","kind":"arxiv","version":3},"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:50c768098661a527cbc50dc50430243f1b85c37ea0c40b9402c88aad487be109","target":"record","created_at":"2026-05-18T00:58:20Z","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":"652c66a23ab0a4323a4874f1848f155b9235102ceb5b5d85a66866448ab093da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-14T18:59:53Z","title_canon_sha256":"e4a7cc0fa5ded157fe2095b43ebd8b3260be04402cfc1612dc834a46048d5108"},"schema_version":"1.0","source":{"id":"0901.2090","kind":"arxiv","version":3}},"canonical_sha256":"347c49b91dce028d9d6f4b5be61fdb65a4dd4450713ce5bc5661e355b95e13c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"347c49b91dce028d9d6f4b5be61fdb65a4dd4450713ce5bc5661e355b95e13c9","first_computed_at":"2026-05-18T00:58:20.414641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.414641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YqKezdETSkF/OL7ZKUiMDE4D4zVjfF09g/rsX0hiVD9ydjHNEGJPy3L1bGaicH5hb6mu8FhbeHf3Hha347d7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.415214Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.2090","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50c768098661a527cbc50dc50430243f1b85c37ea0c40b9402c88aad487be109","sha256:6bf0687fabe9b402014f9e76f16434ae4f2d753f76187d257bb4160d0f29e839"],"state_sha256":"977b1b63ae43de6943174097d80ce9f49188864e7e0f6613a38cfca8f70985c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ju7ubYRvy6X+j6sTD+ZJFo0jy/10Kr3fnxepaqz7v3OsjaaEwpNxVolNTKqNbcaBoXfriBz+NUZbri/JZKs3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:15:33.765981Z","bundle_sha256":"7e376f89ad3179df5bfd856f8bd5e24837e2c54313fc30c6835df7e4c773a485"}}