{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TPSW3FLPAVGFWRHZPYGACYKREF","short_pith_number":"pith:TPSW3FLP","canonical_record":{"source":{"id":"2402.10475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e2635c20343d4f6cc665b1051aa3f2d00d40d1f14fa0dbaa8f70307a17324f78","abstract_canon_sha256":"9b4a47ee9490fd5d48979d7a20652cb55b6d2ebe8a9dfe22e401f40d49a02d4b"},"schema_version":"1.0"},"canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","source":{"kind":"arxiv","id":"2402.10475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.10475","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"2402.10475v2","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10475","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"TPSW3FLPAVGF","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_16","alias_value":"TPSW3FLPAVGFWRHZ","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_8","alias_value":"TPSW3FLP","created_at":"2026-07-05T08:43:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TPSW3FLPAVGFWRHZPYGACYKREF","target":"record","payload":{"canonical_record":{"source":{"id":"2402.10475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e2635c20343d4f6cc665b1051aa3f2d00d40d1f14fa0dbaa8f70307a17324f78","abstract_canon_sha256":"9b4a47ee9490fd5d48979d7a20652cb55b6d2ebe8a9dfe22e401f40d49a02d4b"},"schema_version":"1.0"},"canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:53.260331Z","signature_b64":"nwr4AsysUEm+z8zGw/gk9MLiZb6CaTq6fzgpm2ZpIXJGxPdGfHTK9NaYj3RJ797EG+Dgwo3N9LVrB7KN3CsdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","last_reissued_at":"2026-07-05T08:43:53.259893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:53.259893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.10475","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-07-05T08:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ9VRg4TKvAvfpuOM41hn4C9FeUb+KBVnWVSBfdDNWTFpjIgEErTV8GG7xslI25v2hbyQVa5rrht//2ZX7W1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:13:50.406419Z"},"content_sha256":"bbd70765400367bda2615ab0b83262639a60471e45176c8f7ca0213a31b9f82c","schema_version":"1.0","event_id":"sha256:bbd70765400367bda2615ab0b83262639a60471e45176c8f7ca0213a31b9f82c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TPSW3FLPAVGFWRHZPYGACYKREF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Benefit of Alternating Updates in Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chulhee Yun, Hanseul Cho, Jaewook Lee","submitted_at":"2024-02-16T06:41:35Z","abstract_excerpt":"The Gradient Descent-Ascent (GDA) algorithm, designed to solve minimax optimization problems, takes the descent and ascent steps either simultaneously (Sim-GDA) or alternately (Alt-GDA). While Alt-GDA is commonly observed to converge faster, the performance gap between the two is not yet well understood theoretically, especially in terms of global convergence rates. To address this theory-practice gap, we present fine-grained convergence analyses of both algorithms for strongly-convex-strongly-concave and Lipschitz-gradient objectives. Our new iteration complexity upper bound of Alt-GDA is str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10475","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/2402.10475/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-05T08:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avBaO8EGfQ9WpwQVbGtKxbB03/D9gykioSChNmhRbI3p4U+sYAPuCev57nuPnmVECLv3hY1Sg/2V2L9/apvsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:13:50.406996Z"},"content_sha256":"0d0eed3f4f5225f928274229b88360d40da07c45d359201a36290cd34b2f44b2","schema_version":"1.0","event_id":"sha256:0d0eed3f4f5225f928274229b88360d40da07c45d359201a36290cd34b2f44b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/bundle.json","state_url":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPSW3FLPAVGFWRHZPYGACYKREF/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-08T07:13:50Z","links":{"resolver":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF","bundle":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/bundle.json","state":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPSW3FLPAVGFWRHZPYGACYKREF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TPSW3FLPAVGFWRHZPYGACYKREF","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":"9b4a47ee9490fd5d48979d7a20652cb55b6d2ebe8a9dfe22e401f40d49a02d4b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","title_canon_sha256":"e2635c20343d4f6cc665b1051aa3f2d00d40d1f14fa0dbaa8f70307a17324f78"},"schema_version":"1.0","source":{"id":"2402.10475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.10475","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"2402.10475v2","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10475","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"TPSW3FLPAVGF","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_16","alias_value":"TPSW3FLPAVGFWRHZ","created_at":"2026-07-05T08:43:53Z"},{"alias_kind":"pith_short_8","alias_value":"TPSW3FLP","created_at":"2026-07-05T08:43:53Z"}],"graph_snapshots":[{"event_id":"sha256:0d0eed3f4f5225f928274229b88360d40da07c45d359201a36290cd34b2f44b2","target":"graph","created_at":"2026-07-05T08:43:53Z","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/2402.10475/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Gradient Descent-Ascent (GDA) algorithm, designed to solve minimax optimization problems, takes the descent and ascent steps either simultaneously (Sim-GDA) or alternately (Alt-GDA). While Alt-GDA is commonly observed to converge faster, the performance gap between the two is not yet well understood theoretically, especially in terms of global convergence rates. To address this theory-practice gap, we present fine-grained convergence analyses of both algorithms for strongly-convex-strongly-concave and Lipschitz-gradient objectives. Our new iteration complexity upper bound of Alt-GDA is str","authors_text":"Chulhee Yun, Hanseul Cho, Jaewook Lee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","title":"Fundamental Benefit of Alternating Updates in Minimax Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10475","kind":"arxiv","version":2},"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:bbd70765400367bda2615ab0b83262639a60471e45176c8f7ca0213a31b9f82c","target":"record","created_at":"2026-07-05T08:43:53Z","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":"9b4a47ee9490fd5d48979d7a20652cb55b6d2ebe8a9dfe22e401f40d49a02d4b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","title_canon_sha256":"e2635c20343d4f6cc665b1051aa3f2d00d40d1f14fa0dbaa8f70307a17324f78"},"schema_version":"1.0","source":{"id":"2402.10475","kind":"arxiv","version":2}},"canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","first_computed_at":"2026-07-05T08:43:53.259893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:43:53.259893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nwr4AsysUEm+z8zGw/gk9MLiZb6CaTq6fzgpm2ZpIXJGxPdGfHTK9NaYj3RJ797EG+Dgwo3N9LVrB7KN3CsdAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:43:53.260331Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.10475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbd70765400367bda2615ab0b83262639a60471e45176c8f7ca0213a31b9f82c","sha256:0d0eed3f4f5225f928274229b88360d40da07c45d359201a36290cd34b2f44b2"],"state_sha256":"166496d7f3eb9def0d583e6c1330fc4be87be576a79bce5deb2710b46a7c0707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtCevVnjhEmSzfjdQi6DKUxycYqKe+bLrSulBEP3/RBYCpLj6yCqOzkHQJK/HYIjq8gzwj9PaD6iVUE+DMgsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:13:50.413498Z","bundle_sha256":"5470d633863fe83584047620b904c20545ca90e6e9dcf5cdb50174b9c5021396"}}