{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7GOD5QBEZWTJ4LPKPT7YENOUMG","short_pith_number":"pith:7GOD5QBE","schema_version":"1.0","canonical_sha256":"f99c3ec024cda69e2dea7cff8235d461bbc018f26fcf0981867aac0e1cf75041","source":{"kind":"arxiv","id":"2311.02814","version":2},"attestation_state":"computed","paper":{"title":"A Novel Catalyst Scheme for Stochastic Minimax Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yan Li","submitted_at":"2023-11-06T01:19:27Z","abstract_excerpt":"This paper presents a proximal-point-based catalyst scheme for simple first-order methods applied to convex minimization and convex-concave minimax problems. In particular, for smooth and (strongly)-convex minimization problems, the proposed catalyst scheme, instantiated with a simple variant of stochastic gradient method, attains the optimal rate of convergence in terms of both deterministic and stochastic errors. For smooth and strongly-convex-strongly-concave minimax problems, the catalyst scheme attains the optimal rate of convergence for deterministic and stochastic errors up to a logarit"},"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":"2311.02814","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-06T01:19:27Z","cross_cats_sorted":[],"title_canon_sha256":"3f1d2ce1880271c936a7f0e28b1238a8b35b979ef1519283d4b653e771277b0b","abstract_canon_sha256":"5467583d31333db0b516d3c666169ed7d58b40fe511d47a54e97de3261ff6d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:30.784974Z","signature_b64":"T6fjuMxbaMJeN8NWvJz+gTlz+NYTZn5PWAPdQJIkQst27zcA/avn/C+JTBLJkK5qKYPjzWVeE1pa2HYdb8R6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f99c3ec024cda69e2dea7cff8235d461bbc018f26fcf0981867aac0e1cf75041","last_reissued_at":"2026-07-05T07:10:30.784491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:30.784491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Catalyst Scheme for Stochastic Minimax Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yan Li","submitted_at":"2023-11-06T01:19:27Z","abstract_excerpt":"This paper presents a proximal-point-based catalyst scheme for simple first-order methods applied to convex minimization and convex-concave minimax problems. In particular, for smooth and (strongly)-convex minimization problems, the proposed catalyst scheme, instantiated with a simple variant of stochastic gradient method, attains the optimal rate of convergence in terms of both deterministic and stochastic errors. For smooth and strongly-convex-strongly-concave minimax problems, the catalyst scheme attains the optimal rate of convergence for deterministic and stochastic errors up to a logarit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02814","kind":"arxiv","version":2},"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/2311.02814/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":"2311.02814","created_at":"2026-07-05T07:10:30.784545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.02814v2","created_at":"2026-07-05T07:10:30.784545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02814","created_at":"2026-07-05T07:10:30.784545+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GOD5QBEZWTJ","created_at":"2026-07-05T07:10:30.784545+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GOD5QBEZWTJ4LPK","created_at":"2026-07-05T07:10:30.784545+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GOD5QBE","created_at":"2026-07-05T07:10:30.784545+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28706","citing_title":"Robust Markov Decision Processes on Continuous State Spaces","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG","json":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG.json","graph_json":"https://pith.science/api/pith-number/7GOD5QBEZWTJ4LPKPT7YENOUMG/graph.json","events_json":"https://pith.science/api/pith-number/7GOD5QBEZWTJ4LPKPT7YENOUMG/events.json","paper":"https://pith.science/paper/7GOD5QBE"},"agent_actions":{"view_html":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG","download_json":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG.json","view_paper":"https://pith.science/paper/7GOD5QBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.02814&json=true","fetch_graph":"https://pith.science/api/pith-number/7GOD5QBEZWTJ4LPKPT7YENOUMG/graph.json","fetch_events":"https://pith.science/api/pith-number/7GOD5QBEZWTJ4LPKPT7YENOUMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG/action/storage_attestation","attest_author":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG/action/author_attestation","sign_citation":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG/action/citation_signature","submit_replication":"https://pith.science/pith/7GOD5QBEZWTJ4LPKPT7YENOUMG/action/replication_record"}},"created_at":"2026-07-05T07:10:30.784545+00:00","updated_at":"2026-07-05T07:10:30.784545+00:00"}