{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G2QKYWCF66RZC5SDPZ6FOCZLCO","short_pith_number":"pith:G2QKYWCF","schema_version":"1.0","canonical_sha256":"36a0ac5845f7a39176437e7c570b2b139c3742671f0bfdc2d09584337818c62c","source":{"kind":"arxiv","id":"1610.02170","version":3},"attestation_state":"computed","paper":{"title":"Iterative regularization via dual diagonal descent","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":"2016-10-07T07:58:05Z","abstract_excerpt":"In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal {descent} method. Our analysis establishes convergence as well as stability results. Theoretical findings are complemented with numerical experiments showing state of the art performances."},"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":"1610.02170","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-07T07:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"9115ac74132f39a490ddb827ed43179324b9f3d27fd86f4c59cdd5d20bfa2ba3","abstract_canon_sha256":"3ca7ed0fd3e4b0e1b11334e521fe96bf83181bb9a872765da9706deb21a34059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:42.043829Z","signature_b64":"zEmPlGBYO0DKltd/WAPsQZ2r3yXOR2xI6pDGi39PgSXnSwO+RMYZNU8eVy8ElecG/7LAPsapwuKBcG42NiWADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a0ac5845f7a39176437e7c570b2b139c3742671f0bfdc2d09584337818c62c","last_reissued_at":"2026-05-18T00:38:42.043115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:42.043115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative regularization via dual diagonal descent","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":"2016-10-07T07:58:05Z","abstract_excerpt":"In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal {descent} method. Our analysis establishes convergence as well as stability results. Theoretical findings are complemented with numerical experiments showing state of the art performances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02170","kind":"arxiv","version":3},"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":"1610.02170","created_at":"2026-05-18T00:38:42.043228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02170v3","created_at":"2026-05-18T00:38:42.043228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02170","created_at":"2026-05-18T00:38:42.043228+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2QKYWCF66RZ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2QKYWCF66RZC5SD","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2QKYWCF","created_at":"2026-05-18T12:30:15.759754+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/G2QKYWCF66RZC5SDPZ6FOCZLCO","json":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO.json","graph_json":"https://pith.science/api/pith-number/G2QKYWCF66RZC5SDPZ6FOCZLCO/graph.json","events_json":"https://pith.science/api/pith-number/G2QKYWCF66RZC5SDPZ6FOCZLCO/events.json","paper":"https://pith.science/paper/G2QKYWCF"},"agent_actions":{"view_html":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO","download_json":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO.json","view_paper":"https://pith.science/paper/G2QKYWCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02170&json=true","fetch_graph":"https://pith.science/api/pith-number/G2QKYWCF66RZC5SDPZ6FOCZLCO/graph.json","fetch_events":"https://pith.science/api/pith-number/G2QKYWCF66RZC5SDPZ6FOCZLCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO/action/storage_attestation","attest_author":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO/action/author_attestation","sign_citation":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO/action/citation_signature","submit_replication":"https://pith.science/pith/G2QKYWCF66RZC5SDPZ6FOCZLCO/action/replication_record"}},"created_at":"2026-05-18T00:38:42.043228+00:00","updated_at":"2026-05-18T00:38:42.043228+00:00"}