{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RC2WNC2LQP2SINFBAB74QX7ZYZ","short_pith_number":"pith:RC2WNC2L","schema_version":"1.0","canonical_sha256":"88b5668b4b83f52434a1007fc85ff9c64df67369f425d18176ee781721b1d465","source":{"kind":"arxiv","id":"1712.00357","version":1},"attestation_state":"computed","paper":{"title":"Thresholding gradient methods in Hilbert spaces: support identification and linear convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa","submitted_at":"2017-12-01T15:20:17Z","abstract_excerpt":"We study $\\ell^1$ regularized least squares optimization problem in a separable Hilbert space. We show that the iterative soft-thresholding algorithm (ISTA) converges linearly, without making any assumption on the linear operator into play or on the problem. The result is obtained combining two key concepts: the notion of extended support, a finite set containing the support, and the notion of conditioning over finite dimensional sets. We prove that ISTA identifies the solution extended support after a finite number of iterations, and we derive linear convergence from the conditioning property"},"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":"1712.00357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T15:20:17Z","cross_cats_sorted":[],"title_canon_sha256":"e89abe2e0e8bec75ce9d2434d285a60e424f3231fa4011d3e5dc7f8c1cbd5f67","abstract_canon_sha256":"bd68a34378512c82d0acf194fc8fe0744134210f91cf3a1d45052908817648b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.451987Z","signature_b64":"vW0/kMytdAStS7yuUwDd8WwN6YHgJgQuUt3EZAbAq/ui/hmVsmOr3kzIic+thUpJtVx4PpAfJKbF6uj5bkdlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b5668b4b83f52434a1007fc85ff9c64df67369f425d18176ee781721b1d465","last_reissued_at":"2026-05-18T00:29:06.451446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.451446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thresholding gradient methods in Hilbert spaces: support identification and linear convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa","submitted_at":"2017-12-01T15:20:17Z","abstract_excerpt":"We study $\\ell^1$ regularized least squares optimization problem in a separable Hilbert space. We show that the iterative soft-thresholding algorithm (ISTA) converges linearly, without making any assumption on the linear operator into play or on the problem. The result is obtained combining two key concepts: the notion of extended support, a finite set containing the support, and the notion of conditioning over finite dimensional sets. We prove that ISTA identifies the solution extended support after a finite number of iterations, and we derive linear convergence from the conditioning property"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00357","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":"1712.00357","created_at":"2026-05-18T00:29:06.451532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00357v1","created_at":"2026-05-18T00:29:06.451532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00357","created_at":"2026-05-18T00:29:06.451532+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC2WNC2LQP2S","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC2WNC2LQP2SINFB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC2WNC2L","created_at":"2026-05-18T12:31:39.905425+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/RC2WNC2LQP2SINFBAB74QX7ZYZ","json":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ.json","graph_json":"https://pith.science/api/pith-number/RC2WNC2LQP2SINFBAB74QX7ZYZ/graph.json","events_json":"https://pith.science/api/pith-number/RC2WNC2LQP2SINFBAB74QX7ZYZ/events.json","paper":"https://pith.science/paper/RC2WNC2L"},"agent_actions":{"view_html":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ","download_json":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ.json","view_paper":"https://pith.science/paper/RC2WNC2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00357&json=true","fetch_graph":"https://pith.science/api/pith-number/RC2WNC2LQP2SINFBAB74QX7ZYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RC2WNC2LQP2SINFBAB74QX7ZYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ/action/storage_attestation","attest_author":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ/action/author_attestation","sign_citation":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ/action/citation_signature","submit_replication":"https://pith.science/pith/RC2WNC2LQP2SINFBAB74QX7ZYZ/action/replication_record"}},"created_at":"2026-05-18T00:29:06.451532+00:00","updated_at":"2026-05-18T00:29:06.451532+00:00"}