{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DWA63BR64FBFN26G3WLQCUB5GS","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":"e2f64145d5ec8a94312c5d1df708eaac73ad12a2caf9d4be0c3c37452a497df7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-03T22:42:32Z","title_canon_sha256":"49e0653a4b987ab4749b8ceadc1d9d9749da7889098dbb6ea8e7812583f3e2eb"},"schema_version":"1.0","source":{"id":"1105.0703","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0703","created_at":"2026-05-18T03:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0703v3","created_at":"2026-05-18T03:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0703","created_at":"2026-05-18T03:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"DWA63BR64FBF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DWA63BR64FBFN26G","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DWA63BR6","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:23eef74c139c15f7609f450a7179378de150b23963e92247b2f5b550fed05b04","target":"graph","created_at":"2026-05-18T03:37:41Z","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":"Linear programming (LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of box constraints together with a set of linear inequalities called \"parity inequalities\" that are derived from the constraints represented by the rows of a parity-check matrix of the code and can be added iteratively and adaptively. In this paper, we first derive a new necessary condition and a new sufficient condition for a violated parity inequality constr","authors_text":"Paul H. Siegel, Xiaojie Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-03T22:42:32Z","title":"Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0703","kind":"arxiv","version":3},"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:59db2c51e184175a367420dcce0459ac5fa4ae9d21dbf88d260ce87bdc95ee28","target":"record","created_at":"2026-05-18T03:37:41Z","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":"e2f64145d5ec8a94312c5d1df708eaac73ad12a2caf9d4be0c3c37452a497df7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-03T22:42:32Z","title_canon_sha256":"49e0653a4b987ab4749b8ceadc1d9d9749da7889098dbb6ea8e7812583f3e2eb"},"schema_version":"1.0","source":{"id":"1105.0703","kind":"arxiv","version":3}},"canonical_sha256":"1d81ed863ee14256ebc6dd9701503d3485ddcd76bc2410ac0a0bd5e88ae28401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d81ed863ee14256ebc6dd9701503d3485ddcd76bc2410ac0a0bd5e88ae28401","first_computed_at":"2026-05-18T03:37:41.871106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:41.871106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35O6zB/zplUpUKRPT8yMu2fH2/0OPpRFXumNYrr3PVZ6NdfWWvFy7K/7trp/wS7r3uKr8VtXbzgziG/YxcZVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:41.871569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0703","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59db2c51e184175a367420dcce0459ac5fa4ae9d21dbf88d260ce87bdc95ee28","sha256:23eef74c139c15f7609f450a7179378de150b23963e92247b2f5b550fed05b04"],"state_sha256":"cdc00ff4bd6138e8ffad3819a34e3057422be5c015b9b9743b117186295f367c"}