{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5MGEBJFVSQKITRVVNIFNWAU2OI","short_pith_number":"pith:5MGEBJFV","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"},"canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","source":{"kind":"arxiv","id":"1108.4664","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5MGEBJFVSQKITRVVNIFNWAU2OI","target":"record","payload":{"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"},"canonical_sha256":"eb0c40a4b5941489c6b56a0adb029a721099ed3d5cc1ab17a3c11ec6b3838aeb","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"},"source_kind":"arxiv","source_id":"1108.4664","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xoDrWgD+5EFlvHjag3Qn4ijbaCS9qqCyG2GcSKRObN2XLgM5HRIPIm64he2RiTO2v4XqAgI58YwR+/YPL4xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:22.750020Z"},"content_sha256":"0a2b3cac1de58014dff3bd28e1657121c544505520ca1b031a46843c40e9eb70","schema_version":"1.0","event_id":"sha256:0a2b3cac1de58014dff3bd28e1657121c544505520ca1b031a46843c40e9eb70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5MGEBJFVSQKITRVVNIFNWAU2OI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeVItI7VBh+EG8xrrLBbT/4mOmdzRbm6UuiIIR3A++ACElH1yW/FOw/gJ317sRLITht0G/jAQSV9xUsw4K8mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:22.750388Z"},"content_sha256":"9e94c1a203d8a34e52d2753c3a8bc44e7707e6443b9210e7de959ded07570887","schema_version":"1.0","event_id":"sha256:9e94c1a203d8a34e52d2753c3a8bc44e7707e6443b9210e7de959ded07570887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/bundle.json","state_url":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T21:10:22Z","links":{"resolver":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI","bundle":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/bundle.json","state":"https://pith.science/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MGEBJFVSQKITRVVNIFNWAU2OI/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4757P76Q2apWVsblGu7eUE9yalmo8adsbQ0xdj02kDfgiP0qkTOm86hnm7IgowC1SszIh172FY5Dkx4moWp/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:10:22.752405Z","bundle_sha256":"0715b5b349add3b0f6f5029ca53e6092b0e385baa31e521e13cfd06cea42891e"}}