{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XXD3NETVYQOKVQOKA2TCCLLT7J","short_pith_number":"pith:XXD3NETV","schema_version":"1.0","canonical_sha256":"bdc7b69275c41caac1ca06a6212d73fa42845fd691b8535366dbd0cbdcbb9b2c","source":{"kind":"arxiv","id":"2506.07397","version":1},"attestation_state":"computed","paper":{"title":"Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jiajin Li, Taoli Zheng","submitted_at":"2025-06-09T03:39:21Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.07397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-09T03:39:21Z","cross_cats_sorted":[],"title_canon_sha256":"53d44c04418bb1c4c97c195eff5f75f5da0f2d923c0c614597299a84d78a60bc","abstract_canon_sha256":"7faf8ad072663f587ed06a547bef956acb28cd0c8bcbfa35945539db8676d59c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:26.526394Z","signature_b64":"Fse06koAZVzilT+bIpIfVTVfQnxbscg7AHN4KCtDAKev7FmCdgMY/z5YR9DeReWM7d7an+gLL32r5riiekVhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdc7b69275c41caac1ca06a6212d73fa42845fd691b8535366dbd0cbdcbb9b2c","last_reissued_at":"2026-07-05T11:18:26.525887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:26.525887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jiajin Li, Taoli Zheng","submitted_at":"2025-06-09T03:39:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07397","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.07397/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.07397","created_at":"2026-07-05T11:18:26.525940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07397v1","created_at":"2026-07-05T11:18:26.525940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07397","created_at":"2026-07-05T11:18:26.525940+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXD3NETVYQOK","created_at":"2026-07-05T11:18:26.525940+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXD3NETVYQOKVQOK","created_at":"2026-07-05T11:18:26.525940+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXD3NETV","created_at":"2026-07-05T11:18:26.525940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.01932","citing_title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J","json":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J.json","graph_json":"https://pith.science/api/pith-number/XXD3NETVYQOKVQOKA2TCCLLT7J/graph.json","events_json":"https://pith.science/api/pith-number/XXD3NETVYQOKVQOKA2TCCLLT7J/events.json","paper":"https://pith.science/paper/XXD3NETV"},"agent_actions":{"view_html":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J","download_json":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J.json","view_paper":"https://pith.science/paper/XXD3NETV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07397&json=true","fetch_graph":"https://pith.science/api/pith-number/XXD3NETVYQOKVQOKA2TCCLLT7J/graph.json","fetch_events":"https://pith.science/api/pith-number/XXD3NETVYQOKVQOKA2TCCLLT7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J/action/storage_attestation","attest_author":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J/action/author_attestation","sign_citation":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J/action/citation_signature","submit_replication":"https://pith.science/pith/XXD3NETVYQOKVQOKA2TCCLLT7J/action/replication_record"}},"created_at":"2026-07-05T11:18:26.525940+00:00","updated_at":"2026-07-05T11:18:26.525940+00:00"}