{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ACEQWCZSTVBZE2AXOKJONVW777","short_pith_number":"pith:ACEQWCZS","schema_version":"1.0","canonical_sha256":"00890b0b329d439268177292e6d6dfffc2044aa16c2df13b29613c068a38c7e7","source":{"kind":"arxiv","id":"2605.18604","version":1},"attestation_state":"computed","paper":{"title":"Efficient Gradient Methods for Distributed Saddle Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Anton Rodomanov, Ruichen Luo, Sebastian U. Stich","submitted_at":"2026-05-18T16:14:04Z","abstract_excerpt":"The distributed setting for Saddle Problems (SPs) has recently emerged as a framework for various modern applications in machine learning and multiagent systems. Despite its relevance, the theoretical foundations of this setting have not yet been thoroughly established. In this paper, we advance this research direction by formalizing the distributed setup for SPs and providing rigorous definitions of communication and computational costs. Our main result is a novel decoupled method that achieves optimal communication cost within the zero-respecting framework. Our method is based on a multi-sta"},"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.18604","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-18T16:14:04Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"bb19babd82e77cdc603248f3b34888557f0142391fc8687d4f46b51d92d33038","abstract_canon_sha256":"bb07901f834dc78d7f70d2f5e8336a5268d28491a77546ed5f0cf42d9799a91f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:10.478052Z","signature_b64":"OVKIMDTYBXK4h1t70sj6ji7HKWz6LrBbYoa8d1cqbG3IDMyFrloluxrwUZHBd2CidIrpYR9uWe2W3VPleQ43Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00890b0b329d439268177292e6d6dfffc2044aa16c2df13b29613c068a38c7e7","last_reissued_at":"2026-05-20T00:06:10.477189Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:10.477189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Gradient Methods for Distributed Saddle Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Anton Rodomanov, Ruichen Luo, Sebastian U. Stich","submitted_at":"2026-05-18T16:14:04Z","abstract_excerpt":"The distributed setting for Saddle Problems (SPs) has recently emerged as a framework for various modern applications in machine learning and multiagent systems. Despite its relevance, the theoretical foundations of this setting have not yet been thoroughly established. In this paper, we advance this research direction by formalizing the distributed setup for SPs and providing rigorous definitions of communication and computational costs. Our main result is a novel decoupled method that achieves optimal communication cost within the zero-respecting framework. Our method is based on a multi-sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18604","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.18604/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T00:01:59.249486Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"cbfcfad13bcbd70d55e23d2a1924bcaeafa4c153fb3863e2304b04bff078ceb4"},"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.18604","created_at":"2026-05-20T00:06:10.477335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18604v1","created_at":"2026-05-20T00:06:10.477335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18604","created_at":"2026-05-20T00:06:10.477335+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACEQWCZSTVBZ","created_at":"2026-05-20T00:06:10.477335+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACEQWCZSTVBZE2AX","created_at":"2026-05-20T00:06:10.477335+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACEQWCZS","created_at":"2026-05-20T00:06:10.477335+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/ACEQWCZSTVBZE2AXOKJONVW777","json":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777.json","graph_json":"https://pith.science/api/pith-number/ACEQWCZSTVBZE2AXOKJONVW777/graph.json","events_json":"https://pith.science/api/pith-number/ACEQWCZSTVBZE2AXOKJONVW777/events.json","paper":"https://pith.science/paper/ACEQWCZS"},"agent_actions":{"view_html":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777","download_json":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777.json","view_paper":"https://pith.science/paper/ACEQWCZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18604&json=true","fetch_graph":"https://pith.science/api/pith-number/ACEQWCZSTVBZE2AXOKJONVW777/graph.json","fetch_events":"https://pith.science/api/pith-number/ACEQWCZSTVBZE2AXOKJONVW777/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777/action/storage_attestation","attest_author":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777/action/author_attestation","sign_citation":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777/action/citation_signature","submit_replication":"https://pith.science/pith/ACEQWCZSTVBZE2AXOKJONVW777/action/replication_record"}},"created_at":"2026-05-20T00:06:10.477335+00:00","updated_at":"2026-05-20T00:06:10.477335+00:00"}