{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:57JLF7DJZ54IPEJ6EHLLPEIDRJ","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":"9adf4ae112344f1dde81881a5ded82e9146d982174caa289ee42485e4a6ba670","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T01:38:23Z","title_canon_sha256":"1b7ae299f49cd76e5216527857cde3e83c367d85a7371281e39ad7fe98b0fa97"},"schema_version":"1.0","source":{"id":"1501.00622","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00622","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00622v4","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00622","created_at":"2026-05-18T00:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"57JLF7DJZ54I","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"57JLF7DJZ54IPEJ6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"57JLF7DJ","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:66bae4224f148d4df0b40261247b89d9980678337f7674b9aadc5d25b9dc05eb","target":"graph","created_at":"2026-05-18T00:42:13Z","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":"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.","authors_text":"Dongdong Ge, Hao Yin, Mengdi Wang, Yichen Chen, Yinyu Ye, Zizhuo Wang","cross_cats":["cs.CC","math.ST","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T01:38:23Z","title":"Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00622","kind":"arxiv","version":4},"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:920b0af8e267bd6ec7bdb8cc020d8d583ee061f39d4f98d6a98470c01158ba97","target":"record","created_at":"2026-05-18T00:42:13Z","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":"9adf4ae112344f1dde81881a5ded82e9146d982174caa289ee42485e4a6ba670","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T01:38:23Z","title_canon_sha256":"1b7ae299f49cd76e5216527857cde3e83c367d85a7371281e39ad7fe98b0fa97"},"schema_version":"1.0","source":{"id":"1501.00622","kind":"arxiv","version":4}},"canonical_sha256":"efd2b2fc69cf7887913e21d6b791038a464a6f0fd7c41cae9b6da12522d099c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd2b2fc69cf7887913e21d6b791038a464a6f0fd7c41cae9b6da12522d099c1","first_computed_at":"2026-05-18T00:42:13.694700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:13.694700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUe+7I5797T8cllULV/oRPpHOFdx2RP2UVHBBsFuFUi6OTDoYRg3arcfRVr79jP6GFW/7Q1CNRC6sQGufWQyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:13.695369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00622","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:920b0af8e267bd6ec7bdb8cc020d8d583ee061f39d4f98d6a98470c01158ba97","sha256:66bae4224f148d4df0b40261247b89d9980678337f7674b9aadc5d25b9dc05eb"],"state_sha256":"78e5781c7557ddadee66d8677af35d91012ae3ee189f21d74ca100650ac4d6ac"}