{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ","short_pith_number":"pith:6HBRZ2KS","schema_version":"1.0","canonical_sha256":"f1c31ce95297b1ac28d21178d4c39612670a91f40c268c749f592218270b0a2b","source":{"kind":"arxiv","id":"1303.5305","version":2},"attestation_state":"computed","paper":{"title":"Projection onto the Cosparse Set is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas M. Tillmann, Marc E. Pfetsch, R\\'emi Gribonval (INRIA - IRISA)","submitted_at":"2013-03-21T15:42:18Z","abstract_excerpt":"The computational complexity of a problem arising in the context of sparse optimization is considered, namely, the projection onto the set of $k$-cosparse vectors w.r.t. some given matrix $\\Omeg$. It is shown that this projection problem is (strongly) \\NP-hard, even in the special cases in which the matrix $\\Omeg$ contains only ternary or bipolar coefficients. Interestingly, this is in contrast to the projection onto the set of $k$-sparse vectors, which is trivially solved by keeping only the $k$ largest coefficients."},"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":"1303.5305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-21T15:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"5327b51a8016fdf4d9a4a029d009c0cc697d9ab0a7be0ca99d83d6e80992c238","abstract_canon_sha256":"bf36d19e9a274acf33f31f73ce74530c746d20acd6b53609761e871e6efcece2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:44.292510Z","signature_b64":"SuLbMU11B9l6S/c8J+PEquAhSCS9cgQahSy1TSVqXi4UvcJMqxw9b8BFVPVvmofJqD1aJux6SZwyqkCZ6FZfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1c31ce95297b1ac28d21178d4c39612670a91f40c268c749f592218270b0a2b","last_reissued_at":"2026-05-18T02:56:44.291898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:44.291898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection onto the Cosparse Set is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas M. Tillmann, Marc E. Pfetsch, R\\'emi Gribonval (INRIA - IRISA)","submitted_at":"2013-03-21T15:42:18Z","abstract_excerpt":"The computational complexity of a problem arising in the context of sparse optimization is considered, namely, the projection onto the set of $k$-cosparse vectors w.r.t. some given matrix $\\Omeg$. It is shown that this projection problem is (strongly) \\NP-hard, even in the special cases in which the matrix $\\Omeg$ contains only ternary or bipolar coefficients. Interestingly, this is in contrast to the projection onto the set of $k$-sparse vectors, which is trivially solved by keeping only the $k$ largest coefficients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5305","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":"1303.5305","created_at":"2026-05-18T02:56:44.291985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5305v2","created_at":"2026-05-18T02:56:44.291985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5305","created_at":"2026-05-18T02:56:44.291985+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HBRZ2KSS6Y2","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HBRZ2KSS6Y2YKGS","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HBRZ2KS","created_at":"2026-05-18T12:27:36.564083+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/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ","json":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ.json","graph_json":"https://pith.science/api/pith-number/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/graph.json","events_json":"https://pith.science/api/pith-number/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/events.json","paper":"https://pith.science/paper/6HBRZ2KS"},"agent_actions":{"view_html":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ","download_json":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ.json","view_paper":"https://pith.science/paper/6HBRZ2KS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5305&json=true","fetch_graph":"https://pith.science/api/pith-number/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/action/storage_attestation","attest_author":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/action/author_attestation","sign_citation":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/action/citation_signature","submit_replication":"https://pith.science/pith/6HBRZ2KSS6Y2YKGSCF4NJQ4WCJ/action/replication_record"}},"created_at":"2026-05-18T02:56:44.291985+00:00","updated_at":"2026-05-18T02:56:44.291985+00:00"}