{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KTN5TGHG32MTNHRASY4H7MA5Z5","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":"063008152ca99f108e9cd0f6ab7bf19ded3e94084422f9d65b4d3988abd9ac23","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T17:09:10Z","title_canon_sha256":"fb29e5533f0942fc34dcadc018e591d8fec7fd476957f41ba7118b3e0d847b66"},"schema_version":"1.0","source":{"id":"1901.08511","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08511","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08511v4","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08511","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"KTN5TGHG32MT","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"KTN5TGHG32MTNHRA","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"KTN5TGHG","created_at":"2026-07-05T00:02:25Z"}],"graph_snapshots":[{"event_id":"sha256:6d71a32ed444e26862ee0e96690c95f32175cb6434f7e68edc573ea7dea3de83","target":"graph","created_at":"2026-07-05T00:02:25Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.08511/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider solving saddle point problems using two variants of Gradient Descent-Ascent algorithms, Extra-gradient (EG) and Optimistic Gradient Descent Ascent (OGDA) methods. We show that both of these algorithms admit a unified analysis as approximations of the classical proximal point method for solving saddle point problems. This viewpoint enables us to develop a new framework for analyzing EG and OGDA for bilinear and strongly convex-strongly concave settings. Moreover, we use the proximal point approximation interpretation to generalize the results for OGDA for a wide range ","authors_text":"Aryan Mokhtari, Asuman Ozdaglar, Sarath Pattathil","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T17:09:10Z","title":"A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08511","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:de8aa6ab1ce052083cea85ab5aa129059c032c4ef5f95a44671af8a7adf09fd5","target":"record","created_at":"2026-07-05T00:02:25Z","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":"063008152ca99f108e9cd0f6ab7bf19ded3e94084422f9d65b4d3988abd9ac23","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T17:09:10Z","title_canon_sha256":"fb29e5533f0942fc34dcadc018e591d8fec7fd476957f41ba7118b3e0d847b66"},"schema_version":"1.0","source":{"id":"1901.08511","kind":"arxiv","version":4}},"canonical_sha256":"54dbd998e6de99369e2096387fb01dcf713593839fb05faa3ea3aa8f5c88979a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54dbd998e6de99369e2096387fb01dcf713593839fb05faa3ea3aa8f5c88979a","first_computed_at":"2026-07-05T00:02:25.108103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:25.108103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VsbzBvRcZVMy7z8ly2niyRx/JlJz3sUKAm6vtBxf0Rj3lEmmMClaPYVCWv7CpoUm4aG9fIYW1flUKslj+RXSDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:25.108483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08511","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de8aa6ab1ce052083cea85ab5aa129059c032c4ef5f95a44671af8a7adf09fd5","sha256:6d71a32ed444e26862ee0e96690c95f32175cb6434f7e68edc573ea7dea3de83"],"state_sha256":"fa852fe42787dd6ccbd3ed288fb3bdb96fb8162981f6e7bca0326206d6a749f5"}