{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BIGEOCG6PUHIOIIZOXTHPSV7LF","short_pith_number":"pith:BIGEOCG6","schema_version":"1.0","canonical_sha256":"0a0c4708de7d0e87211975e677cabf596a1ce5923a9cca219802935bddbfe7e5","source":{"kind":"arxiv","id":"1707.07787","version":1},"attestation_state":"computed","paper":{"title":"Capped Lp approximations for the composite L0 regularization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Na Zhang, Qia Li","submitted_at":"2017-07-25T01:47:41Z","abstract_excerpt":"The composite L0 function serves as a sparse regularizer in many applications. The algorithmic difficulty caused by the composite L0 regularization (the L0 norm composed with a linear mapping) is usually bypassed through approximating the L0 norm. We consider in this paper capped Lp approximations with $p>0$ for the composite L0 regularization problem. For each $p>0$, the capped Lp function converges to the L0 norm pointwisely as the approximation parameter tends to infinity. We point out that the capped Lp approximation problem is essentially a penalty method with an Lp penalty function for t"},"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":"1707.07787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T01:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"6641ea6db66037e3c11de71549b749097a3126b40fd04da1caad9573a04f97cd","abstract_canon_sha256":"28d52e48170ce75eb97d06126daa7bf483a4d4084da82556b2ebc973eaccb623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:30.366781Z","signature_b64":"nQgcJbfBthBRP69ALmPOOwVEDdOOEZkO0sqRYvbEanSZsTcy4sh080lD/MTwUUE+CmSDDUny6o+ZqhIYiy/SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a0c4708de7d0e87211975e677cabf596a1ce5923a9cca219802935bddbfe7e5","last_reissued_at":"2026-05-18T00:39:30.366083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:30.366083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capped Lp approximations for the composite L0 regularization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Na Zhang, Qia Li","submitted_at":"2017-07-25T01:47:41Z","abstract_excerpt":"The composite L0 function serves as a sparse regularizer in many applications. The algorithmic difficulty caused by the composite L0 regularization (the L0 norm composed with a linear mapping) is usually bypassed through approximating the L0 norm. We consider in this paper capped Lp approximations with $p>0$ for the composite L0 regularization problem. For each $p>0$, the capped Lp function converges to the L0 norm pointwisely as the approximation parameter tends to infinity. We point out that the capped Lp approximation problem is essentially a penalty method with an Lp penalty function for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07787","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":"1707.07787","created_at":"2026-05-18T00:39:30.366212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07787v1","created_at":"2026-05-18T00:39:30.366212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07787","created_at":"2026-05-18T00:39:30.366212+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIGEOCG6PUHI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIGEOCG6PUHIOIIZ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIGEOCG6","created_at":"2026-05-18T12:31:08.081275+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/BIGEOCG6PUHIOIIZOXTHPSV7LF","json":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF.json","graph_json":"https://pith.science/api/pith-number/BIGEOCG6PUHIOIIZOXTHPSV7LF/graph.json","events_json":"https://pith.science/api/pith-number/BIGEOCG6PUHIOIIZOXTHPSV7LF/events.json","paper":"https://pith.science/paper/BIGEOCG6"},"agent_actions":{"view_html":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF","download_json":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF.json","view_paper":"https://pith.science/paper/BIGEOCG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07787&json=true","fetch_graph":"https://pith.science/api/pith-number/BIGEOCG6PUHIOIIZOXTHPSV7LF/graph.json","fetch_events":"https://pith.science/api/pith-number/BIGEOCG6PUHIOIIZOXTHPSV7LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF/action/storage_attestation","attest_author":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF/action/author_attestation","sign_citation":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF/action/citation_signature","submit_replication":"https://pith.science/pith/BIGEOCG6PUHIOIIZOXTHPSV7LF/action/replication_record"}},"created_at":"2026-05-18T00:39:30.366212+00:00","updated_at":"2026-05-18T00:39:30.366212+00:00"}