{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B6LWLKKOHYGTI2YNM2P7FOZMFS","short_pith_number":"pith:B6LWLKKO","schema_version":"1.0","canonical_sha256":"0f9765a94e3e0d346b0d669ff2bb2c2c8e68c1eb56036a6b871cb7df6aa33ab0","source":{"kind":"arxiv","id":"1411.7554","version":3},"attestation_state":"computed","paper":{"title":"Impact of redundant checks on the LP decoding thresholds of LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hani Audah, Louay Bazzi","submitted_at":"2014-11-27T11:26:18Z","abstract_excerpt":"Feldman et al.(2005) asked whether the performance of the LP decoder can be improved by adding redundant parity checks to tighten the LP relaxation. We prove that for LDPC codes, even if we include all redundant checks, asymptotically there is no gain in the LP decoder threshold on the BSC under certain conditions on the base Tanner graph. First, we show that if the graph has bounded check-degree and satisfies a condition which we call asymptotic strength, then including high degree redundant checks in the LP does not significantly improve the threshold in the following sense: for each constan"},"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":"1411.7554","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-27T11:26:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a02ab46db61ef8dfe0d1cf24b643e911d5dc2dca37ae35e7178af28187628184","abstract_canon_sha256":"a80fdc19c6d78864072bc2a6b7eea5e9faa7597f6583cf815d4d8fd6a297e01f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:00.745177Z","signature_b64":"QR4n/T154AVesobmAhXlvJS2oAYiKthTfesciEJtklqGDS4MLYWit/hoe5COyzp32KR8xMCUeR9JZyupz6KpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f9765a94e3e0d346b0d669ff2bb2c2c8e68c1eb56036a6b871cb7df6aa33ab0","last_reissued_at":"2026-05-18T02:19:00.744702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:00.744702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impact of redundant checks on the LP decoding thresholds of LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hani Audah, Louay Bazzi","submitted_at":"2014-11-27T11:26:18Z","abstract_excerpt":"Feldman et al.(2005) asked whether the performance of the LP decoder can be improved by adding redundant parity checks to tighten the LP relaxation. We prove that for LDPC codes, even if we include all redundant checks, asymptotically there is no gain in the LP decoder threshold on the BSC under certain conditions on the base Tanner graph. First, we show that if the graph has bounded check-degree and satisfies a condition which we call asymptotic strength, then including high degree redundant checks in the LP does not significantly improve the threshold in the following sense: for each constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7554","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.7554","created_at":"2026-05-18T02:19:00.744772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7554v3","created_at":"2026-05-18T02:19:00.744772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7554","created_at":"2026-05-18T02:19:00.744772+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6LWLKKOHYGT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6LWLKKOHYGTI2YN","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6LWLKKO","created_at":"2026-05-18T12:28:22.404517+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/B6LWLKKOHYGTI2YNM2P7FOZMFS","json":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS.json","graph_json":"https://pith.science/api/pith-number/B6LWLKKOHYGTI2YNM2P7FOZMFS/graph.json","events_json":"https://pith.science/api/pith-number/B6LWLKKOHYGTI2YNM2P7FOZMFS/events.json","paper":"https://pith.science/paper/B6LWLKKO"},"agent_actions":{"view_html":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS","download_json":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS.json","view_paper":"https://pith.science/paper/B6LWLKKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7554&json=true","fetch_graph":"https://pith.science/api/pith-number/B6LWLKKOHYGTI2YNM2P7FOZMFS/graph.json","fetch_events":"https://pith.science/api/pith-number/B6LWLKKOHYGTI2YNM2P7FOZMFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS/action/storage_attestation","attest_author":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS/action/author_attestation","sign_citation":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS/action/citation_signature","submit_replication":"https://pith.science/pith/B6LWLKKOHYGTI2YNM2P7FOZMFS/action/replication_record"}},"created_at":"2026-05-18T02:19:00.744772+00:00","updated_at":"2026-05-18T02:19:00.744772+00:00"}