{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XEDXE4II4C4VGMBWUZZWWONQIU","short_pith_number":"pith:XEDXE4II","schema_version":"1.0","canonical_sha256":"b907727108e0b9533036a6736b39b045084fe757ca017498b27cb789d5a2c0cd","source":{"kind":"arxiv","id":"1801.09172","version":2},"attestation_state":"computed","paper":{"title":"Modified lp-norm regularization minimization for sparse signal recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng","submitted_at":"2018-01-28T02:08:55Z","abstract_excerpt":"In numerous substitution models for the $\\l_{0}$-norm minimization problem $(P_{0})$, the $\\l_{p}$-norm minimization $(P_{p})$ with $0<p<1$ have been considered as the most natural choice. However, the non-convex optimization problem $(P_{p})$ are much more computational challenges, and are also NP-hard. Meanwhile, the algorithms corresponding to the proximal mapping of the regularization $\\l_{p}$-norm minimization $(P_{p}^{\\lambda})$ are limited to few specific values of parameter $p$. In this paper, we replace the $\\ell_{p}$-norm $\\|x\\|_{p}^{p}$ with a modified function $\\sum_{i=1}^{n}\\frac{"},"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":"1801.09172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-28T02:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"25f995d2dcded509c67268b2eb4a3d467a6faf710438b9d973b3df4ccdfa059b","abstract_canon_sha256":"3e9bef2e461bf5337fce3e93cf907385d024a22b93700fd3d5791a8227f5ce40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:30.460866Z","signature_b64":"JFdL1Ph1CW4CciOeOJdb6zWPHhfOScO4G2SkCb6a+nnnKUs1lHkbRXjf10J3ukir7cKGvntwQTMEmdBHT23rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b907727108e0b9533036a6736b39b045084fe757ca017498b27cb789d5a2c0cd","last_reissued_at":"2026-05-18T00:17:30.460234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:30.460234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modified lp-norm regularization minimization for sparse signal recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angang Cui, Haiyang Li, Jigen Peng","submitted_at":"2018-01-28T02:08:55Z","abstract_excerpt":"In numerous substitution models for the $\\l_{0}$-norm minimization problem $(P_{0})$, the $\\l_{p}$-norm minimization $(P_{p})$ with $0<p<1$ have been considered as the most natural choice. However, the non-convex optimization problem $(P_{p})$ are much more computational challenges, and are also NP-hard. Meanwhile, the algorithms corresponding to the proximal mapping of the regularization $\\l_{p}$-norm minimization $(P_{p}^{\\lambda})$ are limited to few specific values of parameter $p$. In this paper, we replace the $\\ell_{p}$-norm $\\|x\\|_{p}^{p}$ with a modified function $\\sum_{i=1}^{n}\\frac{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09172","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":"1801.09172","created_at":"2026-05-18T00:17:30.460346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09172v2","created_at":"2026-05-18T00:17:30.460346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09172","created_at":"2026-05-18T00:17:30.460346+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEDXE4II4C4V","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEDXE4II4C4VGMBW","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEDXE4II","created_at":"2026-05-18T12:33:01.666342+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/XEDXE4II4C4VGMBWUZZWWONQIU","json":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU.json","graph_json":"https://pith.science/api/pith-number/XEDXE4II4C4VGMBWUZZWWONQIU/graph.json","events_json":"https://pith.science/api/pith-number/XEDXE4II4C4VGMBWUZZWWONQIU/events.json","paper":"https://pith.science/paper/XEDXE4II"},"agent_actions":{"view_html":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU","download_json":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU.json","view_paper":"https://pith.science/paper/XEDXE4II","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09172&json=true","fetch_graph":"https://pith.science/api/pith-number/XEDXE4II4C4VGMBWUZZWWONQIU/graph.json","fetch_events":"https://pith.science/api/pith-number/XEDXE4II4C4VGMBWUZZWWONQIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU/action/storage_attestation","attest_author":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU/action/author_attestation","sign_citation":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU/action/citation_signature","submit_replication":"https://pith.science/pith/XEDXE4II4C4VGMBWUZZWWONQIU/action/replication_record"}},"created_at":"2026-05-18T00:17:30.460346+00:00","updated_at":"2026-05-18T00:17:30.460346+00:00"}