{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E6YHGHLSVZOYZ6CIVUPZUQI5QG","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":"082697e1c53249771671ab252ea7569c44d791b5a66cbb50167a898c25fa651a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","title_canon_sha256":"9c48ec5138ddcb6e8efcd1659eccb062610888a8c93b0445703b91fdafe65488"},"schema_version":"1.0","source":{"id":"1907.01543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01543","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01543v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01543","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"E6YHGHLSVZOY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E6YHGHLSVZOYZ6CI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E6YHGHLS","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4934ef01d15e0e437aac58eb80a7d799871e00cfb75ee31c8a06464cd9e713fd","target":"graph","created_at":"2026-05-17T23:41:40Z","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"},"paper":{"abstract_excerpt":"This paper studies first order methods for solving smooth minimax optimization problems $\\min_x \\max_y g(x,y)$ where $g(\\cdot,\\cdot)$ is smooth and $g(x,\\cdot)$ is concave for each $x$. In terms of $g(\\cdot,y)$, we consider two settings -- strongly convex and nonconvex -- and improve upon the best known rates in both. For strongly-convex $g(\\cdot, y),\\ \\forall y$, we propose a new algorithm combining Mirror-Prox and Nesterov's AGD, and show that it can find global optimum in $\\tilde{O}(1/k^2)$ iterations, improving over current state-of-the-art rate of $O(1/k)$. We use this result along with a","authors_text":"Kiran Koshy Thekumparampil, Praneeth Netrapalli, Prateek Jain, Sewoong Oh","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","title":"Efficient Algorithms for Smooth Minimax Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01543","kind":"arxiv","version":1},"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:d53af6425bf5f67078c26dfb53fb464f4b80680c35ffba94d3d41393c53f6e07","target":"record","created_at":"2026-05-17T23:41:40Z","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":"082697e1c53249771671ab252ea7569c44d791b5a66cbb50167a898c25fa651a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","title_canon_sha256":"9c48ec5138ddcb6e8efcd1659eccb062610888a8c93b0445703b91fdafe65488"},"schema_version":"1.0","source":{"id":"1907.01543","kind":"arxiv","version":1}},"canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","first_computed_at":"2026-05-17T23:41:40.077176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.077176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OhnbV4Lh0u8+JAeP95kVsVJof9fF3L/kvJ6/bZq1Imhdh6HEV/wmRNwFsCNfAB8XwdAfDpnC/DHcHiQLLndABA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.077873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d53af6425bf5f67078c26dfb53fb464f4b80680c35ffba94d3d41393c53f6e07","sha256:4934ef01d15e0e437aac58eb80a7d799871e00cfb75ee31c8a06464cd9e713fd"],"state_sha256":"76c35917c5e6ed5cfee20921b2efbc2a218384f7ef6c98fcc0704ea380a9c360"}