{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6S4RW55B5YXNRQZUCML4XRYCP3","short_pith_number":"pith:6S4RW55B","schema_version":"1.0","canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","source":{"kind":"arxiv","id":"2605.01246","version":2},"attestation_state":"computed","paper":{"title":"A Single-Loop Penalty-based Algorithm for Stochastic Minimax Optimization with Nonlinear Coupled Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jin Zhang, Qichao Cao, Shangzhi Zeng, Yuxuan Zhou","submitted_at":"2026-05-02T04:57:02Z","abstract_excerpt":"We study stochastic nonconvex-concave minimax optimization with nonlinear\n  coupled constraints that are convex in the maximization variable. To address the nonsmoothness arising from such constraints, we develop a\n  penalty-based smooth approximation that combines quadratic penalization of the\n  coupled constraints with quadratic regularization of the inner maximization\n  problem. Based on this approximation, we propose SPACO, a single-loop\n  stochastic gradient algorithm that tracks the inner maximizer by one stochastic\n  ascent step, updates the outer variable using an inexact stochastic de"},"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":"2605.01246","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-02T04:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"a5d153bdbe82aa7e975418aeb0621d08d90f6438be4f0b8b4fc4c0b2c43000ee","abstract_canon_sha256":"e29ad2a0206a5bed6f1c315bd9ba7a47aa41e6ce1917ac35fa09f7071013a7b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:06.373124Z","signature_b64":"doq9XeZy1zxnYbS2toC8cr3Fzj/z6FggGoEpeYcNZDJ9+cEL1k50zf3pRROWrZ7GmIJA57bTqRpcW7fwBh6YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","last_reissued_at":"2026-06-08T01:04:06.372102Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:06.372102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Single-Loop Penalty-based Algorithm for Stochastic Minimax Optimization with Nonlinear Coupled Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jin Zhang, Qichao Cao, Shangzhi Zeng, Yuxuan Zhou","submitted_at":"2026-05-02T04:57:02Z","abstract_excerpt":"We study stochastic nonconvex-concave minimax optimization with nonlinear\n  coupled constraints that are convex in the maximization variable. To address the nonsmoothness arising from such constraints, we develop a\n  penalty-based smooth approximation that combines quadratic penalization of the\n  coupled constraints with quadratic regularization of the inner maximization\n  problem. Based on this approximation, we propose SPACO, a single-loop\n  stochastic gradient algorithm that tracks the inner maximizer by one stochastic\n  ascent step, updates the outer variable using an inexact stochastic de"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose SPACO, a single-loop stochastic gradient algorithm built upon a penalty-based smooth approximation framework for MCC, and establish non-asymptotic complexity bounds and asymptotic stationarity of accumulation points.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The quadratic penalty scheme with regularization produces a continuously differentiable approximation of the MCC problem while preserving enough structure for the nonconvex-concave convergence analysis to apply.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SPACO is a new single-loop stochastic algorithm for stochastic nonconvex-concave minimax problems with nonlinear convex coupled constraints that uses penalty smoothing and provides non-asymptotic complexity bounds plus stationarity analysis.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5584af85e6039aab6da66c04b9114e2bd9a9fac0e3d9a67b8be6ee68957c8937"},"source":{"id":"2605.01246","kind":"arxiv","version":2},"verdict":{"id":"61fbf3ab-1717-4f1c-9bf9-bb768a3c1d31","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T15:11:42.760267Z","strongest_claim":"We propose SPACO, a single-loop stochastic gradient algorithm built upon a penalty-based smooth approximation framework for MCC, and establish non-asymptotic complexity bounds and asymptotic stationarity of accumulation points.","one_line_summary":"SPACO is a new single-loop stochastic algorithm for stochastic nonconvex-concave minimax problems with nonlinear convex coupled constraints that uses penalty smoothing and provides non-asymptotic complexity bounds plus stationarity analysis.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The quadratic penalty scheme with regularization produces a continuously differentiable approximation of the MCC problem while preserving enough structure for the nonconvex-concave convergence analysis to apply.","pith_extraction_headline":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01246/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T18:36:14.033711Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:28:38.273238Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"328b434faf9dff3884c6319f70d7aea4fbaf12b2304868c14e09e484fb51f610"},"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":"2605.01246","created_at":"2026-06-08T01:04:06.372238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.01246v2","created_at":"2026-06-08T01:04:06.372238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01246","created_at":"2026-06-08T01:04:06.372238+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S4RW55B5YXN","created_at":"2026-06-08T01:04:06.372238+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S4RW55B5YXNRQZU","created_at":"2026-06-08T01:04:06.372238+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S4RW55B","created_at":"2026-06-08T01:04:06.372238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3","json":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3.json","graph_json":"https://pith.science/api/pith-number/6S4RW55B5YXNRQZUCML4XRYCP3/graph.json","events_json":"https://pith.science/api/pith-number/6S4RW55B5YXNRQZUCML4XRYCP3/events.json","paper":"https://pith.science/paper/6S4RW55B"},"agent_actions":{"view_html":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3","download_json":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3.json","view_paper":"https://pith.science/paper/6S4RW55B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.01246&json=true","fetch_graph":"https://pith.science/api/pith-number/6S4RW55B5YXNRQZUCML4XRYCP3/graph.json","fetch_events":"https://pith.science/api/pith-number/6S4RW55B5YXNRQZUCML4XRYCP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/action/storage_attestation","attest_author":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/action/author_attestation","sign_citation":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/action/citation_signature","submit_replication":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/action/replication_record"}},"created_at":"2026-06-08T01:04:06.372238+00:00","updated_at":"2026-06-08T01:04:06.372238+00:00"}