{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N4SHRFIXXTINZ53FERD2WALKGU","short_pith_number":"pith:N4SHRFIX","schema_version":"1.0","canonical_sha256":"6f24789517bcd0dcf7652447ab016a352d6a650825999bc93b591d2f578fd2fc","source":{"kind":"arxiv","id":"2306.14394","version":5},"attestation_state":"computed","paper":{"title":"Revisiting $L_q(0\\leq q<1)$ Norm Regularized Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingtao Peng, Shenglong Zhou, Xianchao Xiu, Yingnan Wang","submitted_at":"2023-06-26T03:10:09Z","abstract_excerpt":"Sparse optimization has seen its advances in recent decades. For scenarios where the true sparsity is unknown, regularization turns out to be a promising solution. Two popular non-convex regularizations are the so-called $L_0$ norm and $L_q$ norm with $q\\in(0,1)$, giving rise to extensive research on their induced optimization. However, the majority of these work centered around the main function that is twice continuously differentiable and the best convergence rate for an algorithm solving the optimization with $q\\in(0,1)$ is superlinear. This paper explores the $L_q$ norm regularized optimi"},"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":"2306.14394","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-26T03:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"7a4c86901c3efdd891f39f1556104673bbc2d08ac57088e1c3d802a1c9918c56","abstract_canon_sha256":"971572629b22a40eb8fa9ddfb2cf23bc9cd819386abcbca100c28995ee00bb75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:07.355858Z","signature_b64":"mcpwA7v6+fLT4NM6rrZy4Tx+NXxrvJSq+dFhxkzB3oSjmOQFC0j7xVcx2wvocIk9uTMKnEP6cngmMYjJk/WTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f24789517bcd0dcf7652447ab016a352d6a650825999bc93b591d2f578fd2fc","last_reissued_at":"2026-07-05T08:40:07.355357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:07.355357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting $L_q(0\\leq q<1)$ Norm Regularized Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingtao Peng, Shenglong Zhou, Xianchao Xiu, Yingnan Wang","submitted_at":"2023-06-26T03:10:09Z","abstract_excerpt":"Sparse optimization has seen its advances in recent decades. For scenarios where the true sparsity is unknown, regularization turns out to be a promising solution. Two popular non-convex regularizations are the so-called $L_0$ norm and $L_q$ norm with $q\\in(0,1)$, giving rise to extensive research on their induced optimization. However, the majority of these work centered around the main function that is twice continuously differentiable and the best convergence rate for an algorithm solving the optimization with $q\\in(0,1)$ is superlinear. This paper explores the $L_q$ norm regularized optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14394","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.14394/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.14394","created_at":"2026-07-05T08:40:07.355420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.14394v5","created_at":"2026-07-05T08:40:07.355420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14394","created_at":"2026-07-05T08:40:07.355420+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4SHRFIXXTIN","created_at":"2026-07-05T08:40:07.355420+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4SHRFIXXTINZ53F","created_at":"2026-07-05T08:40:07.355420+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4SHRFIX","created_at":"2026-07-05T08:40:07.355420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05765","citing_title":"A Globalized Semismooth Newton Method for Prox-regular Optimization Problems","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU","json":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU.json","graph_json":"https://pith.science/api/pith-number/N4SHRFIXXTINZ53FERD2WALKGU/graph.json","events_json":"https://pith.science/api/pith-number/N4SHRFIXXTINZ53FERD2WALKGU/events.json","paper":"https://pith.science/paper/N4SHRFIX"},"agent_actions":{"view_html":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU","download_json":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU.json","view_paper":"https://pith.science/paper/N4SHRFIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.14394&json=true","fetch_graph":"https://pith.science/api/pith-number/N4SHRFIXXTINZ53FERD2WALKGU/graph.json","fetch_events":"https://pith.science/api/pith-number/N4SHRFIXXTINZ53FERD2WALKGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU/action/storage_attestation","attest_author":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU/action/author_attestation","sign_citation":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU/action/citation_signature","submit_replication":"https://pith.science/pith/N4SHRFIXXTINZ53FERD2WALKGU/action/replication_record"}},"created_at":"2026-07-05T08:40:07.355420+00:00","updated_at":"2026-07-05T08:40:07.355420+00:00"}