{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YA5UDDFXVVUDFTBGBB4OGDCGBQ","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":"f3dac8bc521e35e920efac876d757889f3f693ec5601f345856980e5cf6ef1c2","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-22T22:54:54Z","title_canon_sha256":"9921bc9c2b4231c5980ecc6336cab2ce07c7980f6b7aa2a95f796afdf4101e66"},"schema_version":"1.0","source":{"id":"2010.12100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12100","created_at":"2026-07-05T01:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12100v2","created_at":"2026-07-05T01:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12100","created_at":"2026-07-05T01:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"YA5UDDFXVVUD","created_at":"2026-07-05T01:52:59Z"},{"alias_kind":"pith_short_16","alias_value":"YA5UDDFXVVUDFTBG","created_at":"2026-07-05T01:52:59Z"},{"alias_kind":"pith_short_8","alias_value":"YA5UDDFX","created_at":"2026-07-05T01:52:59Z"}],"graph_snapshots":[{"event_id":"sha256:6bf8961ba48266bb362ff24db44a21a3349dbf701c0c9e79b70fcb99037ea92b","target":"graph","created_at":"2026-07-05T01:52:59Z","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/2010.12100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones. Thanks to this adaptation mechanism, the proposed method automatically detects whether the problem is smooth or not, without requiring any prior tuning by the optimizer. As a result, the algorithm simultaneously achieves order-optimal convergence rates, i.e., it converges to an $\\varepsilon$-optimal solution within $\\mathcal{O}(1/\\varepsilon)$ iterations in smooth problems, and with","authors_text":"E. Veronica Belmega, Kimon Antonakopoulos, Panayotis Mertikopoulos","cross_cats":["cs.GT","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-22T22:54:54Z","title":"Adaptive extra-gradient methods for min-max optimization and games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12100","kind":"arxiv","version":2},"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:92e8e89e34bfb120cb5862fbb94ebdf016ae204e3cc1509ab9d594223501b4e3","target":"record","created_at":"2026-07-05T01:52:59Z","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":"f3dac8bc521e35e920efac876d757889f3f693ec5601f345856980e5cf6ef1c2","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-22T22:54:54Z","title_canon_sha256":"9921bc9c2b4231c5980ecc6336cab2ce07c7980f6b7aa2a95f796afdf4101e66"},"schema_version":"1.0","source":{"id":"2010.12100","kind":"arxiv","version":2}},"canonical_sha256":"c03b418cb7ad6832cc260878e30c460c02feefe0815d3d0717fff5918f5fa748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c03b418cb7ad6832cc260878e30c460c02feefe0815d3d0717fff5918f5fa748","first_computed_at":"2026-07-05T01:52:59.947866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:59.947866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1L5MbcP+a157KHY1Tq2Q2yeU2IfjXU0D7J0oQkg2MnNFQA/mmmLHHE3AWmTdTytoSnhZygDIwhfCT4DYo6fWAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:59.948265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92e8e89e34bfb120cb5862fbb94ebdf016ae204e3cc1509ab9d594223501b4e3","sha256:6bf8961ba48266bb362ff24db44a21a3349dbf701c0c9e79b70fcb99037ea92b"],"state_sha256":"2918d85b97657e9fdaa0e20777bf9db397fd83333638e7e0a8fe0d9ba381bacc"}