{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5MGEBJFVSQKITRVVNIFNWAU2OI","short_pith_number":"pith:5MGEBJFV","schema_version":"1.0","canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","source":{"kind":"arxiv","id":"1108.4664","version":3},"attestation_state":"computed","paper":{"title":"Sparse Approximation is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Ali Civril","submitted_at":"2011-08-23T18:08:20Z","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"},"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":"1108.4664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-08-23T18:08:20Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"847f7638100f565722710d2df3e23cdb1fc1226adee8990b83b420a768969177","abstract_canon_sha256":"12312f56d49de96bfc420296e55f23824a7c6ca1e76dbda2178cdbde9ab06c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:32.079484Z","signature_b64":"c1EuW4P5uaoADECRwKh9XoVWCwXPg+mjc8aBCsqm7+lHm/8gMxyTK+l2m2eUVNBQ/R9aYdYgfjE3fpRFwhrcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","last_reissued_at":"2026-05-18T04:07:32.078995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:32.078995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Approximation is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Ali Civril","submitted_at":"2011-08-23T18:08:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4664","kind":"arxiv","version":3},"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":"1108.4664","created_at":"2026-05-18T04:07:32.079066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4664v3","created_at":"2026-05-18T04:07:32.079066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4664","created_at":"2026-05-18T04:07:32.079066+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MGEBJFVSQKI","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MGEBJFVSQKITRVV","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MGEBJFV","created_at":"2026-05-18T12:26:20.644004+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/5MGEBJFVSQKITRVVNIFNWAU2OI","json":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI.json","graph_json":"https://pith.science/api/pith-number/5MGEBJFVSQKITRVVNIFNWAU2OI/graph.json","events_json":"https://pith.science/api/pith-number/5MGEBJFVSQKITRVVNIFNWAU2OI/events.json","paper":"https://pith.science/paper/5MGEBJFV"},"agent_actions":{"view_html":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI","download_json":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI.json","view_paper":"https://pith.science/paper/5MGEBJFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4664&json=true","fetch_graph":"https://pith.science/api/pith-number/5MGEBJFVSQKITRVVNIFNWAU2OI/graph.json","fetch_events":"https://pith.science/api/pith-number/5MGEBJFVSQKITRVVNIFNWAU2OI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/action/storage_attestation","attest_author":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/action/author_attestation","sign_citation":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/action/citation_signature","submit_replication":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/action/replication_record"}},"created_at":"2026-05-18T04:07:32.079066+00:00","updated_at":"2026-05-18T04:07:32.079066+00:00"}