{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VWDCVLN7HKX7JQK3QAN2SOR42P","short_pith_number":"pith:VWDCVLN7","canonical_record":{"source":{"id":"1812.02878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-07T02:18:49Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"465418b44acbec41c84ad015c175b25e29096d0c7cd73d14bb0c138981e8d2b8","abstract_canon_sha256":"698407ead3a9b4bc0e19a9d121c0aa137ac0805a9affeba94d847e36ea85ae1e"},"schema_version":"1.0"},"canonical_sha256":"ad862aadbf3aaff4c15b801ba93a3cd3c1a0144ac54bdeaf03d66bcf9fc348eb","source":{"kind":"arxiv","id":"1812.02878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02878","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02878v1","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02878","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"VWDCVLN7HKX7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VWDCVLN7HKX7JQK3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VWDCVLN7","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VWDCVLN7HKX7JQK3QAN2SOR42P","target":"record","payload":{"canonical_record":{"source":{"id":"1812.02878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-07T02:18:49Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"465418b44acbec41c84ad015c175b25e29096d0c7cd73d14bb0c138981e8d2b8","abstract_canon_sha256":"698407ead3a9b4bc0e19a9d121c0aa137ac0805a9affeba94d847e36ea85ae1e"},"schema_version":"1.0"},"canonical_sha256":"ad862aadbf3aaff4c15b801ba93a3cd3c1a0144ac54bdeaf03d66bcf9fc348eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:47.018232Z","signature_b64":"7RoQqokkXu8Njss0jjpyORUOKBy6JKL0dbmDt9ErgHpYPyTCeX06vhkbCr+YE4IP2ZWhpJYokjUurzDDPkV9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad862aadbf3aaff4c15b801ba93a3cd3c1a0144ac54bdeaf03d66bcf9fc348eb","last_reissued_at":"2026-05-17T23:58:47.017797Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:47.017797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.02878","source_version":1,"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-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/mSs7uZkCmZuMB7DudZoLZx+yctk9DdZoDn+Q+t3SDwmORs0jo2N8ssSelv3x0izRwmEvTq/2dBw+NwmdEhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:19.332523Z"},"content_sha256":"48d29d760ed0fec67eecaf2305c6478b47fbf485c73da468599852ef9d6e76db","schema_version":"1.0","event_id":"sha256:48d29d760ed0fec67eecaf2305c6478b47fbf485c73da468599852ef9d6e76db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VWDCVLN7HKX7JQK3QAN2SOR42P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Non-Convex Non-Concave Min-Max Games Under Polyak-{\\L}ojasiewicz Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"math.OC","authors_text":"Jason D. Lee, Maziar Sanjabi, Meisam Razaviyayn","submitted_at":"2018-12-07T02:18:49Z","abstract_excerpt":"In this short note, we consider the problem of solving a min-max zero-sum game. This problem has been extensively studied in the convex-concave regime where the global solution can be computed efficiently. Recently, there have also been developments for finding the first order stationary points of the game when one of the player's objective is concave or (weakly) concave. This work focuses on the non-convex non-concave regime where the objective of one of the players satisfies Polyak-{\\L}ojasiewicz (PL) Condition. For such a game, we show that a simple multi-step gradient descent-ascent algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02878","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxSia9CM3ScdXVzD1pE+t6ngEQ1s3BKZAW3Z8vQ6p8gBRDyVlTYpuqPi8uKUs8drPUaFmwrBQvI57QmmrmGxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:19.333246Z"},"content_sha256":"a03251610535620be5ee433b0d9cf877fc50b3ab46cda8618b9c2b88572984b8","schema_version":"1.0","event_id":"sha256:a03251610535620be5ee433b0d9cf877fc50b3ab46cda8618b9c2b88572984b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/bundle.json","state_url":"https://pith.science/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/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-05-29T21:13:19Z","links":{"resolver":"https://pith.science/pith/VWDCVLN7HKX7JQK3QAN2SOR42P","bundle":"https://pith.science/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/bundle.json","state":"https://pith.science/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWDCVLN7HKX7JQK3QAN2SOR42P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VWDCVLN7HKX7JQK3QAN2SOR42P","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":"698407ead3a9b4bc0e19a9d121c0aa137ac0805a9affeba94d847e36ea85ae1e","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-07T02:18:49Z","title_canon_sha256":"465418b44acbec41c84ad015c175b25e29096d0c7cd73d14bb0c138981e8d2b8"},"schema_version":"1.0","source":{"id":"1812.02878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02878","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02878v1","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02878","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"VWDCVLN7HKX7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VWDCVLN7HKX7JQK3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VWDCVLN7","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a03251610535620be5ee433b0d9cf877fc50b3ab46cda8618b9c2b88572984b8","target":"graph","created_at":"2026-05-17T23:58:47Z","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"},"paper":{"abstract_excerpt":"In this short note, we consider the problem of solving a min-max zero-sum game. This problem has been extensively studied in the convex-concave regime where the global solution can be computed efficiently. Recently, there have also been developments for finding the first order stationary points of the game when one of the player's objective is concave or (weakly) concave. This work focuses on the non-convex non-concave regime where the objective of one of the players satisfies Polyak-{\\L}ojasiewicz (PL) Condition. For such a game, we show that a simple multi-step gradient descent-ascent algori","authors_text":"Jason D. Lee, Maziar Sanjabi, Meisam Razaviyayn","cross_cats":["cs.GT","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-07T02:18:49Z","title":"Solving Non-Convex Non-Concave Min-Max Games Under Polyak-{\\L}ojasiewicz Condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02878","kind":"arxiv","version":1},"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:48d29d760ed0fec67eecaf2305c6478b47fbf485c73da468599852ef9d6e76db","target":"record","created_at":"2026-05-17T23:58:47Z","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":"698407ead3a9b4bc0e19a9d121c0aa137ac0805a9affeba94d847e36ea85ae1e","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-07T02:18:49Z","title_canon_sha256":"465418b44acbec41c84ad015c175b25e29096d0c7cd73d14bb0c138981e8d2b8"},"schema_version":"1.0","source":{"id":"1812.02878","kind":"arxiv","version":1}},"canonical_sha256":"ad862aadbf3aaff4c15b801ba93a3cd3c1a0144ac54bdeaf03d66bcf9fc348eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad862aadbf3aaff4c15b801ba93a3cd3c1a0144ac54bdeaf03d66bcf9fc348eb","first_computed_at":"2026-05-17T23:58:47.017797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:47.017797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RoQqokkXu8Njss0jjpyORUOKBy6JKL0dbmDt9ErgHpYPyTCeX06vhkbCr+YE4IP2ZWhpJYokjUurzDDPkV9AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:47.018232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48d29d760ed0fec67eecaf2305c6478b47fbf485c73da468599852ef9d6e76db","sha256:a03251610535620be5ee433b0d9cf877fc50b3ab46cda8618b9c2b88572984b8"],"state_sha256":"94e921b3d8ddae3ed87c3e77b4ebe783f9f3d23172dd920f25536f2d98a4e891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrclKu88jwsRQKhsXbo4DkBiIEusZrcDWPTRpHGbijmIJ3So5gsHy1F6aciKbMfNLvn31qUMllz/HhvmEtG1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:13:19.336996Z","bundle_sha256":"bde7f4f6158e72dd71bed6fbca8aa8e2967e2034622d00b25a7c08440437022f"}}