{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JP7KUN2WFGT22YYKD5O6ZW23HT","short_pith_number":"pith:JP7KUN2W","schema_version":"1.0","canonical_sha256":"4bfeaa375629a7ad630a1f5decdb5b3cf59e7954f30b67085845fd402c0c5df8","source":{"kind":"arxiv","id":"1501.02018","version":1},"attestation_state":"computed","paper":{"title":"$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyang Li, Jigen Peng, Shigang Yue","submitted_at":"2015-01-09T01:55:15Z","abstract_excerpt":"It is proved in this paper that to every underdetermined linear system $Ax=b$ there corresponds a constant $p(A,b)>0$ such that every solution to the $l_p$-norm minimization problem also solves the $l_0$-norm minimization problem whenever $0<p<p(A,b)$. This phenomenon is named $NP/CLP$ equivalence."},"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.02018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-09T01:55:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c4d16bf241f402cb16ea6cc133d009da7a16d4f81f30bd6f7cdf26fe150f93fb","abstract_canon_sha256":"3b6fb9ba2fd0e281d5457f7720ddf4be5221d8c4a0f27fc21c959aeda6dd771d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.050830Z","signature_b64":"mv93z1ATZtoayZWjGyTgMkxqHDxc9mis4SccT4Sf5jVl2DHJ7fVdIh+b31ZI8qRBMc92CQtoftmi8wHxcZa/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bfeaa375629a7ad630a1f5decdb5b3cf59e7954f30b67085845fd402c0c5df8","last_reissued_at":"2026-05-18T02:29:45.050237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.050237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haiyang Li, Jigen Peng, Shigang Yue","submitted_at":"2015-01-09T01:55:15Z","abstract_excerpt":"It is proved in this paper that to every underdetermined linear system $Ax=b$ there corresponds a constant $p(A,b)>0$ such that every solution to the $l_p$-norm minimization problem also solves the $l_0$-norm minimization problem whenever $0<p<p(A,b)$. This phenomenon is named $NP/CLP$ equivalence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02018","kind":"arxiv","version":1},"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.02018","created_at":"2026-05-18T02:29:45.050324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02018v1","created_at":"2026-05-18T02:29:45.050324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02018","created_at":"2026-05-18T02:29:45.050324+00:00"},{"alias_kind":"pith_short_12","alias_value":"JP7KUN2WFGT2","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JP7KUN2WFGT22YYK","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JP7KUN2W","created_at":"2026-05-18T12:29:27.538025+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/JP7KUN2WFGT22YYKD5O6ZW23HT","json":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT.json","graph_json":"https://pith.science/api/pith-number/JP7KUN2WFGT22YYKD5O6ZW23HT/graph.json","events_json":"https://pith.science/api/pith-number/JP7KUN2WFGT22YYKD5O6ZW23HT/events.json","paper":"https://pith.science/paper/JP7KUN2W"},"agent_actions":{"view_html":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT","download_json":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT.json","view_paper":"https://pith.science/paper/JP7KUN2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02018&json=true","fetch_graph":"https://pith.science/api/pith-number/JP7KUN2WFGT22YYKD5O6ZW23HT/graph.json","fetch_events":"https://pith.science/api/pith-number/JP7KUN2WFGT22YYKD5O6ZW23HT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT/action/storage_attestation","attest_author":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT/action/author_attestation","sign_citation":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT/action/citation_signature","submit_replication":"https://pith.science/pith/JP7KUN2WFGT22YYKD5O6ZW23HT/action/replication_record"}},"created_at":"2026-05-18T02:29:45.050324+00:00","updated_at":"2026-05-18T02:29:45.050324+00:00"}