{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SO2S2SZVKQ3WE6TX2N4DK3SIVU","short_pith_number":"pith:SO2S2SZV","schema_version":"1.0","canonical_sha256":"93b52d4b355437627a77d378356e48ad203b3416f65c2f419e11ef63dc00b0e2","source":{"kind":"arxiv","id":"2605.26985","version":1},"attestation_state":"computed","paper":{"title":"A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdurakhmon Sadiev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2026-05-26T13:11:08Z","abstract_excerpt":"Composite optimization problems, formulated as the minimization of three functions, are ubiquitous in large-scale machine learning and signal processing. While state-of-the-art splitting methods such as Condat-V\\~{u} (CV) [Condat, 2013, V\\~{u}, 2013], Primal-Dual Davis-Yin (PDDY) [Salim et al., 2022b], and Primal-Dual Twice Reflected (PDTR) [Malitsky and Tam, 2026] are highly versatile, they inherently exhibit non-accelerated convergence rates. Existing accelerated primal-dual splitting results either focus on special structures like one of the functions being zero, or linearly constrained pro"},"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.26985","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-26T13:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"9be387558724abf84c5f343751f6177fb0f1c490bf1a341a4ee52d130574879b","abstract_canon_sha256":"0a63e6a332a9f5854066738d80d1866b8859b14e111b64cf64f9b384fbac1fde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:22.876699Z","signature_b64":"5iPNIGXAA0svq+MHmfBZmTdnlHbH599zwSuTlaw0rHaIK3IOZkkmrqpggMAyRGCoWFBnMRWvodCTQiNFEZaCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b52d4b355437627a77d378356e48ad203b3416f65c2f419e11ef63dc00b0e2","last_reissued_at":"2026-05-27T01:06:22.876069Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:22.876069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdurakhmon Sadiev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2026-05-26T13:11:08Z","abstract_excerpt":"Composite optimization problems, formulated as the minimization of three functions, are ubiquitous in large-scale machine learning and signal processing. While state-of-the-art splitting methods such as Condat-V\\~{u} (CV) [Condat, 2013, V\\~{u}, 2013], Primal-Dual Davis-Yin (PDDY) [Salim et al., 2022b], and Primal-Dual Twice Reflected (PDTR) [Malitsky and Tam, 2026] are highly versatile, they inherently exhibit non-accelerated convergence rates. Existing accelerated primal-dual splitting results either focus on special structures like one of the functions being zero, or linearly constrained pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26985","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26985/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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.26985","created_at":"2026-05-27T01:06:22.876167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26985v1","created_at":"2026-05-27T01:06:22.876167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26985","created_at":"2026-05-27T01:06:22.876167+00:00"},{"alias_kind":"pith_short_12","alias_value":"SO2S2SZVKQ3W","created_at":"2026-05-27T01:06:22.876167+00:00"},{"alias_kind":"pith_short_16","alias_value":"SO2S2SZVKQ3WE6TX","created_at":"2026-05-27T01:06:22.876167+00:00"},{"alias_kind":"pith_short_8","alias_value":"SO2S2SZV","created_at":"2026-05-27T01:06:22.876167+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/SO2S2SZVKQ3WE6TX2N4DK3SIVU","json":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU.json","graph_json":"https://pith.science/api/pith-number/SO2S2SZVKQ3WE6TX2N4DK3SIVU/graph.json","events_json":"https://pith.science/api/pith-number/SO2S2SZVKQ3WE6TX2N4DK3SIVU/events.json","paper":"https://pith.science/paper/SO2S2SZV"},"agent_actions":{"view_html":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU","download_json":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU.json","view_paper":"https://pith.science/paper/SO2S2SZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26985&json=true","fetch_graph":"https://pith.science/api/pith-number/SO2S2SZVKQ3WE6TX2N4DK3SIVU/graph.json","fetch_events":"https://pith.science/api/pith-number/SO2S2SZVKQ3WE6TX2N4DK3SIVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU/action/storage_attestation","attest_author":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU/action/author_attestation","sign_citation":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU/action/citation_signature","submit_replication":"https://pith.science/pith/SO2S2SZVKQ3WE6TX2N4DK3SIVU/action/replication_record"}},"created_at":"2026-05-27T01:06:22.876167+00:00","updated_at":"2026-05-27T01:06:22.876167+00:00"}