{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2KMVPC3SXBKNE2JGTZVSZ56RDS","short_pith_number":"pith:2KMVPC3S","schema_version":"1.0","canonical_sha256":"d299578b72b854d269269e6b2cf7d11c902a2ed032a5ba06aa4e5868ef957b49","source":{"kind":"arxiv","id":"1303.4434","version":1},"attestation_state":"computed","paper":{"title":"A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Changshui Zhang, Jianhua Huang, Jieping Ye, Pinghua Gong, Zhaosong Lu","submitted_at":"2013-03-18T21:41:53Z","abstract_excerpt":"Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems becau"},"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":"1303.4434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T21:41:53Z","cross_cats_sorted":["cs.NA","stat.CO","stat.ML"],"title_canon_sha256":"790dec5acfc891936d9e6aa86f13d6c34ea54d55e55921d7c7b2a295a7968837","abstract_canon_sha256":"56064ad0e899e27d54291fa57ca1e1b892e0816429ac2ecfac978d8413387a79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.237810Z","signature_b64":"Vh7E+UvUwU6kINRQul0WTk8ts5jIm4IQK0hjSmF1SOQbxc6qRMOEobvjjLMkwPdW0f4uzpAzvsFS4vWPmjhTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d299578b72b854d269269e6b2cf7d11c902a2ed032a5ba06aa4e5868ef957b49","last_reissued_at":"2026-05-18T03:30:27.237125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.237125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Changshui Zhang, Jianhua Huang, Jieping Ye, Pinghua Gong, Zhaosong Lu","submitted_at":"2013-03-18T21:41:53Z","abstract_excerpt":"Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems becau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4434","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":"1303.4434","created_at":"2026-05-18T03:30:27.237228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4434v1","created_at":"2026-05-18T03:30:27.237228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4434","created_at":"2026-05-18T03:30:27.237228+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KMVPC3SXBKN","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KMVPC3SXBKNE2JG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KMVPC3S","created_at":"2026-05-18T12:27:30.460161+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/2KMVPC3SXBKNE2JGTZVSZ56RDS","json":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS.json","graph_json":"https://pith.science/api/pith-number/2KMVPC3SXBKNE2JGTZVSZ56RDS/graph.json","events_json":"https://pith.science/api/pith-number/2KMVPC3SXBKNE2JGTZVSZ56RDS/events.json","paper":"https://pith.science/paper/2KMVPC3S"},"agent_actions":{"view_html":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS","download_json":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS.json","view_paper":"https://pith.science/paper/2KMVPC3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4434&json=true","fetch_graph":"https://pith.science/api/pith-number/2KMVPC3SXBKNE2JGTZVSZ56RDS/graph.json","fetch_events":"https://pith.science/api/pith-number/2KMVPC3SXBKNE2JGTZVSZ56RDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS/action/storage_attestation","attest_author":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS/action/author_attestation","sign_citation":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS/action/citation_signature","submit_replication":"https://pith.science/pith/2KMVPC3SXBKNE2JGTZVSZ56RDS/action/replication_record"}},"created_at":"2026-05-18T03:30:27.237228+00:00","updated_at":"2026-05-18T03:30:27.237228+00:00"}