{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CO7X4HHQBAFAONA2P3TTBSCJL5","short_pith_number":"pith:CO7X4HHQ","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"},"canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","source":{"kind":"arxiv","id":"2605.08593","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08593","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08593v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08593","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"CO7X4HHQBAFA","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"CO7X4HHQBAFAONA2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"CO7X4HHQ","created_at":"2026-05-21T01:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CO7X4HHQBAFAONA2P3TTBSCJL5","target":"record","payload":{"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"},"canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","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"},"source_kind":"arxiv","source_id":"2605.08593","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyEH6JYdIlshMK3stvh26RlryK8oAapCbwzVdIWF7HRjOggMBC9HO2oYapw33Askf5CpH5IYgVGTiKsbbqm9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:42:35.086362Z"},"content_sha256":"31d914887764eaaca354f5d06c1cb01e86b1ade1689f6e6899e1ac986362b30f","schema_version":"1.0","event_id":"sha256:31d914887764eaaca354f5d06c1cb01e86b1ade1689f6e6899e1ac986362b30f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CO7X4HHQBAFAONA2P3TTBSCJL5","target":"graph","payload":{"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"},"verdict_id":"d508e283-8f96-4034-b064-fa6ea4207002"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JB9D7yRRJq/i8gvxyNy425uCQnJsyGU20m6yvpva9bh+XcoAAghDif3uNzxkFMRCo6ajW2NWIEcqVsnoOMUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:42:35.087424Z"},"content_sha256":"8a505911380961f86744dc572538d6a60b5e1da83a8abbc40cfb06edc8b18bf0","schema_version":"1.0","event_id":"sha256:8a505911380961f86744dc572538d6a60b5e1da83a8abbc40cfb06edc8b18bf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/bundle.json","state_url":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T18:42:35Z","links":{"resolver":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5","bundle":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/bundle.json","state":"https://pith.science/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO7X4HHQBAFAONA2P3TTBSCJL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CO7X4HHQBAFAONA2P3TTBSCJL5","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":"58ff501d4b7e62d45e5cd1bf65ab2f98942855a45ea649f9494f5f78ee3425f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-09T01:17:24Z","title_canon_sha256":"b764907f518978ab8e27fde567bb48d5269ec51ff018fd48a8aa7ef5ceaf4a1d"},"schema_version":"1.0","source":{"id":"2605.08593","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08593","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08593v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08593","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"CO7X4HHQBAFA","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"CO7X4HHQBAFAONA2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"CO7X4HHQ","created_at":"2026-05-21T01:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:8a505911380961f86744dc572538d6a60b5e1da83a8abbc40cfb06edc8b18bf0","target":"graph","created_at":"2026-05-21T01:04:27Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FDR achieves the optimal O(1/N²) convergence rate with the best leading constant for proximal minimization of convex plus strongly convex functions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions."}],"snapshot_sha256":"44bd5081a84a60745e538d2e324740c111ac80de631b411628e0611d1999991e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.08593/integrity.json","findings":[],"snapshot_sha256":"a91f20907de8745d18110d33a0546f922e0874f4a8c6f5d58b5052145aab64b6","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Beh\\c{c}et A\\c{c}{\\i}kme\\c{s}e, Ernest K. Ryu, Govind M. Chari, Uijeong Jang","cross_cats":[],"headline":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-09T01:17:24Z","title":"Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.08593","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T01:40:31.915340Z","id":"d508e283-8f96-4034-b064-fa6ea4207002","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Fast Douglas-Rachford Splitting achieves optimal O(1/N²) convergence for sums of convex and strongly convex functions.","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.","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."}},"verdict_id":"d508e283-8f96-4034-b064-fa6ea4207002"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:31d914887764eaaca354f5d06c1cb01e86b1ade1689f6e6899e1ac986362b30f","target":"record","created_at":"2026-05-21T01:04:27Z","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":"58ff501d4b7e62d45e5cd1bf65ab2f98942855a45ea649f9494f5f78ee3425f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-09T01:17:24Z","title_canon_sha256":"b764907f518978ab8e27fde567bb48d5269ec51ff018fd48a8aa7ef5ceaf4a1d"},"schema_version":"1.0","source":{"id":"2605.08593","kind":"arxiv","version":2}},"canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bf7e1cf0080a07341a7ee730c8495f474e54e26ab260c4c0c8fd7b5c5e7c5a","first_computed_at":"2026-05-21T01:04:27.232352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:27.232352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FlUb0DV5XZvDQbHlmfptSLLxELKLxOAecYBJBXNyD4I2Yf2pS56tzcs+GWNTg/sKloinHiZcXeGfmR9DtJgZBg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:27.233069Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.08593","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31d914887764eaaca354f5d06c1cb01e86b1ade1689f6e6899e1ac986362b30f","sha256:8a505911380961f86744dc572538d6a60b5e1da83a8abbc40cfb06edc8b18bf0"],"state_sha256":"531fb47cea138ed11c28b77648bc89070c6ba2e6d1562297888b107708124203"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOL1dfycW4Uh2mg3o1UHGvXEnr2xPGW47A/bXDoq6DLbtzSRCDg6CBUXRyOEiJCYtmB2SwTDykib0ZqKZ+qSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:42:35.090809Z","bundle_sha256":"b31c1e663e0640d932cb69158b9b09a8f35fd2bf80efb284f81fc37a591a8a8b"}}