{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XXD3NETVYQOKVQOKA2TCCLLT7J","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":"7faf8ad072663f587ed06a547bef956acb28cd0c8bcbfa35945539db8676d59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-09T03:39:21Z","title_canon_sha256":"53d44c04418bb1c4c97c195eff5f75f5da0f2d923c0c614597299a84d78a60bc"},"schema_version":"1.0","source":{"id":"2506.07397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07397","created_at":"2026-07-05T11:18:26Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07397v1","created_at":"2026-07-05T11:18:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07397","created_at":"2026-07-05T11:18:26Z"},{"alias_kind":"pith_short_12","alias_value":"XXD3NETVYQOK","created_at":"2026-07-05T11:18:26Z"},{"alias_kind":"pith_short_16","alias_value":"XXD3NETVYQOKVQOK","created_at":"2026-07-05T11:18:26Z"},{"alias_kind":"pith_short_8","alias_value":"XXD3NETV","created_at":"2026-07-05T11:18:26Z"}],"graph_snapshots":[{"event_id":"sha256:cac2d30aa0becc6c199eecb844aef4bb42ab4483139425434f6c37485d6499df","target":"graph","created_at":"2026-07-05T11:18:26Z","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/2506.07397/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Smooth minimax optimization problems play a central role in a wide range of applications, including machine learning, game theory, and operations research. However, existing algorithmic frameworks vary significantly depending on the problem structure -- whether it is convex-concave, nonconvex-concave, convex-nonconcave, or even nonconvex-nonconcave with additional regularity conditions. In particular, this diversity complicates the tuning of step-sizes since even verifying convexity (or concavity) assumptions is challenging and problem-dependent. We introduce a universal and single-loop algori","authors_text":"Anthony Man-Cho So, Jiajin Li, Taoli Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-09T03:39:21Z","title":"Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07397","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:bd8f0f45a1ff24e5341d45baf8f1182949011345d4d9283a140dc5fbd2dcadaf","target":"record","created_at":"2026-07-05T11:18:26Z","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":"7faf8ad072663f587ed06a547bef956acb28cd0c8bcbfa35945539db8676d59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-09T03:39:21Z","title_canon_sha256":"53d44c04418bb1c4c97c195eff5f75f5da0f2d923c0c614597299a84d78a60bc"},"schema_version":"1.0","source":{"id":"2506.07397","kind":"arxiv","version":1}},"canonical_sha256":"bdc7b69275c41caac1ca06a6212d73fa42845fd691b8535366dbd0cbdcbb9b2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdc7b69275c41caac1ca06a6212d73fa42845fd691b8535366dbd0cbdcbb9b2c","first_computed_at":"2026-07-05T11:18:26.525887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:26.525887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fse06koAZVzilT+bIpIfVTVfQnxbscg7AHN4KCtDAKev7FmCdgMY/z5YR9DeReWM7d7an+gLL32r5riiekVhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:26.526394Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd8f0f45a1ff24e5341d45baf8f1182949011345d4d9283a140dc5fbd2dcadaf","sha256:cac2d30aa0becc6c199eecb844aef4bb42ab4483139425434f6c37485d6499df"],"state_sha256":"0eebba33d2ed8ab3b38604550cfa03f68551265a207a74ddc30c37d16c5ef25a"}