{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:75QQTEHNJKSJG7QDELXHGMLNJB","short_pith_number":"pith:75QQTEHN","schema_version":"1.0","canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","source":{"kind":"arxiv","id":"1410.4241","version":1},"attestation_state":"computed","paper":{"title":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, Euiwoong Lee","submitted_at":"2014-10-15T21:45:59Z","abstract_excerpt":"Random (dv,dc)-regular LDPC codes are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv and dc) under exponential time decoding. However, polynomial time algorithms are only known to correct a much smaller fraction of errors. One of the most powerful polynomial-time algorithms with a formal analysis is the LP decoding algorithm of Feldman et al. which is known to correct an Omega(1/dc) fraction of errors. In this work, we show that fairly powerful extensions of LP decoding, based on the Sherali-Adams and Lasserre hierarchies, fail to correct "},"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":"1410.4241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T21:45:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"288769096693c185554d9ce3bb7aea10cfd10beaffe06743c4496db2bac793cf","abstract_canon_sha256":"997e1f3a07e562e6ac1a47a7a7037516ed00ca3059afed3d9369c833ec32ec81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.589797Z","signature_b64":"ShdTyzNQZzS2vnX7CNoPiUwvyVB3FSCrCSUpQ7hFql3S/p1hInYW0cggmlvyiGILKaXlosgUEBwn7SE1bYehDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff610990ed4aa4937e0322ee73316d487bb7e9d5bea276af7bcb867886602a29","last_reissued_at":"2026-05-18T02:39:56.589287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.589287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Badih Ghazi, Euiwoong Lee","submitted_at":"2014-10-15T21:45:59Z","abstract_excerpt":"Random (dv,dc)-regular LDPC codes are well-known to achieve the Shannon capacity of the binary symmetric channel (for sufficiently large dv and dc) under exponential time decoding. However, polynomial time algorithms are only known to correct a much smaller fraction of errors. One of the most powerful polynomial-time algorithms with a formal analysis is the LP decoding algorithm of Feldman et al. which is known to correct an Omega(1/dc) fraction of errors. In this work, we show that fairly powerful extensions of LP decoding, based on the Sherali-Adams and Lasserre hierarchies, fail to correct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4241","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":"1410.4241","created_at":"2026-05-18T02:39:56.589377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4241v1","created_at":"2026-05-18T02:39:56.589377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4241","created_at":"2026-05-18T02:39:56.589377+00:00"},{"alias_kind":"pith_short_12","alias_value":"75QQTEHNJKSJ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"75QQTEHNJKSJG7QD","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"75QQTEHN","created_at":"2026-05-18T12:28:16.859392+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/75QQTEHNJKSJG7QDELXHGMLNJB","json":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB.json","graph_json":"https://pith.science/api/pith-number/75QQTEHNJKSJG7QDELXHGMLNJB/graph.json","events_json":"https://pith.science/api/pith-number/75QQTEHNJKSJG7QDELXHGMLNJB/events.json","paper":"https://pith.science/paper/75QQTEHN"},"agent_actions":{"view_html":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB","download_json":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB.json","view_paper":"https://pith.science/paper/75QQTEHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4241&json=true","fetch_graph":"https://pith.science/api/pith-number/75QQTEHNJKSJG7QDELXHGMLNJB/graph.json","fetch_events":"https://pith.science/api/pith-number/75QQTEHNJKSJG7QDELXHGMLNJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/action/storage_attestation","attest_author":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/action/author_attestation","sign_citation":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/action/citation_signature","submit_replication":"https://pith.science/pith/75QQTEHNJKSJG7QDELXHGMLNJB/action/replication_record"}},"created_at":"2026-05-18T02:39:56.589377+00:00","updated_at":"2026-05-18T02:39:56.589377+00:00"}