{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W22T6OQOMDI5EHUESD7WH7HCPF","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":"3354b2d6ff342ccdd23d2e25243bcdd1e898e798671fe27172c4c9e5c6ed6659","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T23:36:08Z","title_canon_sha256":"f93a20e8963357bcfb6da5a776b718c935ffaa13b9f531ddc3cc54802fc99ff6"},"schema_version":"1.0","source":{"id":"1204.0556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0556","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0556v2","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0556","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"W22T6OQOMDI5","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W22T6OQOMDI5EHUE","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W22T6OQO","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:0927c14212cbbdbde3b6fd25aee57f4f4c1c127e3035b5888e4dc6d4ccbc322b","target":"graph","created_at":"2026-05-18T03:12:35Z","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":"When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be used to decode error-correcting codes at bit-error-rates comparable to state-of-the-art belief propagation (BP) decoders, but with significantly stronger theoretical guarantees. However, LP decoding when implemented with standard LP solvers does not easily scale to the block lengths of modern error correcting codes. In this paper we draw on decomposition methods from optimization theory, specifica","authors_text":"Benjamin Recht, Siddharth Barman, Stark C. Draper, Xishuo Liu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T23:36:08Z","title":"Decomposition Methods for Large Scale LP Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0556","kind":"arxiv","version":2},"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:e98a35f476a3f06cf647ab60b0fb41cbc012f854353cfc3fbd688b69a7c25ba2","target":"record","created_at":"2026-05-18T03:12:35Z","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":"3354b2d6ff342ccdd23d2e25243bcdd1e898e798671fe27172c4c9e5c6ed6659","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-02T23:36:08Z","title_canon_sha256":"f93a20e8963357bcfb6da5a776b718c935ffaa13b9f531ddc3cc54802fc99ff6"},"schema_version":"1.0","source":{"id":"1204.0556","kind":"arxiv","version":2}},"canonical_sha256":"b6b53f3a0e60d1d21e8490ff63fce2797fb697c669ccb7b16740f677f45d5a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6b53f3a0e60d1d21e8490ff63fce2797fb697c669ccb7b16740f677f45d5a7b","first_computed_at":"2026-05-18T03:12:35.229920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:35.229920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g60B9LwVvuYtwjMvGAGNyJrDR3A/PgjOP5xaFzZ+K/OIesdmYhTqVnN1a+Bb6l38N8yDsmZJpViSViYfTkGYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:35.230850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e98a35f476a3f06cf647ab60b0fb41cbc012f854353cfc3fbd688b69a7c25ba2","sha256:0927c14212cbbdbde3b6fd25aee57f4f4c1c127e3035b5888e4dc6d4ccbc322b"],"state_sha256":"8d58cd77a662b7d715483edff2fca06d13c382abb6b843129a14ca0206e92079"}