{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CFI3VPZQN57LTVEJ7XY5FOIHRO","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":"efa74a3812cc65736c8b5321b6da6d28357f525e0cac6062e8d0df8e94f625ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T11:28:39Z","title_canon_sha256":"61fddeeeadfe7f3c4726dc3187c86e7943b6402c80ed3df71eeb30dedbdfcee5"},"schema_version":"1.0","source":{"id":"1806.01050","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01050","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01050v2","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01050","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"CFI3VPZQN57L","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFI3VPZQN57LTVEJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFI3VPZQ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:f6f8596ba56b8641bc4380554707f2860554c2b4478e9295a6165f3be3701297","target":"graph","created_at":"2026-05-17T23:49:17Z","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 study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes $\\mathcal{C}$ of a given dimension $k$, for which the sum of distances between the observations and the code is minimized. We prove that, for the practically relevant case when the set $\\mathcal{C}$ only contains a fixed number of candidate linear codes, the detection problem is NP-hard and we identify a number of interesting open questions related to the code detection problem.","authors_text":"Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T11:28:39Z","title":"On the Computational Complexity of Blind Detection of Binary Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01050","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:82f89015ba034c07885fc9204359161c4dadc477f2a27b168f22d33133da3c02","target":"record","created_at":"2026-05-17T23:49:17Z","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":"efa74a3812cc65736c8b5321b6da6d28357f525e0cac6062e8d0df8e94f625ff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T11:28:39Z","title_canon_sha256":"61fddeeeadfe7f3c4726dc3187c86e7943b6402c80ed3df71eeb30dedbdfcee5"},"schema_version":"1.0","source":{"id":"1806.01050","kind":"arxiv","version":2}},"canonical_sha256":"1151babf306f7eb9d489fdf1d2b9078bb1fad027d13c17a3a1952e6ef96492e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1151babf306f7eb9d489fdf1d2b9078bb1fad027d13c17a3a1952e6ef96492e7","first_computed_at":"2026-05-17T23:49:17.598467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:17.598467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APOBmvC3ZH1k+ebR+QvbHc16x6gKGe8NojR2qLWSMhP7yAEWLWEap/it7aolyKxMObRypMNmXT+y8Z3m/7LgDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:17.599194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01050","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82f89015ba034c07885fc9204359161c4dadc477f2a27b168f22d33133da3c02","sha256:f6f8596ba56b8641bc4380554707f2860554c2b4478e9295a6165f3be3701297"],"state_sha256":"339098243c407a4487ff4176cc1d5b62463626a8f84347755b1333abc1bff073"}