{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6S4RW55B5YXNRQZUCML4XRYCP3","short_pith_number":"pith:6S4RW55B","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"},"canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","source":{"kind":"arxiv","id":"2605.01246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01246","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01246v2","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01246","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"6S4RW55B5YXN","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"6S4RW55B5YXNRQZU","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"6S4RW55B","created_at":"2026-06-08T01:04:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6S4RW55B5YXNRQZUCML4XRYCP3","target":"record","payload":{"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"},"canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","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"},"source_kind":"arxiv","source_id":"2605.01246","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/CgmxpQRTFPJLayYAdU1q/w2GVFQbT/6kd5OPUtocVdF+9gdxbUs6Nkl5Ku/5Hv18FxVwfxpxWqKy4nCgXEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:58:28.485211Z"},"content_sha256":"d0fe4542964c7dfd9f3bc19ee5a382eb7c66c7a97ac0c7a50d61e603d3f0b20e","schema_version":"1.0","event_id":"sha256:d0fe4542964c7dfd9f3bc19ee5a382eb7c66c7a97ac0c7a50d61e603d3f0b20e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6S4RW55B5YXNRQZUCML4XRYCP3","target":"graph","payload":{"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"},"verdict_id":"61fbf3ab-1717-4f1c-9bf9-bb768a3c1d31"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VQ527uh20MHhJkOVatOCP5IdDo6GIU9hTIbX++ZSIhZ8LicCYUZxH4rx+i9YX/HjlxKarZCx+c9xchAJ8pdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:58:28.485862Z"},"content_sha256":"09e5078c26fed443c6ff48d3093043eef83d034a2047d64486abc410389dbfcc","schema_version":"1.0","event_id":"sha256:09e5078c26fed443c6ff48d3093043eef83d034a2047d64486abc410389dbfcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/bundle.json","state_url":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6S4RW55B5YXNRQZUCML4XRYCP3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T12:58:28Z","links":{"resolver":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3","bundle":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/bundle.json","state":"https://pith.science/pith/6S4RW55B5YXNRQZUCML4XRYCP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6S4RW55B5YXNRQZUCML4XRYCP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6S4RW55B5YXNRQZUCML4XRYCP3","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":"e29ad2a0206a5bed6f1c315bd9ba7a47aa41e6ce1917ac35fa09f7071013a7b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-02T04:57:02Z","title_canon_sha256":"a5d153bdbe82aa7e975418aeb0621d08d90f6438be4f0b8b4fc4c0b2c43000ee"},"schema_version":"1.0","source":{"id":"2605.01246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01246","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01246v2","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01246","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"6S4RW55B5YXN","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_16","alias_value":"6S4RW55B5YXNRQZU","created_at":"2026-06-08T01:04:06Z"},{"alias_kind":"pith_short_8","alias_value":"6S4RW55B","created_at":"2026-06-08T01:04:06Z"}],"graph_snapshots":[{"event_id":"sha256:09e5078c26fed443c6ff48d3093043eef83d034a2047d64486abc410389dbfcc","target":"graph","created_at":"2026-06-08T01:04:06Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing."}],"snapshot_sha256":"5584af85e6039aab6da66c04b9114e2bd9a9fac0e3d9a67b8be6ee68957c8937"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.01246/integrity.json","findings":[],"snapshot_sha256":"328b434faf9dff3884c6319f70d7aea4fbaf12b2304868c14e09e484fb51f610","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jin Zhang, Qichao Cao, Shangzhi Zeng, Yuxuan Zhou","cross_cats":[],"headline":"SPACO is a single-loop stochastic gradient algorithm that solves nonconvex-concave minimax problems with nonlinear convex coupled constraints via penalty-based smoothing.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-02T04:57:02Z","title":"A Single-Loop Penalty-based Algorithm for Stochastic Minimax Optimization with Nonlinear Coupled Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01246","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T15:11:42.760267Z","id":"61fbf3ab-1717-4f1c-9bf9-bb768a3c1d31","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"61fbf3ab-1717-4f1c-9bf9-bb768a3c1d31"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d0fe4542964c7dfd9f3bc19ee5a382eb7c66c7a97ac0c7a50d61e603d3f0b20e","target":"record","created_at":"2026-06-08T01:04:06Z","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":"e29ad2a0206a5bed6f1c315bd9ba7a47aa41e6ce1917ac35fa09f7071013a7b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-02T04:57:02Z","title_canon_sha256":"a5d153bdbe82aa7e975418aeb0621d08d90f6438be4f0b8b4fc4c0b2c43000ee"},"schema_version":"1.0","source":{"id":"2605.01246","kind":"arxiv","version":2}},"canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4b91b77a1ee2ed8c3341317cbc7027ec359fcd54fd44fba11a1d9f1f5c181e9","first_computed_at":"2026-06-08T01:04:06.372102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:06.372102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"doq9XeZy1zxnYbS2toC8cr3Fzj/z6FggGoEpeYcNZDJ9+cEL1k50zf3pRROWrZ7GmIJA57bTqRpcW7fwBh6YCw==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:06.373124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0fe4542964c7dfd9f3bc19ee5a382eb7c66c7a97ac0c7a50d61e603d3f0b20e","sha256:09e5078c26fed443c6ff48d3093043eef83d034a2047d64486abc410389dbfcc"],"state_sha256":"c478461ef9aa47c1d1aadd1051bc8082023e6cf6241f1431453e2f85daec2234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ac9Nz9D5C9zRJ1iN0mX6rdu1yP69CuSt14xsFGHT4914cFeBRtGv/zdTLDfRB8lP7RgRZmzoxnl8XcpQjD91DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:58:28.490668Z","bundle_sha256":"bb23627192768cab1d4acb617671aee58ca6e6b1d4cefc2eec640d165e6ac695"}}