{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E6YHGHLSVZOYZ6CIVUPZUQI5QG","short_pith_number":"pith:E6YHGHLS","canonical_record":{"source":{"id":"1907.01543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9c48ec5138ddcb6e8efcd1659eccb062610888a8c93b0445703b91fdafe65488","abstract_canon_sha256":"082697e1c53249771671ab252ea7569c44d791b5a66cbb50167a898c25fa651a"},"schema_version":"1.0"},"canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","source":{"kind":"arxiv","id":"1907.01543","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E6YHGHLSVZOYZ6CIVUPZUQI5QG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9c48ec5138ddcb6e8efcd1659eccb062610888a8c93b0445703b91fdafe65488","abstract_canon_sha256":"082697e1c53249771671ab252ea7569c44d791b5a66cbb50167a898c25fa651a"},"schema_version":"1.0"},"canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.077873Z","signature_b64":"OhnbV4Lh0u8+JAeP95kVsVJof9fF3L/kvJ6/bZq1Imhdh6HEV/wmRNwFsCNfAB8XwdAfDpnC/DHcHiQLLndABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","last_reissued_at":"2026-05-17T23:41:40.077176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.077176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01543","source_version":1,"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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRSQbScXyEmQsL/RKdt67FlQ1QnYLu+dt8dylomJ35Y/gEl2ghug84YeTTxiFcAljUE+SlrDAz96tZUFaz4TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:43:38.202669Z"},"content_sha256":"d53af6425bf5f67078c26dfb53fb464f4b80680c35ffba94d3d41393c53f6e07","schema_version":"1.0","event_id":"sha256:d53af6425bf5f67078c26dfb53fb464f4b80680c35ffba94d3d41393c53f6e07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E6YHGHLSVZOYZ6CIVUPZUQI5QG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Smooth Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Kiran Koshy Thekumparampil, Praneeth Netrapalli, Prateek Jain, Sewoong Oh","submitted_at":"2019-07-02T17:50:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01543","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":""},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeHTAOaefi1OAdjSmY6q/+KQrTWC55XicCGP6QaMklf2Dn4CNml2LgYavIcG+BpfMOWjv8/9hZ6koB/vwwiGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:43:38.203274Z"},"content_sha256":"4934ef01d15e0e437aac58eb80a7d799871e00cfb75ee31c8a06464cd9e713fd","schema_version":"1.0","event_id":"sha256:4934ef01d15e0e437aac58eb80a7d799871e00cfb75ee31c8a06464cd9e713fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/bundle.json","state_url":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/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-26T04:43:38Z","links":{"resolver":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG","bundle":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/bundle.json","state":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBDlRma/8Fsc+88nIioBEy75HLMKa6zklhgp/6LJDKsM2hebpDx4XA/BcO9ngSODus4LimT/KmDGy2sJDd+gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:43:38.207220Z","bundle_sha256":"8e44175f64066ba2c1cf8778fb6cc290bb612f298127f25c90559472f1b0149b"}}