{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:57JLF7DJZ54IPEJ6EHLLPEIDRJ","short_pith_number":"pith:57JLF7DJ","schema_version":"1.0","canonical_sha256":"efd2b2fc69cf7887913e21d6b791038a464a6f0fd7c41cae9b6da12522d099c1","source":{"kind":"arxiv","id":"1501.00622","version":4},"attestation_state":"computed","paper":{"title":"Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.CO","stat.TH"],"primary_cat":"math.OC","authors_text":"Dongdong Ge, Hao Yin, Mengdi Wang, Yichen Chen, Yinyu Ye, Zizhuo Wang","submitted_at":"2015-01-04T01:38:23Z","abstract_excerpt":"Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for $n$ data points (each of dimension $d$) and a nonconvex sparsity penalty. We prove that finding an $\\mathcal{O}(n^{c_1}d^{c_2})$-optimal solution to the regularized sparse optimization problem is strongly NP-hard for any $c_1, c_2\\in [0,1)$ such that $c_1+c_2<1$. The result applies to a broad class of loss functions and sparse penalty functions. It suggests that one cannot even approximately solve the sparse optimization problem in polynomial time, unless P $=$ NP."},"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":"1501.00622","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T01:38:23Z","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"1b7ae299f49cd76e5216527857cde3e83c367d85a7371281e39ad7fe98b0fa97","abstract_canon_sha256":"9adf4ae112344f1dde81881a5ded82e9146d982174caa289ee42485e4a6ba670"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.695369Z","signature_b64":"vUe+7I5797T8cllULV/oRPpHOFdx2RP2UVHBBsFuFUi6OTDoYRg3arcfRVr79jP6GFW/7Q1CNRC6sQGufWQyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd2b2fc69cf7887913e21d6b791038a464a6f0fd7c41cae9b6da12522d099c1","last_reissued_at":"2026-05-18T00:42:13.694700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:13.694700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.CO","stat.TH"],"primary_cat":"math.OC","authors_text":"Dongdong Ge, Hao Yin, Mengdi Wang, Yichen Chen, Yinyu Ye, Zizhuo Wang","submitted_at":"2015-01-04T01:38:23Z","abstract_excerpt":"Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for $n$ data points (each of dimension $d$) and a nonconvex sparsity penalty. We prove that finding an $\\mathcal{O}(n^{c_1}d^{c_2})$-optimal solution to the regularized sparse optimization problem is strongly NP-hard for any $c_1, c_2\\in [0,1)$ such that $c_1+c_2<1$. The result applies to a broad class of loss functions and sparse penalty functions. It suggests that one cannot even approximately solve the sparse optimization problem in polynomial time, unless P $=$ NP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00622","kind":"arxiv","version":4},"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":"1501.00622","created_at":"2026-05-18T00:42:13.694792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00622v4","created_at":"2026-05-18T00:42:13.694792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00622","created_at":"2026-05-18T00:42:13.694792+00:00"},{"alias_kind":"pith_short_12","alias_value":"57JLF7DJZ54I","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"57JLF7DJZ54IPEJ6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"57JLF7DJ","created_at":"2026-05-18T12:29:05.191682+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/57JLF7DJZ54IPEJ6EHLLPEIDRJ","json":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ.json","graph_json":"https://pith.science/api/pith-number/57JLF7DJZ54IPEJ6EHLLPEIDRJ/graph.json","events_json":"https://pith.science/api/pith-number/57JLF7DJZ54IPEJ6EHLLPEIDRJ/events.json","paper":"https://pith.science/paper/57JLF7DJ"},"agent_actions":{"view_html":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ","download_json":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ.json","view_paper":"https://pith.science/paper/57JLF7DJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00622&json=true","fetch_graph":"https://pith.science/api/pith-number/57JLF7DJZ54IPEJ6EHLLPEIDRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/57JLF7DJZ54IPEJ6EHLLPEIDRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ/action/storage_attestation","attest_author":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ/action/author_attestation","sign_citation":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ/action/citation_signature","submit_replication":"https://pith.science/pith/57JLF7DJZ54IPEJ6EHLLPEIDRJ/action/replication_record"}},"created_at":"2026-05-18T00:42:13.694792+00:00","updated_at":"2026-05-18T00:42:13.694792+00:00"}