{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QFVGYQRD6MYJKOXMSVACQYCIX4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"896f3dffa06ba5aaa18970bfe36d4ca595abfba052a79538adb4c976e536aed9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-07T07:59:47Z","title_canon_sha256":"3635292e8fc84c9d03cc4241b94dffe5994d836401f5d02fd1144133a6a6a74f"},"schema_version":"1.0","source":{"id":"1012.1425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1425","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1425v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1425","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"QFVGYQRD6MYJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFVGYQRD6MYJKOXM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFVGYQRD","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:ad8fc9000e2533a7a8956557acd05117522958dfd12992a6e2bff51e9478d338","target":"graph","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David Burshtein, Idan Goldenberg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-07T07:59:47Z","title":"Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1425","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a83b44c61020edd97c23d9c5f1dfad9d6c5d687283204a9d1e824c40a546d019","target":"record","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"896f3dffa06ba5aaa18970bfe36d4ca595abfba052a79538adb4c976e536aed9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-07T07:59:47Z","title_canon_sha256":"3635292e8fc84c9d03cc4241b94dffe5994d836401f5d02fd1144133a6a6a74f"},"schema_version":"1.0","source":{"id":"1012.1425","kind":"arxiv","version":1}},"canonical_sha256":"816a6c4223f330953aec9540286048bf0b72ddffb5d58309edf9bff83eb65efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"816a6c4223f330953aec9540286048bf0b72ddffb5d58309edf9bff83eb65efb","first_computed_at":"2026-05-18T00:58:19.254734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.254734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhnDOBP2pTNv9G8Mi/BKeu99/imQBeS99OxWDRlkyOp6nkE1DaHP0kMIv8RyoXYjLmSM2esjhB3jXxizRU9TDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.255443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a83b44c61020edd97c23d9c5f1dfad9d6c5d687283204a9d1e824c40a546d019","sha256:ad8fc9000e2533a7a8956557acd05117522958dfd12992a6e2bff51e9478d338"],"state_sha256":"e47253ea11dde75c6445f74e03987eb5cb647e3065b4094219ed5b371042d8fd"}