{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3XULHAMED7DXR53QKACTU4A6JF","short_pith_number":"pith:3XULHAME","canonical_record":{"source":{"id":"2511.15606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b10dcbdd3f43f186243d07d5fe0db04a01fe9e5bb2a88dbce35e847846a39a24","abstract_canon_sha256":"a826d1f49940b00c68106b9ab83ec1c3c310a2447357b54f7640366ee1201b05"},"schema_version":"1.0"},"canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","source":{"kind":"arxiv","id":"2511.15606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.15606","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"2511.15606v2","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15606","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"3XULHAMED7DX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3XULHAMED7DXR53Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3XULHAME","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3XULHAMED7DXR53QKACTU4A6JF","target":"record","payload":{"canonical_record":{"source":{"id":"2511.15606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b10dcbdd3f43f186243d07d5fe0db04a01fe9e5bb2a88dbce35e847846a39a24","abstract_canon_sha256":"a826d1f49940b00c68106b9ab83ec1c3c310a2447357b54f7640366ee1201b05"},"schema_version":"1.0"},"canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:33.196664Z","signature_b64":"ZUfi7fwviHD1a+OFwbiNN7NkF8kmyoGyjJ+y52FZP/yv4AnAbMxeJnoyyCaw/Aw6a2S6WX5l2CFER1arfPfBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","last_reissued_at":"2026-05-18T03:09:33.196177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:33.196177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.15606","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-05-18T03:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zh7vbJCbe0nLmajPlzrNq9eWMa5xgCsf8fA5Zoy+9WMRG/Dot+3fUtQh8GKyzPPzL3CJiAygNYUpKdmenVdODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:59:51.614135Z"},"content_sha256":"f072ca1211e78ff1af76dcb4889172857e485ca27278c58f6969bf4a153ec780","schema_version":"1.0","event_id":"sha256:f072ca1211e78ff1af76dcb4889172857e485ca27278c58f6969bf4a153ec780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3XULHAMED7DXR53QKACTU4A6JF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Guanpu Chen, Huan Peng, Karl Henrik Johansson","submitted_at":"2025-11-19T16:53:29Z","abstract_excerpt":"This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspired by recent advances in scenario optimization, we first establish a probabilistic robustness guarantee for an $\\varepsilon$-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios. Furthermore, in the presence of nonconvex strategy sets, we reveal the fundamental difficulty of obtaining a tight theoretical bound b"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d787e7d4483c1dd6471b96f8441b617caaa5ea23829c7a8ef525ff2574c1a1cc"},"source":{"id":"2511.15606","kind":"arxiv","version":2},"verdict":{"id":"1009824b-670d-4ac9-b50c-341107243b4e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T20:28:17.304341Z","strongest_claim":"we first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios.","one_line_summary":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature.","pith_extraction_headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual."},"references":{"count":3,"sample":[{"doi":"10.1109/tac.2025.3634219","year":2006,"title":"Aliprantis, C.D. and Border, K.C. (2006). Infinite Dimen- sional Analysis: A Hitchhiker’s Guide . Springer, 3rd edition. Assif, M., Chatterjee, D., and Banavar, R. (2020). Scenario approach for minmax ","work_id":"4e854a4c-0b6c-4c6f-b85c-7646230c3b01","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014). Generative adversarial nets. In Advances in Neural Information Processing Syste","work_id":"16e6f931-9cfe-4f8d-9896-d7eeb9e03a6f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Yang, J., Orvieto, A., Lucchi, A., and He, N. (2022). Faster single-loop algorithms for minimax optimization without strong concavity. In International Conference on Artificial Intelligence and Statist","work_id":"6612e46e-d64f-4d3b-9c78-271bb2a2bcfa","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":3,"snapshot_sha256":"b18315085263a7885b146acd8e1c5a3094a3c846fffeff9b34d565e5f7b1ca51","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":"1009824b-670d-4ac9-b50c-341107243b4e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w23xdKZDMa2pdqxx9rn8H642KsqoSLeSFKzljJz8SNNfsWqju/s3v4Y0+EjTcc7bWobDn1Z2ljvXuzivmkIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:59:51.614712Z"},"content_sha256":"2b34aa18bfd89a4a6c0b6e9b21bfd8fc74a490748b22679ded412d7d0530e4bd","schema_version":"1.0","event_id":"sha256:2b34aa18bfd89a4a6c0b6e9b21bfd8fc74a490748b22679ded412d7d0530e4bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/bundle.json","state_url":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XULHAMED7DXR53QKACTU4A6JF/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-06-08T14:59:51Z","links":{"resolver":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF","bundle":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/bundle.json","state":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XULHAMED7DXR53QKACTU4A6JF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3XULHAMED7DXR53QKACTU4A6JF","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":"a826d1f49940b00c68106b9ab83ec1c3c310a2447357b54f7640366ee1201b05","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","title_canon_sha256":"b10dcbdd3f43f186243d07d5fe0db04a01fe9e5bb2a88dbce35e847846a39a24"},"schema_version":"1.0","source":{"id":"2511.15606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.15606","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"2511.15606v2","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15606","created_at":"2026-05-18T03:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"3XULHAMED7DX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3XULHAMED7DXR53Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3XULHAME","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b34aa18bfd89a4a6c0b6e9b21bfd8fc74a490748b22679ded412d7d0530e4bd","target":"graph","created_at":"2026-05-18T03:09:33Z","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 first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual."}],"snapshot_sha256":"d787e7d4483c1dd6471b96f8441b617caaa5ea23829c7a8ef525ff2574c1a1cc"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspired by recent advances in scenario optimization, we first establish a probabilistic robustness guarantee for an $\\varepsilon$-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios. Furthermore, in the presence of nonconvex strategy sets, we reveal the fundamental difficulty of obtaining a tight theoretical bound b","authors_text":"Guanpu Chen, Huan Peng, Karl Henrik Johansson","cross_cats":["math.OC"],"headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","title":"A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems"},"references":{"count":3,"internal_anchors":0,"resolved_work":3,"sample":[{"cited_arxiv_id":"","doi":"10.1109/tac.2025.3634219","is_internal_anchor":false,"ref_index":1,"title":"Aliprantis, C.D. and Border, K.C. (2006). Infinite Dimen- sional Analysis: A Hitchhiker’s Guide . Springer, 3rd edition. Assif, M., Chatterjee, D., and Banavar, R. (2020). Scenario approach for minmax ","work_id":"4e854a4c-0b6c-4c6f-b85c-7646230c3b01","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014). Generative adversarial nets. In Advances in Neural Information Processing Syste","work_id":"16e6f931-9cfe-4f8d-9896-d7eeb9e03a6f","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Yang, J., Orvieto, A., Lucchi, A., and He, N. (2022). Faster single-loop algorithms for minimax optimization without strong concavity. In International Conference on Artificial Intelligence and Statist","work_id":"6612e46e-d64f-4d3b-9c78-271bb2a2bcfa","year":2022}],"snapshot_sha256":"b18315085263a7885b146acd8e1c5a3094a3c846fffeff9b34d565e5f7b1ca51"},"source":{"id":"2511.15606","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T20:28:17.304341Z","id":"1009824b-670d-4ac9-b50c-341107243b4e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","strongest_claim":"we first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios.","weakest_assumption":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature."}},"verdict_id":"1009824b-670d-4ac9-b50c-341107243b4e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f072ca1211e78ff1af76dcb4889172857e485ca27278c58f6969bf4a153ec780","target":"record","created_at":"2026-05-18T03:09:33Z","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":"a826d1f49940b00c68106b9ab83ec1c3c310a2447357b54f7640366ee1201b05","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","title_canon_sha256":"b10dcbdd3f43f186243d07d5fe0db04a01fe9e5bb2a88dbce35e847846a39a24"},"schema_version":"1.0","source":{"id":"2511.15606","kind":"arxiv","version":2}},"canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","first_computed_at":"2026-05-18T03:09:33.196177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:33.196177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZUfi7fwviHD1a+OFwbiNN7NkF8kmyoGyjJ+y52FZP/yv4AnAbMxeJnoyyCaw/Aw6a2S6WX5l2CFER1arfPfBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:33.196664Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.15606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f072ca1211e78ff1af76dcb4889172857e485ca27278c58f6969bf4a153ec780","sha256:2b34aa18bfd89a4a6c0b6e9b21bfd8fc74a490748b22679ded412d7d0530e4bd"],"state_sha256":"d5959672106c5e0138839e728c1fee5827ff4f1fa9c504aa1af9982b56b6ea40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wU4e+764UBBTRsgvUrfQOB3t1ZN4hR0Fqx3xp8n2u+NZLGq1DzqxO8lJRylj093cMau3MDhBaYXfX1a2wA90Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:59:51.617132Z","bundle_sha256":"f435206b38ab941fea73ed9331aebb85ff0eb0f8e1d2341474650d7a6ff99f86"}}