{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:GL3AHNFQXFK54DUDR4RRIYPL5C","short_pith_number":"pith:GL3AHNFQ","schema_version":"1.0","canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","source":{"kind":"arxiv","id":"0706.4297","version":2},"attestation_state":"computed","paper":{"title":"Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"I. Daubechies, I. Loris, M. Fornasier","submitted_at":"2007-06-28T18:44:37Z","abstract_excerpt":"Regularization of ill-posed linear inverse problems via $\\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\\ell_1$-constraints, using a gradient method, with projection on $\\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of"},"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":"0706.4297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-06-28T18:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"60e4642dd53ff8dc4a7e0ae88f81c843796896a13b7c0d7e894b10a6248f281c","abstract_canon_sha256":"dd6d7bdf291eb9cb4641aed416ecd8c8f7c268a81e1857eb2433297291ee6e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.203532Z","signature_b64":"La4x+0sbx+5/VVhtyBkPOqdIuK4gJFphJDc5L7bO74El+HwQeMFzUwswrs9BbTtAW3KkykwzDq0WWhP/BFesCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f603b4b0b955de0e838f231461ebe8856f3d85a1e2e5af6c42f2c2baef2aad","last_reissued_at":"2026-05-18T03:37:42.202803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.202803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"I. Daubechies, I. Loris, M. Fornasier","submitted_at":"2007-06-28T18:44:37Z","abstract_excerpt":"Regularization of ill-posed linear inverse problems via $\\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\\ell_1$-constraints, using a gradient method, with projection on $\\ell_1$-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4297","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":"0706.4297","created_at":"2026-05-18T03:37:42.202906+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.4297v2","created_at":"2026-05-18T03:37:42.202906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4297","created_at":"2026-05-18T03:37:42.202906+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL3AHNFQXFK5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL3AHNFQXFK54DUD","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL3AHNFQ","created_at":"2026-05-18T12:25:55.427421+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/GL3AHNFQXFK54DUDR4RRIYPL5C","json":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C.json","graph_json":"https://pith.science/api/pith-number/GL3AHNFQXFK54DUDR4RRIYPL5C/graph.json","events_json":"https://pith.science/api/pith-number/GL3AHNFQXFK54DUDR4RRIYPL5C/events.json","paper":"https://pith.science/paper/GL3AHNFQ"},"agent_actions":{"view_html":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C","download_json":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C.json","view_paper":"https://pith.science/paper/GL3AHNFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.4297&json=true","fetch_graph":"https://pith.science/api/pith-number/GL3AHNFQXFK54DUDR4RRIYPL5C/graph.json","fetch_events":"https://pith.science/api/pith-number/GL3AHNFQXFK54DUDR4RRIYPL5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/action/storage_attestation","attest_author":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/action/author_attestation","sign_citation":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/action/citation_signature","submit_replication":"https://pith.science/pith/GL3AHNFQXFK54DUDR4RRIYPL5C/action/replication_record"}},"created_at":"2026-05-18T03:37:42.202906+00:00","updated_at":"2026-05-18T03:37:42.202906+00:00"}