{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PMDG3MYDMOC5ZIAMGMRJZBQGM5","short_pith_number":"pith:PMDG3MYD","schema_version":"1.0","canonical_sha256":"7b066db3036385dca00c33229c8606674a33c3fab2d66c3b3691b3c8a7dfcb29","source":{"kind":"arxiv","id":"1108.4404","version":3},"attestation_state":"computed","paper":{"title":"Generalized Forward-Backward Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Peyr\\'e, Hugo Raguet, Jalal Fadili","submitted_at":"2011-08-22T19:37:42Z","abstract_excerpt":"This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form $F + \\sum_{i=1}^n G_i$, where $F$ has a Lipschitz-continuous gradient and the $G_i$'s are simple in the sense that their Moreau proximity operators are easy to compute. While the forward-backward algorithm cannot deal with more than $n = 1$ non-smooth function, our method generalizes it to the case of arbitrary $n$. Our method makes an explicit use of the regularity of $F$ in the forward step, and the proximity operators of the $G_i$'s are applied in parallel in the backward s"},"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":"1108.4404","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-22T19:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"8d9efb778537d6d2cab7008abc1d0566a6f5ebfd780f83cebf91a8fff10c653f","abstract_canon_sha256":"7be2c02e73e00e3d6fb8bf72309f321f476bb7fe10348f0247655c6a9a83695f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:45.439166Z","signature_b64":"00WwNSLOR57K4ED+cmYKdChqQ44AJptdGaYYX2r91gxZcu644ftlV9LVZ8kmZ5oEQSvmfRj42Dbo17W2RE9sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b066db3036385dca00c33229c8606674a33c3fab2d66c3b3691b3c8a7dfcb29","last_reissued_at":"2026-05-18T02:59:45.438283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:45.438283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Forward-Backward Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Peyr\\'e, Hugo Raguet, Jalal Fadili","submitted_at":"2011-08-22T19:37:42Z","abstract_excerpt":"This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form $F + \\sum_{i=1}^n G_i$, where $F$ has a Lipschitz-continuous gradient and the $G_i$'s are simple in the sense that their Moreau proximity operators are easy to compute. While the forward-backward algorithm cannot deal with more than $n = 1$ non-smooth function, our method generalizes it to the case of arbitrary $n$. Our method makes an explicit use of the regularity of $F$ in the forward step, and the proximity operators of the $G_i$'s are applied in parallel in the backward s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4404","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":"1108.4404","created_at":"2026-05-18T02:59:45.438444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4404v3","created_at":"2026-05-18T02:59:45.438444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4404","created_at":"2026-05-18T02:59:45.438444+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMDG3MYDMOC5","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMDG3MYDMOC5ZIAM","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMDG3MYD","created_at":"2026-05-18T12:26:39.201973+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/PMDG3MYDMOC5ZIAMGMRJZBQGM5","json":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5.json","graph_json":"https://pith.science/api/pith-number/PMDG3MYDMOC5ZIAMGMRJZBQGM5/graph.json","events_json":"https://pith.science/api/pith-number/PMDG3MYDMOC5ZIAMGMRJZBQGM5/events.json","paper":"https://pith.science/paper/PMDG3MYD"},"agent_actions":{"view_html":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5","download_json":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5.json","view_paper":"https://pith.science/paper/PMDG3MYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4404&json=true","fetch_graph":"https://pith.science/api/pith-number/PMDG3MYDMOC5ZIAMGMRJZBQGM5/graph.json","fetch_events":"https://pith.science/api/pith-number/PMDG3MYDMOC5ZIAMGMRJZBQGM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5/action/storage_attestation","attest_author":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5/action/author_attestation","sign_citation":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5/action/citation_signature","submit_replication":"https://pith.science/pith/PMDG3MYDMOC5ZIAMGMRJZBQGM5/action/replication_record"}},"created_at":"2026-05-18T02:59:45.438444+00:00","updated_at":"2026-05-18T02:59:45.438444+00:00"}