{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SHPJ5YMZNDXH7TN7X2PQBUYAMK","short_pith_number":"pith:SHPJ5YMZ","canonical_record":{"source":{"id":"1207.4807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3417c6fa63d75075efbdcd1af6d4bb4f64e863dc3a97ff4240fb7b248c36cbd6","abstract_canon_sha256":"4e144dc8b682e8931b04f33c0a7d26165db1913c0473f6a45c3a6f775cb1972a"},"schema_version":"1.0"},"canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","source":{"kind":"arxiv","id":"1207.4807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4807","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4807v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4807","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"SHPJ5YMZNDXH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SHPJ5YMZNDXH7TN7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SHPJ5YMZ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SHPJ5YMZNDXH7TN7X2PQBUYAMK","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3417c6fa63d75075efbdcd1af6d4bb4f64e863dc3a97ff4240fb7b248c36cbd6","abstract_canon_sha256":"4e144dc8b682e8931b04f33c0a7d26165db1913c0473f6a45c3a6f775cb1972a"},"schema_version":"1.0"},"canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.906151Z","signature_b64":"tS1MK9QFjN7dVoO8zsqDIvtGJ+UoN6TghICMdl7OBg6YH3m5WnUxdYsen3lACzHebP9QVoFlaX//yZ7XZrDeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","last_reissued_at":"2026-05-18T00:58:42.905683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.905683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4807","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"At3zsEYcqSKdiQ26nkGKMgQJKFK+a9H8ni1iEX5+8ytdzdAY2Grqjp2CCposHEX84wJbAFaUcq/9qz2ouZXtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:35:47.734980Z"},"content_sha256":"64485245843fa0217db8764f4448db0964a6036699d2ae3507b53849b2923196","schema_version":"1.0","event_id":"sha256:64485245843fa0217db8764f4448db0964a6036699d2ae3507b53849b2923196"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SHPJ5YMZNDXH7TN7X2PQBUYAMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Erbao Li, Shiva Kumar Planjery","submitted_at":"2012-07-19T20:34:30Z","abstract_excerpt":"Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achievable by a FAID on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4807","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RoLJexObACSNktbJziQsBvpXUmZdzNPxUsthGUoqnnV0l9ixVwkBSZwwc85Q7L+wdR3JNYaYC1mmoNQIQ0R3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:35:47.735347Z"},"content_sha256":"f3f8dcb9b832bc150f68f0649d990c4af83b60efec703eec5843dede628157b1","schema_version":"1.0","event_id":"sha256:f3f8dcb9b832bc150f68f0649d990c4af83b60efec703eec5843dede628157b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/bundle.json","state_url":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/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-23T00:35:47Z","links":{"resolver":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK","bundle":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/bundle.json","state":"https://pith.science/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHPJ5YMZNDXH7TN7X2PQBUYAMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SHPJ5YMZNDXH7TN7X2PQBUYAMK","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":"4e144dc8b682e8931b04f33c0a7d26165db1913c0473f6a45c3a6f775cb1972a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","title_canon_sha256":"3417c6fa63d75075efbdcd1af6d4bb4f64e863dc3a97ff4240fb7b248c36cbd6"},"schema_version":"1.0","source":{"id":"1207.4807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4807","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4807v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4807","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"SHPJ5YMZNDXH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SHPJ5YMZNDXH7TN7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SHPJ5YMZ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:f3f8dcb9b832bc150f68f0649d990c4af83b60efec703eec5843dede628157b1","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric channel with much lower complexity. In this paper, we introduce a a novel scheme to further increase the guaranteed error correction capability from what is achievable by a FAID on column-weight-three LDPC codes. The proposed scheme uses a plurality of FAIDs which collectively correct more error patterns than a single FAID on a given code. The collection of FAIDs","authors_text":"Bane Vasic, David Declercq, Erbao Li, Shiva Kumar Planjery","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","title":"Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4807","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:64485245843fa0217db8764f4448db0964a6036699d2ae3507b53849b2923196","target":"record","created_at":"2026-05-18T00:58:42Z","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":"4e144dc8b682e8931b04f33c0a7d26165db1913c0473f6a45c3a6f775cb1972a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:34:30Z","title_canon_sha256":"3417c6fa63d75075efbdcd1af6d4bb4f64e863dc3a97ff4240fb7b248c36cbd6"},"schema_version":"1.0","source":{"id":"1207.4807","kind":"arxiv","version":1}},"canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91de9ee19968ee7fcdbfbe9f00d30062a25719bf9475e96b8429216a4f58dedb","first_computed_at":"2026-05-18T00:58:42.905683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.905683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tS1MK9QFjN7dVoO8zsqDIvtGJ+UoN6TghICMdl7OBg6YH3m5WnUxdYsen3lACzHebP9QVoFlaX//yZ7XZrDeDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.906151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64485245843fa0217db8764f4448db0964a6036699d2ae3507b53849b2923196","sha256:f3f8dcb9b832bc150f68f0649d990c4af83b60efec703eec5843dede628157b1"],"state_sha256":"2562853e48cac87f45b18e99a21c454d936742bcd3b48c3696a794703a45d5a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qW8F71YmWSjWwQ6Amed9YNAa/Ep06leH2G4hJwBvAj3uXSiHjUPbOC98JUG5ovygoHJ8oYi+V2Ab8ecZwCJZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:35:47.737325Z","bundle_sha256":"821fc50502586d37ea66983bf81e192634aaf919437e7fafdfaeea71ef36e326"}}