{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OQNQHL3PSXEE257XPK32HI4WBS","short_pith_number":"pith:OQNQHL3P","schema_version":"1.0","canonical_sha256":"741b03af6f95c84d77f77ab7a3a3960cb660dd8bd88d3244c16dcc93c63560ae","source":{"kind":"arxiv","id":"1705.09507","version":1},"attestation_state":"computed","paper":{"title":"BP-LED decoding algorithm for LDPC codes over AWGN channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Irina E. Bocharova, Vitaly Skachek, Yauhen Yakimenka","submitted_at":"2017-05-26T10:02:54Z","abstract_excerpt":"A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed belief-propagation--list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received vector and a new erasure decoding algorithm are proposed. The new erasure decoding algorithm, called list erasure decoding, combines ML decoding over the BEC with list decoding applied if the ML decoder"},"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":"1705.09507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-26T10:02:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4dc834fc2610b56adf3deff272aab1f3188aa30285f92a5e5c86940d8f7b0f5","abstract_canon_sha256":"2ed2ef161a3640b46cef03a3e082fdb1f68b8a7ea86ff5a962f7ce468b35c5c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.504755Z","signature_b64":"JeO43J0tzuNC0T54VxJ2L89Bb9KRaLH+VdF2UnJ6sDk1qKiyJuPonDAgJu/ON+Izj+I3ccJXaVByt/x06uT4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"741b03af6f95c84d77f77ab7a3a3960cb660dd8bd88d3244c16dcc93c63560ae","last_reissued_at":"2026-05-18T00:43:38.504162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.504162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BP-LED decoding algorithm for LDPC codes over AWGN channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Irina E. Bocharova, Vitaly Skachek, Yauhen Yakimenka","submitted_at":"2017-05-26T10:02:54Z","abstract_excerpt":"A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed belief-propagation--list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received vector and a new erasure decoding algorithm are proposed. The new erasure decoding algorithm, called list erasure decoding, combines ML decoding over the BEC with list decoding applied if the ML decoder"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09507","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":"1705.09507","created_at":"2026-05-18T00:43:38.504250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09507v1","created_at":"2026-05-18T00:43:38.504250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09507","created_at":"2026-05-18T00:43:38.504250+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQNQHL3PSXEE","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQNQHL3PSXEE257X","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQNQHL3P","created_at":"2026-05-18T12:31:34.259226+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/OQNQHL3PSXEE257XPK32HI4WBS","json":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS.json","graph_json":"https://pith.science/api/pith-number/OQNQHL3PSXEE257XPK32HI4WBS/graph.json","events_json":"https://pith.science/api/pith-number/OQNQHL3PSXEE257XPK32HI4WBS/events.json","paper":"https://pith.science/paper/OQNQHL3P"},"agent_actions":{"view_html":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS","download_json":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS.json","view_paper":"https://pith.science/paper/OQNQHL3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09507&json=true","fetch_graph":"https://pith.science/api/pith-number/OQNQHL3PSXEE257XPK32HI4WBS/graph.json","fetch_events":"https://pith.science/api/pith-number/OQNQHL3PSXEE257XPK32HI4WBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS/action/storage_attestation","attest_author":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS/action/author_attestation","sign_citation":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS/action/citation_signature","submit_replication":"https://pith.science/pith/OQNQHL3PSXEE257XPK32HI4WBS/action/replication_record"}},"created_at":"2026-05-18T00:43:38.504250+00:00","updated_at":"2026-05-18T00:43:38.504250+00:00"}