{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57KSJOG64X3FB47O6TDIYPM7QM","short_pith_number":"pith:57KSJOG6","schema_version":"1.0","canonical_sha256":"efd524b8dee5f650f3eef4c68c3d9f833cb6e1a3e04a970c12bd1cb84188071e","source":{"kind":"arxiv","id":"1704.06948","version":3},"attestation_state":"computed","paper":{"title":"A Note on the Forward-Douglas--Rachford Splitting for Monotone Inclusion and Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hugo Raguet","submitted_at":"2017-04-23T16:32:40Z","abstract_excerpt":"We shed light on the structure of the \"three-operator\" version of the forward-Douglas--Rachford splitting algorithm for finding a zero of a sum of maximally monotone operators $A + B + C$, where $B$ is cocoercive, involving only the computation of $B$ and of the resolvent of $A$ and of $C$, separately. We show that it is a straightforward extension of a fixed-point algorithm proposed by us as a generalization of the forward-backward splitting algorithm, initially designed for finding a zero of a sum of an arbitrary number of maximally monotone operators $\\sum_{i=1}^n A_i + B$, where $B$ is coc"},"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":"1704.06948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-23T16:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"b8249321859214bdf8a34d77c259717496988ffd34a19366fc1e837c8ba0610e","abstract_canon_sha256":"37d9ec10e8a3acf2382b438b836e73fddb7d8cd9d0d3e04ca3fafa69167af8c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.519387Z","signature_b64":"yeXuLCgzqmNzrBdaas4dQ1TjKpMbBCueBSGwikRoZ+QHCTDOIJaLjGmulmxJfX1PJ6wLLobBtsWENi7I8QzRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd524b8dee5f650f3eef4c68c3d9f833cb6e1a3e04a970c12bd1cb84188071e","last_reissued_at":"2026-05-18T00:17:13.518714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.518714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Forward-Douglas--Rachford Splitting for Monotone Inclusion and Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hugo Raguet","submitted_at":"2017-04-23T16:32:40Z","abstract_excerpt":"We shed light on the structure of the \"three-operator\" version of the forward-Douglas--Rachford splitting algorithm for finding a zero of a sum of maximally monotone operators $A + B + C$, where $B$ is cocoercive, involving only the computation of $B$ and of the resolvent of $A$ and of $C$, separately. We show that it is a straightforward extension of a fixed-point algorithm proposed by us as a generalization of the forward-backward splitting algorithm, initially designed for finding a zero of a sum of an arbitrary number of maximally monotone operators $\\sum_{i=1}^n A_i + B$, where $B$ is coc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06948","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":"1704.06948","created_at":"2026-05-18T00:17:13.518795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06948v3","created_at":"2026-05-18T00:17:13.518795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06948","created_at":"2026-05-18T00:17:13.518795+00:00"},{"alias_kind":"pith_short_12","alias_value":"57KSJOG64X3F","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57KSJOG64X3FB47O","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57KSJOG6","created_at":"2026-05-18T12:31:00.734936+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/57KSJOG64X3FB47O6TDIYPM7QM","json":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM.json","graph_json":"https://pith.science/api/pith-number/57KSJOG64X3FB47O6TDIYPM7QM/graph.json","events_json":"https://pith.science/api/pith-number/57KSJOG64X3FB47O6TDIYPM7QM/events.json","paper":"https://pith.science/paper/57KSJOG6"},"agent_actions":{"view_html":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM","download_json":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM.json","view_paper":"https://pith.science/paper/57KSJOG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06948&json=true","fetch_graph":"https://pith.science/api/pith-number/57KSJOG64X3FB47O6TDIYPM7QM/graph.json","fetch_events":"https://pith.science/api/pith-number/57KSJOG64X3FB47O6TDIYPM7QM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM/action/storage_attestation","attest_author":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM/action/author_attestation","sign_citation":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM/action/citation_signature","submit_replication":"https://pith.science/pith/57KSJOG64X3FB47O6TDIYPM7QM/action/replication_record"}},"created_at":"2026-05-18T00:17:13.518795+00:00","updated_at":"2026-05-18T00:17:13.518795+00:00"}