{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5MGEBJFVSQKITRVVNIFNWAU2OI","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":"12312f56d49de96bfc420296e55f23824a7c6ca1e76dbda2178cdbde9ab06c94","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T18:08:20Z","title_canon_sha256":"847f7638100f565722710d2df3e23cdb1fc1226adee8990b83b420a768969177"},"schema_version":"1.0","source":{"id":"1108.4664","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4664","created_at":"2026-05-18T04:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4664v3","created_at":"2026-05-18T04:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4664","created_at":"2026-05-18T04:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"5MGEBJFVSQKI","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5MGEBJFVSQKITRVV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5MGEBJFV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:9e94c1a203d8a34e52d2753c3a8bc44e7707e6443b9210e7de959ded07570887","target":"graph","created_at":"2026-05-18T04:07:32Z","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":"Given a redundant dictionary $\\Phi$, represented by an $M \\times N$ matrix ($\\Phi \\in \\mathbb{R}^{M \\times N}$) and a target signal $y \\in \\mathbb{R}^M$, the \\emph{sparse approximation problem} asks to find an approximate representation of $y$ using a linear combination of at most $k$ atoms. In this paper, a new complexity theoretic hardness result for sparse approximation problem is presented via considering a different measure of quality for the solution. It is argued that, from an algorithmic standpoint, the problem is more meaningful if it asks to maximize the norm of the target signal's p","authors_text":"Ali Civril","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T18:08:20Z","title":"Sparse Approximation is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4664","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:0a2b3cac1de58014dff3bd28e1657121c544505520ca1b031a46843c40e9eb70","target":"record","created_at":"2026-05-18T04:07:32Z","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":"12312f56d49de96bfc420296e55f23824a7c6ca1e76dbda2178cdbde9ab06c94","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T18:08:20Z","title_canon_sha256":"847f7638100f565722710d2df3e23cdb1fc1226adee8990b83b420a768969177"},"schema_version":"1.0","source":{"id":"1108.4664","kind":"arxiv","version":3}},"canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","first_computed_at":"2026-05-18T04:07:32.078995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:32.078995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1EuW4P5uaoADECRwKh9XoVWCwXPg+mjc8aBCsqm7+lHm/8gMxyTK+l2m2eUVNBQ/R9aYdYgfjE3fpRFwhrcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:32.079484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4664","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a2b3cac1de58014dff3bd28e1657121c544505520ca1b031a46843c40e9eb70","sha256:9e94c1a203d8a34e52d2753c3a8bc44e7707e6443b9210e7de959ded07570887"],"state_sha256":"e7817b24ae76b5fe3435a247a6027f635c42029f1cc325f7e34b352e2f155f66"}