{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:23TD4JQ4HOMS77WPA7NFSAUX7K","short_pith_number":"pith:23TD4JQ4","canonical_record":{"source":{"id":"2105.15042","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-31T15:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"d8d2324ebf01d173848978a5fc19d544f5453b472c8f4e5dc913c8c9c9be65d7","abstract_canon_sha256":"084b5ee3bca575d26febffd0f35a2a43754aa5c3242e51c0c3e800a6801ab66a"},"schema_version":"1.0"},"canonical_sha256":"d6e63e261c3b992ffecf07da590297fa821c1dfb148ed2b592b827d8e2746c32","source":{"kind":"arxiv","id":"2105.15042","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.15042","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"2105.15042v3","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.15042","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"23TD4JQ4HOMS","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"23TD4JQ4HOMS77WP","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"23TD4JQ4","created_at":"2026-07-05T04:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:23TD4JQ4HOMS77WPA7NFSAUX7K","target":"record","payload":{"canonical_record":{"source":{"id":"2105.15042","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-31T15:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"d8d2324ebf01d173848978a5fc19d544f5453b472c8f4e5dc913c8c9c9be65d7","abstract_canon_sha256":"084b5ee3bca575d26febffd0f35a2a43754aa5c3242e51c0c3e800a6801ab66a"},"schema_version":"1.0"},"canonical_sha256":"d6e63e261c3b992ffecf07da590297fa821c1dfb148ed2b592b827d8e2746c32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:32.001812Z","signature_b64":"r0dRNpQK+ro4BmpVz03uMAwGFXRp2MmnHH8ccYTHkKn7KKrSELwSntRDd9IDiCh1yEwHjx6qhUmy1FEJxdJbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6e63e261c3b992ffecf07da590297fa821c1dfb148ed2b592b827d8e2746c32","last_reissued_at":"2026-07-05T04:30:32.001389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:32.001389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.15042","source_version":3,"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-07-05T04:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgegqKa/+Z4Hez3nbzSnqXJEuZfCSrCPcOfGEyaOGmigkWALc2Zelkbi3drsNrBnOubR/R70b3daA8rXoB2JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:59:22.613033Z"},"content_sha256":"1686d888a4a40d1eaa240147bdfea56700bd67a437d9027687af55fc0ccbe547","schema_version":"1.0","event_id":"sha256:1686d888a4a40d1eaa240147bdfea56700bd67a437d9027687af55fc0ccbe547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:23TD4JQ4HOMS77WPA7NFSAUX7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Sucheol Lee","submitted_at":"2021-05-31T15:28:04Z","abstract_excerpt":"Minimax problems, such as generative adversarial network, adversarial training, and fair training, are widely solved by a multi-step gradient descent ascent (MGDA) method in practice. However, its convergence guarantee is limited. In this paper, inspired by the primal-dual hybrid gradient method, we propose a new semi-anchoring (SA) technique for the MGDA method. This makes the MGDA method find a stationary point of a structured nonconvex-nonconcave composite minimax problem; its saddle-subdifferential operator satisfies the weak Minty variational inequality condition. The resulting method, na"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.15042","kind":"arxiv","version":3},"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/2105.15042/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBmAfZlGhqRhUnTGS6CDwrNC2tOudmrbjjgNI/ELEJjlbCWhW0wErHqzNrm/hH394VGTL3ClwTuVeoF/+54BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:59:22.613534Z"},"content_sha256":"6ec80045289489df6bcbefa02858a08d0c2568364d50a1c9762ff3420c52be27","schema_version":"1.0","event_id":"sha256:6ec80045289489df6bcbefa02858a08d0c2568364d50a1c9762ff3420c52be27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/bundle.json","state_url":"https://pith.science/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/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-08T12:59:22Z","links":{"resolver":"https://pith.science/pith/23TD4JQ4HOMS77WPA7NFSAUX7K","bundle":"https://pith.science/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/bundle.json","state":"https://pith.science/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23TD4JQ4HOMS77WPA7NFSAUX7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:23TD4JQ4HOMS77WPA7NFSAUX7K","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":"084b5ee3bca575d26febffd0f35a2a43754aa5c3242e51c0c3e800a6801ab66a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-31T15:28:04Z","title_canon_sha256":"d8d2324ebf01d173848978a5fc19d544f5453b472c8f4e5dc913c8c9c9be65d7"},"schema_version":"1.0","source":{"id":"2105.15042","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.15042","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"2105.15042v3","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.15042","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"23TD4JQ4HOMS","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"23TD4JQ4HOMS77WP","created_at":"2026-07-05T04:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"23TD4JQ4","created_at":"2026-07-05T04:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:6ec80045289489df6bcbefa02858a08d0c2568364d50a1c9762ff3420c52be27","target":"graph","created_at":"2026-07-05T04:30:32Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.15042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimax problems, such as generative adversarial network, adversarial training, and fair training, are widely solved by a multi-step gradient descent ascent (MGDA) method in practice. However, its convergence guarantee is limited. In this paper, inspired by the primal-dual hybrid gradient method, we propose a new semi-anchoring (SA) technique for the MGDA method. This makes the MGDA method find a stationary point of a structured nonconvex-nonconcave composite minimax problem; its saddle-subdifferential operator satisfies the weak Minty variational inequality condition. The resulting method, na","authors_text":"Donghwan Kim, Sucheol Lee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-31T15:28:04Z","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.15042","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1686d888a4a40d1eaa240147bdfea56700bd67a437d9027687af55fc0ccbe547","target":"record","created_at":"2026-07-05T04:30:32Z","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":"084b5ee3bca575d26febffd0f35a2a43754aa5c3242e51c0c3e800a6801ab66a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-31T15:28:04Z","title_canon_sha256":"d8d2324ebf01d173848978a5fc19d544f5453b472c8f4e5dc913c8c9c9be65d7"},"schema_version":"1.0","source":{"id":"2105.15042","kind":"arxiv","version":3}},"canonical_sha256":"d6e63e261c3b992ffecf07da590297fa821c1dfb148ed2b592b827d8e2746c32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6e63e261c3b992ffecf07da590297fa821c1dfb148ed2b592b827d8e2746c32","first_computed_at":"2026-07-05T04:30:32.001389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:30:32.001389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r0dRNpQK+ro4BmpVz03uMAwGFXRp2MmnHH8ccYTHkKn7KKrSELwSntRDd9IDiCh1yEwHjx6qhUmy1FEJxdJbBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:30:32.001812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.15042","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1686d888a4a40d1eaa240147bdfea56700bd67a437d9027687af55fc0ccbe547","sha256:6ec80045289489df6bcbefa02858a08d0c2568364d50a1c9762ff3420c52be27"],"state_sha256":"676891ecf2c82d7b5a4ee8ae7d6908dfbca4a28dceaad4d14a475121ef1d0e91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVqvSg0Yh48Is6XBf0HeX31Ib03/qpn+Q61Z0I1AAqHufvciVi95F6Cj7SJnnU0o49FJiphG4fFKkjZV9bcNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:59:22.618647Z","bundle_sha256":"dfa5fa0e501b0bae6e4aea2c39e90339881d770a1116c50ecb4a09005d1d2a36"}}