{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EZKVRD6EKJS3QVGFZM2ARNMCOV","short_pith_number":"pith:EZKVRD6E","schema_version":"1.0","canonical_sha256":"2655588fc45265b854c5cb3408b582754a139ed51fc1259351cda664e70eea76","source":{"kind":"arxiv","id":"1507.03173","version":1},"attestation_state":"computed","paper":{"title":"A Gauss-Seidel Iterative Thresholding Algorithm for lq Regularized Least Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Jinshan Zeng, Shaobo Lin, Zhimin Peng","submitted_at":"2015-07-12T00:47:51Z","abstract_excerpt":"In recent studies on sparse modeling, $l_q$ ($0<q<1$) regularized least squares regression ($l_q$LS) has received considerable attention due to its superiorities on sparsity-inducing and bias-reduction over the convex counterparts. In this paper, we propose a Gauss-Seidel iterative thresholding algorithm (called GAITA) for solution to this problem. Different from the classical iterative thresholding algorithms using the Jacobi updating rule, GAITA takes advantage of the Gauss-Seidel rule to update the coordinate coefficients. Under a mild condition, we can justify that the support set and sign"},"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":"1507.03173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-12T00:47:51Z","cross_cats_sorted":[],"title_canon_sha256":"b95773c5d897cd03ca781d45f3b73b15f6f70d3af70b2d91cbbeedb6bc1cb4fd","abstract_canon_sha256":"0d8a1d52e660d5dfe4993837a4fe5d9e055df0a5f7b1117b28f2c1facc2f813c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:59.506243Z","signature_b64":"WKqHva5LdbF+I4PeoqpCDG4KWZyIDqaAgUAw6eMf9sYsRRk0o8Xz9yYcxWL+vZqGYD8Z7HQ8hc950xI+1lfuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2655588fc45265b854c5cb3408b582754a139ed51fc1259351cda664e70eea76","last_reissued_at":"2026-05-18T01:36:59.505802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:59.505802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Gauss-Seidel Iterative Thresholding Algorithm for lq Regularized Least Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Jinshan Zeng, Shaobo Lin, Zhimin Peng","submitted_at":"2015-07-12T00:47:51Z","abstract_excerpt":"In recent studies on sparse modeling, $l_q$ ($0<q<1$) regularized least squares regression ($l_q$LS) has received considerable attention due to its superiorities on sparsity-inducing and bias-reduction over the convex counterparts. In this paper, we propose a Gauss-Seidel iterative thresholding algorithm (called GAITA) for solution to this problem. Different from the classical iterative thresholding algorithms using the Jacobi updating rule, GAITA takes advantage of the Gauss-Seidel rule to update the coordinate coefficients. Under a mild condition, we can justify that the support set and sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03173","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":"1507.03173","created_at":"2026-05-18T01:36:59.505871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03173v1","created_at":"2026-05-18T01:36:59.505871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03173","created_at":"2026-05-18T01:36:59.505871+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZKVRD6EKJS3","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZKVRD6EKJS3QVGF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZKVRD6E","created_at":"2026-05-18T12:29:19.899920+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/EZKVRD6EKJS3QVGFZM2ARNMCOV","json":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV.json","graph_json":"https://pith.science/api/pith-number/EZKVRD6EKJS3QVGFZM2ARNMCOV/graph.json","events_json":"https://pith.science/api/pith-number/EZKVRD6EKJS3QVGFZM2ARNMCOV/events.json","paper":"https://pith.science/paper/EZKVRD6E"},"agent_actions":{"view_html":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV","download_json":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV.json","view_paper":"https://pith.science/paper/EZKVRD6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03173&json=true","fetch_graph":"https://pith.science/api/pith-number/EZKVRD6EKJS3QVGFZM2ARNMCOV/graph.json","fetch_events":"https://pith.science/api/pith-number/EZKVRD6EKJS3QVGFZM2ARNMCOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV/action/storage_attestation","attest_author":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV/action/author_attestation","sign_citation":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV/action/citation_signature","submit_replication":"https://pith.science/pith/EZKVRD6EKJS3QVGFZM2ARNMCOV/action/replication_record"}},"created_at":"2026-05-18T01:36:59.505871+00:00","updated_at":"2026-05-18T01:36:59.505871+00:00"}