{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5COJL2EAY4P7LFYBEL3LVPKOIK","short_pith_number":"pith:5COJL2EA","schema_version":"1.0","canonical_sha256":"e89c95e880c71ff5970122f6babd4e42b9cde678e5e422b08a06c835c1aa1748","source":{"kind":"arxiv","id":"1207.4800","version":1},"attestation_state":"computed","paper":{"title":"Finite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Ludovic Danjean, Shiva Kumar Planjery","submitted_at":"2012-07-19T20:04:58Z","abstract_excerpt":"We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the Belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be prese"},"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":"1207.4800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T20:04:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a091ca1e109600502aaf875fc6cbc0b9994637fa00e0c60d19e246be3e770240","abstract_canon_sha256":"5dd1263de794bd0540b9215a641385088eb0609e30a8f7270ec8c2194cccd9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.144921Z","signature_b64":"suC/tXasugl14yMnmAZhCaMT4Cw5Zk9wvG2Buw2clgv0cwIY58y5Hz8p8gv2FVQTNI1nBCkCNlVKCJLqJxLxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89c95e880c71ff5970122f6babd4e42b9cde678e5e422b08a06c835c1aa1748","last_reissued_at":"2026-05-18T03:50:35.144193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.144193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, David Declercq, Ludovic Danjean, Shiva Kumar Planjery","submitted_at":"2012-07-19T20:04:58Z","abstract_excerpt":"We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the Belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or log-likelihoods and the variable node update functions do not mimic the BP decoder. Rather, the update functions are maps designed using the knowledge of potentially harmful subgraphs that could be prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4800","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":"1207.4800","created_at":"2026-05-18T03:50:35.144307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4800v1","created_at":"2026-05-18T03:50:35.144307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4800","created_at":"2026-05-18T03:50:35.144307+00:00"},{"alias_kind":"pith_short_12","alias_value":"5COJL2EAY4P7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5COJL2EAY4P7LFYB","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5COJL2EA","created_at":"2026-05-18T12:26:53.410803+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/5COJL2EAY4P7LFYBEL3LVPKOIK","json":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK.json","graph_json":"https://pith.science/api/pith-number/5COJL2EAY4P7LFYBEL3LVPKOIK/graph.json","events_json":"https://pith.science/api/pith-number/5COJL2EAY4P7LFYBEL3LVPKOIK/events.json","paper":"https://pith.science/paper/5COJL2EA"},"agent_actions":{"view_html":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK","download_json":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK.json","view_paper":"https://pith.science/paper/5COJL2EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4800&json=true","fetch_graph":"https://pith.science/api/pith-number/5COJL2EAY4P7LFYBEL3LVPKOIK/graph.json","fetch_events":"https://pith.science/api/pith-number/5COJL2EAY4P7LFYBEL3LVPKOIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK/action/storage_attestation","attest_author":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK/action/author_attestation","sign_citation":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK/action/citation_signature","submit_replication":"https://pith.science/pith/5COJL2EAY4P7LFYBEL3LVPKOIK/action/replication_record"}},"created_at":"2026-05-18T03:50:35.144307+00:00","updated_at":"2026-05-18T03:50:35.144307+00:00"}