{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IDJW5AYRGOMRZ3XG4IZKHBQKQS","short_pith_number":"pith:IDJW5AYR","schema_version":"1.0","canonical_sha256":"40d36e831133991ceee6e232a3860a84b68883d60e2ba44d55858ea2202273ae","source":{"kind":"arxiv","id":"2211.01280","version":4},"attestation_state":"computed","paper":{"title":"An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"math.OC","authors_text":"Guillaume Wang, L\\'ena\\\"ic Chizat","submitted_at":"2022-11-02T17:03:40Z","abstract_excerpt":"We consider the problem of computing mixed Nash equilibria of two-player zero-sum games with continuous sets of pure strategies and with first-order access to the payoff function. This problem arises for example in game-theory-inspired machine learning applications, such as distributionally-robust learning. In those applications, the strategy sets are high-dimensional and thus methods based on discretisation cannot tractably return high-accuracy solutions.\n  In this paper, we introduce and analyze a particle-based method that enjoys guaranteed local convergence for this problem. This method co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.01280","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-02T17:03:40Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"0e5fdea9b92dc69d64080ac69119336fdeab3388657619f7353cee9e2ab9d5c6","abstract_canon_sha256":"96970316c6e69e6d68a499d76c49ec49c7be0c19b595919f2b261f2477138ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:41.414583Z","signature_b64":"uYGG6jLgPVBxk61R/pP7Jyl9JOEP2nyWIV/frGCDQcs89ifLV9IueZGZ8g5YiS4mqHoxUr7yCbPCUhZXpFfKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d36e831133991ceee6e232a3860a84b68883d60e2ba44d55858ea2202273ae","last_reissued_at":"2026-07-05T12:03:41.414080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:41.414080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"math.OC","authors_text":"Guillaume Wang, L\\'ena\\\"ic Chizat","submitted_at":"2022-11-02T17:03:40Z","abstract_excerpt":"We consider the problem of computing mixed Nash equilibria of two-player zero-sum games with continuous sets of pure strategies and with first-order access to the payoff function. This problem arises for example in game-theory-inspired machine learning applications, such as distributionally-robust learning. In those applications, the strategy sets are high-dimensional and thus methods based on discretisation cannot tractably return high-accuracy solutions.\n  In this paper, we introduce and analyze a particle-based method that enjoys guaranteed local convergence for this problem. This method co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01280","kind":"arxiv","version":4},"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/2211.01280/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.01280","created_at":"2026-07-05T12:03:41.414136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01280v4","created_at":"2026-07-05T12:03:41.414136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01280","created_at":"2026-07-05T12:03:41.414136+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDJW5AYRGOMR","created_at":"2026-07-05T12:03:41.414136+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDJW5AYRGOMRZ3XG","created_at":"2026-07-05T12:03:41.414136+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDJW5AYR","created_at":"2026-07-05T12:03:41.414136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.08106","citing_title":"Mirror Descent-Ascent for mean-field min-max problems","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19392","citing_title":"Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach","ref_index":239,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS","json":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS.json","graph_json":"https://pith.science/api/pith-number/IDJW5AYRGOMRZ3XG4IZKHBQKQS/graph.json","events_json":"https://pith.science/api/pith-number/IDJW5AYRGOMRZ3XG4IZKHBQKQS/events.json","paper":"https://pith.science/paper/IDJW5AYR"},"agent_actions":{"view_html":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS","download_json":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS.json","view_paper":"https://pith.science/paper/IDJW5AYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01280&json=true","fetch_graph":"https://pith.science/api/pith-number/IDJW5AYRGOMRZ3XG4IZKHBQKQS/graph.json","fetch_events":"https://pith.science/api/pith-number/IDJW5AYRGOMRZ3XG4IZKHBQKQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS/action/storage_attestation","attest_author":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS/action/author_attestation","sign_citation":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS/action/citation_signature","submit_replication":"https://pith.science/pith/IDJW5AYRGOMRZ3XG4IZKHBQKQS/action/replication_record"}},"created_at":"2026-07-05T12:03:41.414136+00:00","updated_at":"2026-07-05T12:03:41.414136+00:00"}