{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VGYYPAKLORUBXF6RW7EIZ6CBGR","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":"28f1bf422c85017582e9d2b6109e0242bbe0d53a35523a3d8a225e4e8b8f4a0b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:56:41Z","title_canon_sha256":"a1429e7b6ca2a6eca00320401dd44bf2cd432991bb1a7621b44eee117796a8f6"},"schema_version":"1.0","source":{"id":"2406.02016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02016","created_at":"2026-07-05T09:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02016v2","created_at":"2026-07-05T09:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02016","created_at":"2026-07-05T09:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"VGYYPAKLORUB","created_at":"2026-07-05T09:33:32Z"},{"alias_kind":"pith_short_16","alias_value":"VGYYPAKLORUBXF6R","created_at":"2026-07-05T09:33:32Z"},{"alias_kind":"pith_short_8","alias_value":"VGYYPAKL","created_at":"2026-07-05T09:33:32Z"}],"graph_snapshots":[{"event_id":"sha256:72c2907517250260702e7d0f08445667834730ff10168c2ec4ce9acd0f75a288","target":"graph","created_at":"2026-07-05T09:33:32Z","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/2406.02016/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose adaptive, line search-free second-order methods with optimal rate of convergence for solving convex-concave min-max problems. By means of an adaptive step size, our algorithms feature a simple update rule that requires solving only one linear system per iteration, eliminating the need for line search or backtracking mechanisms. Specifically, we base our algorithms on the optimistic method and appropriately combine it with second-order information. Moreover, distinct from common adaptive schemes, we define the step size recursively as a function of the gradient norm and the predictio","authors_text":"Ali Kavis, Aryan Mokhtari, Qiujiang Jin, Ruichen Jiang, Sujay Sanghavi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:56:41Z","title":"Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02016","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:ab41108ab9cea15ed9997230759ef6064d882e3550cc6b728b888bb7db96fa0a","target":"record","created_at":"2026-07-05T09:33:32Z","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":"28f1bf422c85017582e9d2b6109e0242bbe0d53a35523a3d8a225e4e8b8f4a0b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:56:41Z","title_canon_sha256":"a1429e7b6ca2a6eca00320401dd44bf2cd432991bb1a7621b44eee117796a8f6"},"schema_version":"1.0","source":{"id":"2406.02016","kind":"arxiv","version":2}},"canonical_sha256":"a9b187814b74681b97d1b7c88cf84134482440ae19fc4c20de8a99934ad74468","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9b187814b74681b97d1b7c88cf84134482440ae19fc4c20de8a99934ad74468","first_computed_at":"2026-07-05T09:33:32.553031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:33:32.553031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iO4gfQnuOZdLTvOsQImsrtLHbP8BXT8DT6ixhjXbTSdJTjBVSCokA6afOvxOYRp9GglUplgAnnRhTfVi5i8CCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:33:32.553480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab41108ab9cea15ed9997230759ef6064d882e3550cc6b728b888bb7db96fa0a","sha256:72c2907517250260702e7d0f08445667834730ff10168c2ec4ce9acd0f75a288"],"state_sha256":"e8875afc6c963d21779eb6f9f594926578477474c29ec6ca40bc55476536d89a"}