{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QFVGYQRD6MYJKOXMSVACQYCIX4","short_pith_number":"pith:QFVGYQRD","schema_version":"1.0","canonical_sha256":"816a6c4223f330953aec9540286048bf0b72ddffb5d58309edf9bff83eb65efb","source":{"kind":"arxiv","id":"1012.1425","version":1},"attestation_state":"computed","paper":{"title":"Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Idan Goldenberg","submitted_at":"2010-12-07T07:59:47Z","abstract_excerpt":"We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block length. Third, we propose a method to obtain a tight lower bound on the fractional distance, also with quadratic complexity, and thus less than previously-existing methods. Finally, we show how the fu"},"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":"1012.1425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-07T07:59:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3635292e8fc84c9d03cc4241b94dffe5994d836401f5d02fd1144133a6a6a74f","abstract_canon_sha256":"896f3dffa06ba5aaa18970bfe36d4ca595abfba052a79538adb4c976e536aed9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.255443Z","signature_b64":"MhnDOBP2pTNv9G8Mi/BKeu99/imQBeS99OxWDRlkyOp6nkE1DaHP0kMIv8RyoXYjLmSM2esjhB3jXxizRU9TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816a6c4223f330953aec9540286048bf0b72ddffb5d58309edf9bff83eb65efb","last_reissued_at":"2026-05-18T00:58:19.254734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.254734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Burshtein, Idan Goldenberg","submitted_at":"2010-12-07T07:59:47Z","abstract_excerpt":"We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block length. Third, we propose a method to obtain a tight lower bound on the fractional distance, also with quadratic complexity, and thus less than previously-existing methods. Finally, we show how the fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1425","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":"1012.1425","created_at":"2026-05-18T00:58:19.254848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1425v1","created_at":"2026-05-18T00:58:19.254848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1425","created_at":"2026-05-18T00:58:19.254848+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFVGYQRD6MYJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFVGYQRD6MYJKOXM","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFVGYQRD","created_at":"2026-05-18T12:26:12.377268+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/QFVGYQRD6MYJKOXMSVACQYCIX4","json":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4.json","graph_json":"https://pith.science/api/pith-number/QFVGYQRD6MYJKOXMSVACQYCIX4/graph.json","events_json":"https://pith.science/api/pith-number/QFVGYQRD6MYJKOXMSVACQYCIX4/events.json","paper":"https://pith.science/paper/QFVGYQRD"},"agent_actions":{"view_html":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4","download_json":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4.json","view_paper":"https://pith.science/paper/QFVGYQRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1425&json=true","fetch_graph":"https://pith.science/api/pith-number/QFVGYQRD6MYJKOXMSVACQYCIX4/graph.json","fetch_events":"https://pith.science/api/pith-number/QFVGYQRD6MYJKOXMSVACQYCIX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4/action/storage_attestation","attest_author":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4/action/author_attestation","sign_citation":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4/action/citation_signature","submit_replication":"https://pith.science/pith/QFVGYQRD6MYJKOXMSVACQYCIX4/action/replication_record"}},"created_at":"2026-05-18T00:58:19.254848+00:00","updated_at":"2026-05-18T00:58:19.254848+00:00"}