{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6J5HMPDEGPGFGHOVA4EGT6IRDZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41bcd4d30202d27c4551b6053a8df457472d47429ba5c799dd431107b980c355","cross_cats_sorted":["cs.CV","cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-03T00:58:23Z","title_canon_sha256":"628f71eaabebcd7ace7fa98085f2ff724223e96c7e86469c02b8922dd09db949"},"schema_version":"1.0","source":{"id":"2005.00959","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.00959","created_at":"2026-07-05T03:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2005.00959v3","created_at":"2026-07-05T03:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00959","created_at":"2026-07-05T03:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"6J5HMPDEGPGF","created_at":"2026-07-05T03:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"6J5HMPDEGPGFGHOV","created_at":"2026-07-05T03:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"6J5HMPDE","created_at":"2026-07-05T03:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:83315cc59ef3778fc9e3a29109ae17afe3063f718e23c9890f990b212c4102d4","target":"graph","created_at":"2026-07-05T03:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.00959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ill-posed linear inverse problems appear in many scientific setups, and are typically addressed by solving optimization problems, which are composed of data fidelity and prior terms. Recently, several works have considered a back-projection (BP) based fidelity term as an alternative to the common least squares (LS), and demonstrated excellent results for popular inverse problems. These works have also empirically shown that using the BP term, rather than the LS term, requires fewer iterations of optimization algorithms. In this paper, we examine the convergence rate of the projected gradient d","authors_text":"Raja Giryes, Tom Tirer","cross_cats":["cs.CV","cs.LG","cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-03T00:58:23Z","title":"On the Convergence Rate of Projected Gradient Descent for a Back-Projection based Objective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00959","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5a12c0281a401e77af34385f70ffb02b01569ec548dc42715a86b943532eb94c","target":"record","created_at":"2026-07-05T03:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41bcd4d30202d27c4551b6053a8df457472d47429ba5c799dd431107b980c355","cross_cats_sorted":["cs.CV","cs.LG","cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-03T00:58:23Z","title_canon_sha256":"628f71eaabebcd7ace7fa98085f2ff724223e96c7e86469c02b8922dd09db949"},"schema_version":"1.0","source":{"id":"2005.00959","kind":"arxiv","version":3}},"canonical_sha256":"f27a763c6433cc531dd5070869f9111e7eecce262a4a793750c13ee394e6b397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f27a763c6433cc531dd5070869f9111e7eecce262a4a793750c13ee394e6b397","first_computed_at":"2026-07-05T03:04:01.042858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:04:01.042858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YLoqaS4Rl/3GpoSg0zh+dzL2nJZ/VXtOEuD/1dNxiu0mKQFR0hmvI1Zg8jbRpigxav8TNuUQhpgznzdwjoIGAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:04:01.043356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.00959","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a12c0281a401e77af34385f70ffb02b01569ec548dc42715a86b943532eb94c","sha256:83315cc59ef3778fc9e3a29109ae17afe3063f718e23c9890f990b212c4102d4"],"state_sha256":"db68b20f4c692a69fd95f5225378226cca1806f2ca2d9c6cb552c812b489c60e"}