{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CFI3VPZQN57LTVEJ7XY5FOIHRO","short_pith_number":"pith:CFI3VPZQ","schema_version":"1.0","canonical_sha256":"1151babf306f7eb9d489fdf1d2b9078bb1fad027d13c17a3a1952e6ef96492e7","source":{"kind":"arxiv","id":"1806.01050","version":2},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of Blind Detection of Binary Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas","submitted_at":"2018-06-04T11:28:39Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.01050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-04T11:28:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61fddeeeadfe7f3c4726dc3187c86e7943b6402c80ed3df71eeb30dedbdfcee5","abstract_canon_sha256":"efa74a3812cc65736c8b5321b6da6d28357f525e0cac6062e8d0df8e94f625ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:17.599194Z","signature_b64":"APOBmvC3ZH1k+ebR+QvbHc16x6gKGe8NojR2qLWSMhP7yAEWLWEap/it7aolyKxMObRypMNmXT+y8Z3m/7LgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1151babf306f7eb9d489fdf1d2b9078bb1fad027d13c17a3a1952e6ef96492e7","last_reissued_at":"2026-05-17T23:49:17.598467Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:17.598467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Blind Detection of Binary Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas","submitted_at":"2018-06-04T11:28:39Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01050","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01050","created_at":"2026-05-17T23:49:17.598581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01050v2","created_at":"2026-05-17T23:49:17.598581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01050","created_at":"2026-05-17T23:49:17.598581+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFI3VPZQN57L","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFI3VPZQN57LTVEJ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFI3VPZQ","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO","json":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO.json","graph_json":"https://pith.science/api/pith-number/CFI3VPZQN57LTVEJ7XY5FOIHRO/graph.json","events_json":"https://pith.science/api/pith-number/CFI3VPZQN57LTVEJ7XY5FOIHRO/events.json","paper":"https://pith.science/paper/CFI3VPZQ"},"agent_actions":{"view_html":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO","download_json":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO.json","view_paper":"https://pith.science/paper/CFI3VPZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01050&json=true","fetch_graph":"https://pith.science/api/pith-number/CFI3VPZQN57LTVEJ7XY5FOIHRO/graph.json","fetch_events":"https://pith.science/api/pith-number/CFI3VPZQN57LTVEJ7XY5FOIHRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO/action/storage_attestation","attest_author":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO/action/author_attestation","sign_citation":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO/action/citation_signature","submit_replication":"https://pith.science/pith/CFI3VPZQN57LTVEJ7XY5FOIHRO/action/replication_record"}},"created_at":"2026-05-17T23:49:17.598581+00:00","updated_at":"2026-05-17T23:49:17.598581+00:00"}