{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CO7X4HHQBAFAONA2P3TTBSCJL5","short_pith_number":"pith:CO7X4HHQ","schema_version":"1.0","canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","source":{"kind":"arxiv","id":"2605.08593","version":2},"attestation_state":"computed","paper":{"title":"Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Ernest K. Ryu, Govind M. Chari, Uijeong Jang","submitted_at":"2026-05-09T01:17:24Z","abstract_excerpt":"When minimizing the sum of a convex and a strongly convex function, or when finding the zero of the sum of a monotone operator and a strongly monotone operator, Chambolle and Pock (2010) and Davis and Yin (2015) proposed accelerated mechanisms that achieve an $\\mathcal{O}(1/N^2)$ convergence rate for the squared distance to the solution, but the optimality of this rate was not established. In this work, we present Fast Douglas--Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both "},"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":"2605.08593","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-09T01:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"b764907f518978ab8e27fde567bb48d5269ec51ff018fd48a8aa7ef5ceaf4a1d","abstract_canon_sha256":"58ff501d4b7e62d45e5cd1bf65ab2f98942855a45ea649f9494f5f78ee3425f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:27.233069Z","signature_b64":"FlUb0DV5XZvDQbHlmfptSLLxELKLxOAecYBJBXNyD4I2Yf2pS56tzcs+GWNTg/sKloinHiZcXeGfmR9DtJgZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","last_reissued_at":"2026-05-21T01:04:27.232352Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:27.232352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Ernest K. Ryu, Govind M. Chari, Uijeong Jang","submitted_at":"2026-05-09T01:17:24Z","abstract_excerpt":"When minimizing the sum of a convex and a strongly convex function, or when finding the zero of the sum of a monotone operator and a strongly monotone operator, Chambolle and Pock (2010) and Davis and Yin (2015) proposed accelerated mechanisms that achieve an $\\mathcal{O}(1/N^2)$ convergence rate for the squared distance to the solution, but the optimality of this rate was not established. In this work, we present Fast Douglas--Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we present Fast Douglas--Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both the O(1/N^2) convergence rate and the leading-order constant of FDR's rate are optimal.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The lower bound holds for the general class of convex-plus-strongly-convex problems (or monotone-plus-strongly-monotone operators) without extra structure or restrictions on the proximal operators.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FDR achieves the optimal O(1/N²) convergence rate with the best leading constant for proximal minimization of convex plus strongly convex functions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"44bd5081a84a60745e538d2e324740c111ac80de631b411628e0611d1999991e"},"source":{"id":"2605.08593","kind":"arxiv","version":2},"verdict":{"id":"d508e283-8f96-4034-b064-fa6ea4207002","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T01:40:31.915340Z","strongest_claim":"we present Fast Douglas--Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both the O(1/N^2) convergence rate and the leading-order constant of FDR's rate are optimal.","one_line_summary":"FDR achieves the optimal O(1/N²) convergence rate with the best leading constant for proximal minimization of convex plus strongly convex functions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The lower bound holds for the general class of convex-plus-strongly-convex problems (or monotone-plus-strongly-monotone operators) without extra structure or restrictions on the proximal operators.","pith_extraction_headline":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.08593/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T09:22:01.952391Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T22:38:10.085488Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T14:31:18.233612Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T10:59:19.992276Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a91f20907de8745d18110d33a0546f922e0874f4a8c6f5d58b5052145aab64b6"},"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":"2605.08593","created_at":"2026-05-21T01:04:27.232435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.08593v2","created_at":"2026-05-21T01:04:27.232435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08593","created_at":"2026-05-21T01:04:27.232435+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO7X4HHQBAFA","created_at":"2026-05-21T01:04:27.232435+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO7X4HHQBAFAONA2","created_at":"2026-05-21T01:04:27.232435+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO7X4HHQ","created_at":"2026-05-21T01:04:27.232435+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/CO7X4HHQBAFAONA2P3TTBSCJL5","json":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5.json","graph_json":"https://pith.science/api/pith-number/CO7X4HHQBAFAONA2P3TTBSCJL5/graph.json","events_json":"https://pith.science/api/pith-number/CO7X4HHQBAFAONA2P3TTBSCJL5/events.json","paper":"https://pith.science/paper/CO7X4HHQ"},"agent_actions":{"view_html":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5","download_json":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5.json","view_paper":"https://pith.science/paper/CO7X4HHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.08593&json=true","fetch_graph":"https://pith.science/api/pith-number/CO7X4HHQBAFAONA2P3TTBSCJL5/graph.json","fetch_events":"https://pith.science/api/pith-number/CO7X4HHQBAFAONA2P3TTBSCJL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/action/storage_attestation","attest_author":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/action/author_attestation","sign_citation":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/action/citation_signature","submit_replication":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/action/replication_record"}},"created_at":"2026-05-21T01:04:27.232435+00:00","updated_at":"2026-05-21T01:04:27.232435+00:00"}