{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4AFV4BXVSO7BZEKLMENCHKCMBH","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":"70a2f7427f4b2d384dfa3a6fa5ab14ad23c8020fdf78c13eb4c188025ca41c4d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T14:55:42Z","title_canon_sha256":"d917a583a8c8ec3e5e6de3caed8e7c091ddfd29c0039c3b56e48449f97c0a876"},"schema_version":"1.0","source":{"id":"1403.4118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4118","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4118v2","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4118","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"4AFV4BXVSO7B","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4AFV4BXVSO7BZEKL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4AFV4BXV","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:22ba43e2e238c7a0101459de56c6a17b0d2570954dd207c8a47983c3198fee7d","target":"graph","created_at":"2026-05-18T02:53:07Z","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":"In this work, we consider efficient maximum-likelihood decoding of linear block codes for small-to-moderate block lengths. The presented approach is a branch-and-bound algorithm using the cutting-plane approach of Zhang and Siegel (IEEE Trans. Inf. Theory, 2012) for obtaining lower bounds. We have compared our proposed algorithm to the state-of-the-art commercial integer program solver CPLEX, and for all considered codes our approach is faster for both low and high signal-to-noise ratios. For instance, for the benchmark (155,64) Tanner code our algorithm is more than 11 times as fast as CPLEX ","authors_text":"Eirik Rosnes, Michael Helmling, Stefan Ruzika, Stefan Scholl","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T14:55:42Z","title":"Efficient Maximum-Likelihood Decoding of Linear Block Codes on Binary Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4118","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:387abc6dc6f7e9c545ed7da5eb2072beefa8c1a944b4a8b9e27e119b1ada4e4f","target":"record","created_at":"2026-05-18T02:53:07Z","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":"70a2f7427f4b2d384dfa3a6fa5ab14ad23c8020fdf78c13eb4c188025ca41c4d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-17T14:55:42Z","title_canon_sha256":"d917a583a8c8ec3e5e6de3caed8e7c091ddfd29c0039c3b56e48449f97c0a876"},"schema_version":"1.0","source":{"id":"1403.4118","kind":"arxiv","version":2}},"canonical_sha256":"e00b5e06f593be1c914b611a23a84c09c6ddd4b33807bce8f59e18e556ff356d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e00b5e06f593be1c914b611a23a84c09c6ddd4b33807bce8f59e18e556ff356d","first_computed_at":"2026-05-18T02:53:07.087756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.087756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHnSAxvgI+3iFQ5he8bdcsWS4kWpEXTEtqb1Ofh0/gUFsUkpjiU9Tq9pU1+DlXSv3xugarP21/805MfGVNoJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.088390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:387abc6dc6f7e9c545ed7da5eb2072beefa8c1a944b4a8b9e27e119b1ada4e4f","sha256:22ba43e2e238c7a0101459de56c6a17b0d2570954dd207c8a47983c3198fee7d"],"state_sha256":"29efff880a904c190901a696226ac5d84341403ced7faea4c141dd0fd24cd1f9"}