{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:BGQPOQWXAAVFPAKE3MRKM26LA7","short_pith_number":"pith:BGQPOQWX","schema_version":"1.0","canonical_sha256":"09a0f742d7002a578144db22a66bcb07f5b8efdcf51a003a7c25c5b275297b6e","source":{"kind":"arxiv","id":"0902.4424","version":1},"attestation_state":"computed","paper":{"title":"Accelerating gradient projection methods for $\\ell_1$-constrained signal recovery by steplength selection rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"C. De Mol, I. Loris, L. Zanni, M. Bertero, R. Zanella","submitted_at":"2009-02-25T17:07:08Z","abstract_excerpt":"We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for $\\ell_1$-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai-Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well-conditioned and ill-conditioned problems is carried out for performance evaluati"},"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":"0902.4424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-02-25T17:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"e919307a0d7150ea4367d15701d5403f701ba04c08dd64cb542c9f3b7613e29d","abstract_canon_sha256":"97d25952afaef67b94050705e62d31abf4a34b851ab5b39ce13b2c5791e0e9bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.130207Z","signature_b64":"d8oSQzfr0ecW/1hD9ebXP4SCWGrT0q0ZUALCTelvwSGNalhWsXDJyYrgCbgL+HAkAeRqRazN6JjtKDt8rK+DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a0f742d7002a578144db22a66bcb07f5b8efdcf51a003a7c25c5b275297b6e","last_reissued_at":"2026-05-18T03:37:42.129650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.129650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating gradient projection methods for $\\ell_1$-constrained signal recovery by steplength selection rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"C. De Mol, I. Loris, L. Zanni, M. Bertero, R. Zanella","submitted_at":"2009-02-25T17:07:08Z","abstract_excerpt":"We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for $\\ell_1$-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai-Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well-conditioned and ill-conditioned problems is carried out for performance evaluati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4424","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":"0902.4424","created_at":"2026-05-18T03:37:42.129751+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.4424v1","created_at":"2026-05-18T03:37:42.129751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4424","created_at":"2026-05-18T03:37:42.129751+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGQPOQWXAAVF","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGQPOQWXAAVFPAKE","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGQPOQWX","created_at":"2026-05-18T12:25:58.837520+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/BGQPOQWXAAVFPAKE3MRKM26LA7","json":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7.json","graph_json":"https://pith.science/api/pith-number/BGQPOQWXAAVFPAKE3MRKM26LA7/graph.json","events_json":"https://pith.science/api/pith-number/BGQPOQWXAAVFPAKE3MRKM26LA7/events.json","paper":"https://pith.science/paper/BGQPOQWX"},"agent_actions":{"view_html":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7","download_json":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7.json","view_paper":"https://pith.science/paper/BGQPOQWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.4424&json=true","fetch_graph":"https://pith.science/api/pith-number/BGQPOQWXAAVFPAKE3MRKM26LA7/graph.json","fetch_events":"https://pith.science/api/pith-number/BGQPOQWXAAVFPAKE3MRKM26LA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7/action/storage_attestation","attest_author":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7/action/author_attestation","sign_citation":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7/action/citation_signature","submit_replication":"https://pith.science/pith/BGQPOQWXAAVFPAKE3MRKM26LA7/action/replication_record"}},"created_at":"2026-05-18T03:37:42.129751+00:00","updated_at":"2026-05-18T03:37:42.129751+00:00"}