{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SBZXREJFKNFHKEXCM3D572XR6W","short_pith_number":"pith:SBZXREJF","canonical_record":{"source":{"id":"1202.1337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T03:01:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be98769428e836808adb0897286590dc905cae97668b30fc9bec60c487aa952d","abstract_canon_sha256":"55e3dfd6c2a1235b4b6034c14692c19ca2c3eeef1bac357a529c3190bd7426cd"},"schema_version":"1.0"},"canonical_sha256":"9073789125534a7512e266c7dfeaf1f5b279291a983125ac3b764965ec515109","source":{"kind":"arxiv","id":"1202.1337","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1337","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1337v2","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1337","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"SBZXREJFKNFH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBZXREJFKNFHKEXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBZXREJF","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SBZXREJFKNFHKEXCM3D572XR6W","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T03:01:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be98769428e836808adb0897286590dc905cae97668b30fc9bec60c487aa952d","abstract_canon_sha256":"55e3dfd6c2a1235b4b6034c14692c19ca2c3eeef1bac357a529c3190bd7426cd"},"schema_version":"1.0"},"canonical_sha256":"9073789125534a7512e266c7dfeaf1f5b279291a983125ac3b764965ec515109","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:37.376011Z","signature_b64":"MoY+fOpq61uH2NnJ2PKsf4zwa8ew2hHnKum4NZ5lCpqfV8sTyisvGQAaMXNhHpLgAf8my7hTPUfJfWu0tpqBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9073789125534a7512e266c7dfeaf1f5b279291a983125ac3b764965ec515109","last_reissued_at":"2026-05-18T03:50:37.375363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:37.375363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1337","source_version":2,"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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iimbpqiC7ZJY6OCQcn69fdcantOLXu9u5vdi+gqQ9paLgHP/EQ+tR1QUD1zI+uyqiDdSkSHIYi8v77Pt0tK5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:24:50.744471Z"},"content_sha256":"b0a9d3d6f3fd9e231ab34155b6918811cb4146c31b3fd35e04853a857cae9f97","schema_version":"1.0","event_id":"sha256:b0a9d3d6f3fd9e231ab34155b6918811cb4146c31b3fd35e04853a857cae9f97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SBZXREJFKNFHKEXCM3D572XR6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Shiva Kumar Planjery","submitted_at":"2012-02-07T03:01:42Z","abstract_excerpt":"Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1337","kind":"arxiv","version":2},"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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmZxm5J7+K1UA1g20fkmTF1lKSXGsgRKYaO+RymbQpHRNuLlgGSY+vm1NfKiIhWPOxafSv8d4fuFjLDPiKneCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:24:50.744818Z"},"content_sha256":"aa0b6c96d345fb4a6f34b288aad322df911a219d557928b81de0c950525aad76","schema_version":"1.0","event_id":"sha256:aa0b6c96d345fb4a6f34b288aad322df911a219d557928b81de0c950525aad76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBZXREJFKNFHKEXCM3D572XR6W/bundle.json","state_url":"https://pith.science/pith/SBZXREJFKNFHKEXCM3D572XR6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBZXREJFKNFHKEXCM3D572XR6W/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-22T23:24:50Z","links":{"resolver":"https://pith.science/pith/SBZXREJFKNFHKEXCM3D572XR6W","bundle":"https://pith.science/pith/SBZXREJFKNFHKEXCM3D572XR6W/bundle.json","state":"https://pith.science/pith/SBZXREJFKNFHKEXCM3D572XR6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBZXREJFKNFHKEXCM3D572XR6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SBZXREJFKNFHKEXCM3D572XR6W","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":"55e3dfd6c2a1235b4b6034c14692c19ca2c3eeef1bac357a529c3190bd7426cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T03:01:42Z","title_canon_sha256":"be98769428e836808adb0897286590dc905cae97668b30fc9bec60c487aa952d"},"schema_version":"1.0","source":{"id":"1202.1337","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1337","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1337v2","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1337","created_at":"2026-05-18T03:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"SBZXREJFKNFH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SBZXREJFKNFHKEXC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SBZXREJF","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:aa0b6c96d345fb4a6f34b288aad322df911a219d557928b81de0c950525aad76","target":"graph","created_at":"2026-05-18T03:50:37Z","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":"Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. ","authors_text":"Bane Vasic, David Declercq, Shiva Kumar Planjery","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T03:01:42Z","title":"Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1337","kind":"arxiv","version":2},"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:b0a9d3d6f3fd9e231ab34155b6918811cb4146c31b3fd35e04853a857cae9f97","target":"record","created_at":"2026-05-18T03:50:37Z","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":"55e3dfd6c2a1235b4b6034c14692c19ca2c3eeef1bac357a529c3190bd7426cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T03:01:42Z","title_canon_sha256":"be98769428e836808adb0897286590dc905cae97668b30fc9bec60c487aa952d"},"schema_version":"1.0","source":{"id":"1202.1337","kind":"arxiv","version":2}},"canonical_sha256":"9073789125534a7512e266c7dfeaf1f5b279291a983125ac3b764965ec515109","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9073789125534a7512e266c7dfeaf1f5b279291a983125ac3b764965ec515109","first_computed_at":"2026-05-18T03:50:37.375363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:37.375363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MoY+fOpq61uH2NnJ2PKsf4zwa8ew2hHnKum4NZ5lCpqfV8sTyisvGQAaMXNhHpLgAf8my7hTPUfJfWu0tpqBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:37.376011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1337","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0a9d3d6f3fd9e231ab34155b6918811cb4146c31b3fd35e04853a857cae9f97","sha256:aa0b6c96d345fb4a6f34b288aad322df911a219d557928b81de0c950525aad76"],"state_sha256":"5c1d6d3776657771c64f6577982c5ca8de2d57957cc0ec2231ff46a98dd4f1f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDA5wzsUT//q7GZ/O0OXtKTNVXuz84dZ11oBJaJM9mZ8sNqg9yq65IbSmX2nNh+4Q18xtAUwIInkLIf+5eKLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:24:50.746777Z","bundle_sha256":"19e162de2da5f30be95101f7b5644b844df97b5d905e489ffc340b232da8795a"}}