{"as_of":"2026-08-18T00:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f66819e6468448155a1a7946accf6af384c92dc11e0ccdf455163e419190b4b9","coverage":[{"denominator":88,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":88,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:14:35.085921Z","state":"measured"},{"denominator":88,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":88,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.09330/citation-record","integrity":"/paper/2501.09330/integrity","json":"/paper/2501.09330/citation-record.json","paper":"/paper/2501.09330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.667271Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.667271Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:e7a5518f58ad2a53ebd917e12a5966cf707f1cbbc9e0f2a51d9931c6da6b6380","observation_id":"99e40eb0-beda-443e-8370-0a537778ac23","resolution":{"observed_at":"2026-08-10T20:14:34.667271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.672588Z","title":"The mechanics of n-player differentiable games","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.672588Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:58fa7263c97227f0efd484a59dde3285a3700c1a0b78e612364bdbc815e6be5c","observation_id":"38eee5e2-5673-41ec-839f-eb523a7183a1","resolution":{"observed_at":"2026-08-10T20:14:34.672588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.677879Z","title":"Berahas, Liyuan Cao, Krzysztof Choromanski, and Katya Scheinberg","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.677879Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:59d7c66845377a9e780273c45600b27b673efeaf2bb4f918f5b40d0f0e74af13","observation_id":"01156840-470a-46d4-ae0e-9d621f4cb310","resolution":{"observed_at":"2026-08-10T20:14:34.677879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.682953Z","title":"Learning equilibria in symmetric auction games using artificial neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.682953Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:4e72de742323ce91d79acc915d0a3a965b68095b80b3e9b925e155ac62783686","observation_id":"2173c2e5-a4cb-4580-91f7-17970077c033","resolution":{"observed_at":"2026-08-10T20:14:34.682953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.688460Z","title":"JAX : Composable transformations of Python + NumPy programs, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.688460Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:ebfa8c70fde24e35bbbc4c7eed365b613fe861617d8e6e09799eab7a4df90900","observation_id":"c43bd4c4-7cdf-471f-b3ab-fc5cd02af745","resolution":{"observed_at":"2026-08-10T20:14:34.688460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.693509Z","title":"Superhuman AI for multiplayer poker","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.693509Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:984f6648cbe75e980404da1655489640364b3e536e1284bd58ca6398c13245f5","observation_id":"0007aec2-97eb-42e6-974b-296b56d2559c","resolution":{"observed_at":"2026-08-10T20:14:34.693509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.698800Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.698800Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3e82ddddeacb79f4e283b3d1d0cd87bf575edd360fb39141670d657471bd7763","observation_id":"720022aa-86c5-4afd-80fe-09d1aa1537d7","resolution":{"observed_at":"2026-08-10T20:14:34.698800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.703201Z","title":"Caines, Minyi Huang, and Roland P","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.703201Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:8f5c13466755bf5b75148a3d5a63e4802d0f5c80e1f6ed0b2dba96d8cd0cec53","observation_id":"ef3cbaf7-8fb4-40aa-887b-3d767a3b6ddd","resolution":{"observed_at":"2026-08-10T20:14:34.703201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.632242Z","title":"The dyson and coulomb games","venue":null,"work_id":"329ee087-1ace-4768-8f03-30d751d06a5b","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.707686Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fd29f1bf8e0fb4eb3c63da770b7fb185bd64aa549b05c1c86a9c20fcded6c6cc","observation_id":"84147a6d-f656-4d7e-9efb-324b6966b817","resolution":{"observed_at":"2026-08-10T20:14:36.637093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.616407Z","title":"Bertrand and Cournot mean field games","venue":null,"work_id":"2228ea92-80da-4e98-bc4e-b53a9bca04d2","year":2015},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.712050Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:22dd4cb0cb69c0cfb4a7e9d52d6391a793d01662dbdc52acbcc9f4e30908d312","observation_id":"0dfb2b58-cb4f-4e16-9348-36cfb0b08789","resolution":{"observed_at":"2026-08-10T20:14:36.621417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.600946Z","title":"Principes de la th \\'e orie des richesses","venue":null,"work_id":"5140a295-1c6e-4b8c-b476-5c5282d73713","year":null},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.718015Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:cbf298230417411e752c940954b188602a66dd34f0d7d0ae85612f1ae3db7280","observation_id":"40ceceaf-4a2d-4510-baef-03bb122ee3e7","resolution":{"observed_at":"2026-08-10T20:14:36.605748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.722715Z","title":"Approximation by superpositions of a sigmoidal function","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.722715Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:2ee93474e2bd790d48797391fe70ae10e291b270c4235fbebd6b59f83a718387","observation_id":"4ceda33b-ce6e-44bf-925f-39cff5daf406","resolution":{"observed_at":"2026-08-10T20:14:34.722715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.574131Z","title":"The existence of equilibrium in discontinuous economic games 1: Theory","venue":null,"work_id":"09789917-7587-4d8d-80bd-0bda6c727b40","year":1986},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.727112Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:804536814ca4b622f69f161752ab122a2e8a2ff35bcccc8760fbf077e25f6cc3","observation_id":"67cb3750-dd3a-411a-bc87-5c1a21a3b08b","resolution":{"observed_at":"2026-08-10T20:14:36.579525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.557830Z","title":"Training GAN s with optimism","venue":null,"work_id":"b6e4459d-77d6-4fd2-9a2d-26c9e46cfadd","year":2018},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.731602Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:b3645564c554ad2076d7f5c93e8c7811a4740a9d727b783efc9b76320054b5d5","observation_id":"25bbc6f1-4990-42da-a2a3-2ad8303483ab","resolution":{"observed_at":"2026-08-10T20:14:36.563052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.541751Z","title":"A social equilibrium existence theorem","venue":null,"work_id":"aaf42107-0e3d-4280-a95e-d1eb18463d5c","year":1952},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.735798Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:e023f0a08c3ed58a3a4d99fdb31cd614a5991c17cc157826cfcd32aec55d2edf","observation_id":"21287aeb-407c-404c-8a4e-56b08f998fda","resolution":{"observed_at":"2026-08-10T20:14:36.546783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.740163Z","title":"The D eep M ind JAX E cosystem, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.740163Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:a72a7362986661d4ca7a4db99569fd64e2cbf9fc7002b66289e812fa9eaea206","observation_id":"b23249d4-e563-4242-977b-82849d038fef","resolution":{"observed_at":"2026-08-10T20:14:34.740163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.514062Z","title":"Duchi, Michael I","venue":null,"work_id":"e79f6197-3eea-4703-9edf-d472087c932c","year":2015},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.744562Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:ac25f5b1111df816c2f3625586de4c45a637c5f5b63301f9c4865f829fe3f7b6","observation_id":"d3d7ae6d-1aed-4fc9-b929-72cccaaf9242","resolution":{"observed_at":"2026-08-10T20:14:36.519222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.499132Z","title":"Beitrag zur theorie des ferromagnetismus","venue":null,"work_id":"48403b4d-d407-4d75-b3e3-a2c5e3a2946b","year":1925},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.749200Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:52d8b81f743ed0c611ee4c760c66250a10816fe101733ea31cbc25e2f6296d35","observation_id":"db26c650-48be-4d52-8af9-90b05ae86ae0","resolution":{"observed_at":"2026-08-10T20:14:36.503812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.482956Z","title":"Fixed point and minimax theorems in locally convex topological linear spaces","venue":null,"work_id":"fb7e1dd4-2df8-435a-90a6-191206cf2576","year":1952},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.753963Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:80084bdb6d5ac730549a20ede348f90e0e49ecc86b932686d9e50baa7a47f73f","observation_id":"415cff8e-0dff-4502-8a75-853b8a1a7806","resolution":{"observed_at":"2026-08-10T20:14:36.488031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.466453Z","title":"Feldman, Inwon C","venue":null,"work_id":"5fd5a3cc-de4f-4052-895b-627474df2955","year":2024},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.758387Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:f329b75be56a7293a6648eb46f22977507078e925870fa06dbb5515fc7e59aec","observation_id":"d9790e55-2e5e-425c-b0c3-7b01d5581d5f","resolution":{"observed_at":"2026-08-10T20:14:36.471685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.448400Z","title":"Ising model versus normal form game","venue":null,"work_id":"d280955d-0efc-48c3-9d64-73fd9f118efc","year":2010},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.762922Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3e793408a502f89a2b1d2db9506d1c76f89c3560e23bd41bd091be7d60487505","observation_id":"e1079bd6-0654-4a07-89e5-6f68befa3510","resolution":{"observed_at":"2026-08-10T20:14:36.454084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.429856Z","title":"Computing equilibria by incorporating qualitative models","venue":null,"work_id":"002338c1-6b6d-4683-87f9-e35db5f2e7a0","year":2010},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.767409Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:52ea1efd4cb134a7c5b93d7db97c92e7d485b7fea91468bd1334f1e5e0b6bb6c","observation_id":"059f20cf-9977-44d3-87f1-09f2718b2610","resolution":{"observed_at":"2026-08-10T20:14:36.436161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.413317Z","title":"A further generalization of the K akutani fixed point theorem, with application to N ash equilibrium points","venue":null,"work_id":"0df13504-81e5-4fb7-ad1f-e5ef53d6e916","year":1952},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.771906Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:e1a5b5e05f0f8e96502995a69892672371e277e5cfb2ce8b40411c634126024e","observation_id":"8d8a6505-4851-4ad1-910e-ff9c881f6911","resolution":{"observed_at":"2026-08-10T20:14:36.418728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.396615Z","title":"Monte Carlo sampling methods using Markov chains and their applications","venue":null,"work_id":"a41b074b-daac-4f8b-9c1f-aa85964069c2","year":1970},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.776363Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:83d7e4b133052cca852fb2a5216d7893d08883f2c4ea49628d80caf9e8b438b9","observation_id":"2552d9a3-8930-49c7-8432-8a50e4c70bc4","resolution":{"observed_at":"2026-08-10T20:14:36.401961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.379247Z","title":"Delving deep into rectifiers: Surpassing human-level performance on I mage N et classification","venue":null,"work_id":"9316d4ca-7ac5-4beb-830d-9b4bafa4f387","year":2015},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.781819Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:699206d73af1dbb0ee5bf354633bbe075c4fbe4ad581df141354a7b8714782d1","observation_id":"25f83c73-e795-4092-b451-a6ee9e7116c5","resolution":{"observed_at":"2026-08-10T20:14:36.385433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.362964Z","title":"Flax : A neural network library and ecosystem for JAX , 2023","venue":null,"work_id":"86ae107e-4a26-4e68-a698-d9fdc7c49ec7","year":2023},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.786401Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:03bbd9e71a18e8bdc9c097ce70555ba570f31090bb89811315c4085ebaed7cc4","observation_id":"7832dc19-cc71-4bd3-8ab7-25401526ab05","resolution":{"observed_at":"2026-08-10T20:14:36.368174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.791426Z","title":"Approximation capabilities of multilayer feedforward networks","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.791426Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:01e7d8abff78b2d5979610a4040ca14554755e4adf1fc06a77436f62bc21b058","observation_id":"2dcad40e-18b3-45e0-b94f-c93836fd837b","resolution":{"observed_at":"2026-08-10T20:14:34.791426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.796092Z","title":"Multilayer feedforward networks are universal approximators","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.796092Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:b9db82aaa51500e790e81555a1ddc53e74b3cc1749c5ea6142b4883c6f6d2b91","observation_id":"ce144b7e-1429-4fc7-bbe8-16fb5427b507","resolution":{"observed_at":"2026-08-10T20:14:34.796092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.326933Z","title":"The limits of min-max optimization algorithms: Convergence to spurious non-critical sets","venue":null,"work_id":"0b3df5d0-51f2-405f-8a4b-9fb16aa52178","year":2021},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.800784Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:19a3bcd510c49b516510d13939e9a18f693308021a28b9dce0ab4904c0b5855b","observation_id":"f058e1a8-27c3-46fd-be3c-ad8849132e22","resolution":{"observed_at":"2026-08-10T20:14:36.331808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.310804Z","title":"On the convergence of single-call stochastic extra-gradient methods","venue":null,"work_id":"10f1fc74-53aa-4072-8d76-3459619d0934","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.805713Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:87b4308d20b3048f0a4c98b49fa821e72b00416e1f50cd4b8db2594bfa80fc11","observation_id":"a0a71582-01f0-4947-834e-7e2086e51b57","resolution":{"observed_at":"2026-08-10T20:14:36.316081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.295748Z","title":null,"venue":null,"work_id":"84db6b33-f36b-445a-8cec-813096542797","year":2007},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.810345Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fa7a4c26379ebeb12aa26c7a7974af9337d6be109a581b4916be18a3bd442767","observation_id":"4a0e76bd-b88f-48f9-abc9-9a6ad5803143","resolution":{"observed_at":"2026-08-10T20:14:36.300642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.277877Z","title":"Self-gated rectified linear unit for performance improvement of deep neural networks","venue":null,"work_id":"94d5e254-53d8-4a36-8bd5-ac4c20d70fbd","year":2023},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.815032Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:7fcf2d2cf72299cdfcbba3c2bbafea339be27797aaf1c583765a0fad53d2a107","observation_id":"2df2e6ba-9a93-40d6-a7ef-6a1e86acc96a","resolution":{"observed_at":"2026-08-10T20:14:36.283881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.261774Z","title":"Ali Khan","venue":null,"work_id":"7159fb08-5919-455a-bc95-bd4769a28da4","year":1985},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.819769Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:7f5fac25589ad81db30e1ef44eaa569d6be1b0c89a19b6ac4ba536bfe2a6b6ce","observation_id":"631cff8c-d04c-4b20-9cbf-c57330c067e0","resolution":{"observed_at":"2026-08-10T20:14:36.267062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.245778Z","title":"Ali Khan","venue":null,"work_id":"7aebae9a-3764-49f8-83a9-2f2e9123c342","year":1986},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.824634Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:75efc6d91f9aeb4d83f6f4859df6ad3a9b869c1ae4f657a44eeed17268cbd2a5","observation_id":"a9d6b560-df01-42ce-bc4c-9da05dad7b80","resolution":{"observed_at":"2026-08-10T20:14:36.250782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.230845Z","title":"Ali Khan and Nikolaos S","venue":null,"work_id":"d6037868-1bd3-4907-beb2-606ed090f3e3","year":1987},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.829685Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:b6f2f9a0d1ab25600ad51f7f2889c16a798c36f099329e6a2cc2cffadc0829ed","observation_id":"2d28f61f-e80d-44d6-ae3b-23e1d84988d9","resolution":{"observed_at":"2026-08-10T20:14:36.236003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.216903Z","title":"Ali Khan and Nikolaos S","venue":null,"work_id":"a556518b-6d2c-4c15-9aec-0761ad9e09a7","year":1987},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.834269Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:edab9c344b615095f850b10dd5b8ec1463db62666531b4765f8fcadba730ed6c","observation_id":"23a6bbc3-b264-4b88-b2be-71be5d011246","resolution":{"observed_at":"2026-08-10T20:14:36.221611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.202429Z","title":"Ali Khan and Yeneng Sun","venue":null,"work_id":"be2178bb-d034-42d9-9a57-7d76b42d2002","year":2002},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.838993Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fcb45da130cf834725e126ca23cb603acff884b410aca1d8fcae55375df86136","observation_id":"aabbe685-5885-45b8-8a59-1f61d3a172b4","resolution":{"observed_at":"2026-08-10T20:14:36.206943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.187307Z","title":"Yannelis","venue":null,"work_id":"98bdb703-a18b-4b7e-93a8-eba50a9fc175","year":1989},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.844121Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fa8c28d4c6aacea4c3ffa655f1852e4edb9a2078303ac89d219c6e49b52ec8e0","observation_id":"e10ccaaa-51d0-49d3-9496-3cb060b1b3c9","resolution":{"observed_at":"2026-08-10T20:14:36.192081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.171686Z","title":"Auction Theory","venue":null,"work_id":"c39708b7-8fb0-405c-8276-8bc3d67d1d9d","year":2002},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.848566Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fe45bd5ffc1f392c68461f4a15ab01ab183a6bfc4e3ab7136a6b92a7912ebd14","observation_id":"e719e6a3-9cf1-4f7c-86be-2bba9aa7f61c","resolution":{"observed_at":"2026-08-10T20:14:36.176373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.156377Z","title":"A unified game-theoretic approach to multiagent reinforcement learning","venue":null,"work_id":"a8a9000f-62d2-4ea5-a51c-4cb74170a903","year":2017},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.852994Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3cab3e93ff8f726d9e85aa93bd946714818a7209fe50704910f7d25e0cebcbbb","observation_id":"5699a333-4105-4d70-b85e-59736e393bbc","resolution":{"observed_at":"2026-08-10T20:14:36.161372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.03139","last_updated":"2019-06-07T14:52:19Z","snapshot_observed_at":"2026-08-14T16:19:11.575173Z","submitted_at":"2019-06-07T14:52:19Z","title":"Non-Differentiable Supervised Learning with Evolution Strategies and Hybrid Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.03139","snapshot_observed_at":"2026-08-10T20:14:34.857702Z","title":"Non-differentiable supervised learning with evolution strategies and hybrid methods","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.857702Z"},"links":{"cited_paper":"/paper/1906.03139","citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:545bc3ee72c6bd3ff4bb9081bc58e41758d429817befb6f4b3d4cbf61ad087c6","observation_id":"00c49abf-f821-4ea0-b1c9-edc2edf26536","resolution":{"observed_at":"2026-08-10T20:14:34.857702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.141355Z","title":"Beitr s ge zum verst s ndnis der magnetischen eigenschaften in festen k s rpern","venue":null,"work_id":"8771757a-d91b-4ee3-9e57-782f634b6a6d","year":1920},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.862811Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:c9296996c74a4f3744a01d3c0b6a83a7d9eeff133ec618d7117a164851e44d08","observation_id":"a4b97bba-7946-421e-af64-a878e79aa82e","resolution":{"observed_at":"2026-08-10T20:14:36.146240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.126457Z","title":null,"venue":null,"work_id":"e8c8ad08-52eb-4248-9b38-4855d2eb34d8","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.867670Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:c08a2f09cd1879458b6ac7d0db0a7ab4f67d45ede22d0bb45113a0a6ae0a497b","observation_id":"b052499c-879b-457d-ba3e-f81722cf5e39","resolution":{"observed_at":"2026-08-10T20:14:36.131147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.111384Z","title":null,"venue":null,"work_id":"ccd02b91-7996-4f83-a1aa-3a1562303f4f","year":2024},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.872774Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:f14f2374eba85cb44d50c451f01c2de34f2c5741661addef40de37a498d1b2b3","observation_id":"1bbdd4a2-1586-4802-8559-adb01af3107e","resolution":{"observed_at":"2026-08-10T20:14:36.115994Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.096179Z","title":"Multilayer feedforward networks with a nonpolynomial activation function can approximate any function","venue":null,"work_id":"12faa5aa-a343-44b9-8308-185be8cc2001","year":1993},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.878144Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:81c1391122ee27607901152bbacf412d7aa4fa813262dfa3106092b940c12299","observation_id":"cce47da3-24a4-43b4-8b6c-5df72d0d96de","resolution":{"observed_at":"2026-08-10T20:14:36.101080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.080196Z","title":"Differentiable game mechanics","venue":null,"work_id":"dfaaa506-02e4-46bb-8bcb-b67e04dfcbc5","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.882889Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:0e24ec7ad0a7040809c06bd3edcb21ec4114ce9143cf25bef4ee99ac27541272","observation_id":"b391504a-1e0b-49e9-9eeb-909ae4cbd924","resolution":{"observed_at":"2026-08-10T20:14:36.086055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.064858Z","title":"Stable opponent shaping in differentiable games","venue":null,"work_id":"278bc988-6347-4ea9-bf91-bc881d6910ab","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.887414Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:4f278dce535bce98a36bab380f089a19c0a102a034bcb0c323645fcfd4242949","observation_id":"2db2a0a5-611d-441a-9382-a7dbd599619a","resolution":{"observed_at":"2026-08-10T20:14:36.069806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.048178Z","title":"Computing approximate equilibria in sequential adversarial games by exploitability descent","venue":null,"work_id":"7a7653b9-4d6f-4030-9009-5e30a1433827","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.892599Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:117d61c858c32d6c391a98358e2bc0784f85785b0a8631bde12ec8751a4c0ae3","observation_id":"61d84f0d-048e-4374-8ce6-6fe324dcbd8f","resolution":{"observed_at":"2026-08-10T20:14:36.054262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.032097Z","title":"Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks","venue":null,"work_id":"28ad96a8-15fc-415b-92a0-f63d7862bea8","year":2023},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.897835Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3e7fa1e56c3be8b4b1e172b64c581c3695b5ca84053542f35b907c77b22faa96","observation_id":"204dfb39-7956-40cb-ae29-3356e22e8163","resolution":{"observed_at":"2026-08-10T20:14:36.037432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2408.09306","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.328179Z","title":"Joint-perturbation simultaneous pseudo-gradient","venue":null,"work_id":"a2be7d69-0730-4824-9f99-ca8059ac0e32","year":2024},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.902744Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:42f2f01c5a514f6192e9734d1f164ad2bb13dff95a3320a03002567cdcccf35d","observation_id":"c763c2bc-c3f8-4256-990f-a56c1a77bc39","resolution":{"observed_at":"2026-08-10T20:14:35.336395Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:36.016559Z","title":"Ratliff, and S","venue":null,"work_id":"6d22f454-b41b-4414-9654-2c5b5fd499ca","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.907480Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:ebc37dc2f0e8301b965e39b0b5e35e511185d78484fd54f4f805645975a84e80","observation_id":"ef08fa7f-e20f-43e2-b9f1-d0be091c04d5","resolution":{"observed_at":"2026-08-10T20:14:36.021397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00838","last_updated":"2019-01-25T02:00:08Z","snapshot_observed_at":"2026-08-14T20:46:49.537903Z","submitted_at":"2019-01-03T18:33:53Z","title":"On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.00838","snapshot_observed_at":"2026-08-10T20:14:34.911931Z","title":"Mazumdar, Michael I","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.911931Z"},"links":{"cited_paper":"/paper/1901.00838","citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:f31e79661a1471a8c90e2c0085f3601787226bb6e513fab6cda43943eef5726c","observation_id":"729e21e8-18f0-4742-a313-17771bea8fcb","resolution":{"observed_at":"2026-08-10T20:14:34.911931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.999135Z","title":"Learning in games with continuous action sets and unknown payoff functions","venue":null,"work_id":"efe9260e-40a0-4820-b9e7-0a80aec01cf6","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.916936Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3682a576ccac32cffa1e25408f2c5f2caea174755af2629d09850f2dcc8aeb03","observation_id":"395ddb7d-58f6-4384-82ce-f6c654500ab5","resolution":{"observed_at":"2026-08-10T20:14:36.005047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.982100Z","title":"Equation of state calculations by fast computing machines","venue":null,"work_id":"cfa59ddb-d15a-48f9-bef9-d477514930fe","year":1953},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.921582Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:8729e8e86295b34ed5f772254b40ca33c1e01bc2c30f6237c57f4c860a29e209","observation_id":"8f8d7ccc-39e0-4423-b044-30425f0842ba","resolution":{"observed_at":"2026-08-10T20:14:35.986991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.966616Z","title":"Generic Uniqueness of Equilibria in Nonatomic Congestion Games","venue":null,"work_id":"f5fe15c2-b973-40cf-bf8a-698820e317f4","year":1996},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.926123Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:1d10f44dd3488f4c977da00834800da5d3348056d1eab6f31b2940a568bff31c","observation_id":"8ffd6fc3-13a5-4eb6-a50e-d47e20ebc77d","resolution":{"observed_at":"2026-08-10T20:14:35.971634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.835770Z","title":"Generic uniqueness of equilibrium in large crowding games","venue":null,"work_id":"0bc32483-a1fa-4d04-b3be-ab7340dc85f2","year":2000},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.930822Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:8eb83836c10f353312364d861dd4b45e924b6232778443f0bbe6e1bdea60136a","observation_id":"5b64c1e1-7309-4d74-8945-e17152139ea3","resolution":{"observed_at":"2026-08-10T20:14:35.955289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.820057Z","title":"Topological conditions for uniqueness of equilibrium in networks","venue":null,"work_id":"16ba40ca-7ad5-472c-97c2-90404cb22e26","year":2005},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.935664Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3551c6655f92914fa8f4a37475bc015e3a797ed12383b7036e2f076418c38938","observation_id":"08c72de0-960a-4ea0-b1c6-6f39bd0c0f08","resolution":{"observed_at":"2026-08-10T20:14:35.825087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.804208Z","title":"Learning equilibria in mean-field games: Introducing mean-field PSRO","venue":null,"work_id":"770793ff-3321-4c16-87aa-3dd5621c684e","year":2022},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.940341Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:9098324963484743d9c88e1ada9b4498109360255cd53c60bff3e02df35fecf3","observation_id":"da348f2e-1244-4b6b-96bd-b07ba0f13def","resolution":{"observed_at":"2026-08-10T20:14:35.809161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:34.945224Z","title":"Equilibrium points in n-person games","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.945224Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:5030da6ff7d721a1fe777d0329b2131c9b11e7ced012ca2c193d3ddace32eb12","observation_id":"0564cfb3-b281-40b4-8df3-ccb15b822cc7","resolution":{"observed_at":"2026-08-10T20:14:34.945224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.776951Z","title":"Non-cooperative games","venue":null,"work_id":"a3de54d8-f07d-4b37-aeeb-8a57f4332053","year":1951},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.949918Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:3d781dab33861f80fd5b55e91f41fa57c9f1922aec18416d46ff7271d4225b78","observation_id":"4f563910-b063-43fe-98bb-89c76d24b66f","resolution":{"observed_at":"2026-08-10T20:14:35.782194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.760693Z","title":"Random gradient-free minimization of convex functions","venue":null,"work_id":"089afd38-2d65-46fc-9c54-ab3bd06a494b","year":2017},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.954241Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:fe209ad3a89240e74cd70668a2e024db6428f1b83070114b1af6437ba2f1cf56","observation_id":"106e70d5-61f2-4bc4-b174-e9a2805e408a","resolution":{"observed_at":"2026-08-10T20:14:35.765714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.743822Z","title":"Perfectly competitive markets as the limits of Cournot markets","venue":null,"work_id":"f4301787-8528-4f6e-b59e-71a535c7d49a","year":1985},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.959100Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:e1f7b8caba824bccddd4493ae16855a8d5d2a84882c7fb7ab8122beb59089a3a","observation_id":"b1cf1461-347e-41ee-b225-15ea2e55cd6c","resolution":{"observed_at":"2026-08-10T20:14:35.749658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8526.33296","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.225518Z","title":"Graphon games","venue":null,"work_id":"5bafbe8c-b808-4cb6-95ba-7abf79735321","year":2019},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.963886Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:1c9ea8ec169093ab75f35e7dd08785b08aecace955bd58ec421a25a13d4efc3b","observation_id":"d5da541d-90d9-451b-8932-4b5be8e2f35a","resolution":{"observed_at":"2026-08-10T20:14:35.233575Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.727661Z","title":"Graphon games: A statistical framework for network games and interventions","venue":null,"work_id":"0282309a-4cec-48cf-836f-745becf3eb07","year":2023},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.968705Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:efe23afb4861103edbfbfd2303e2db11ac9a98a8af1ab43f02fb19ab700c1922","observation_id":"71c2ac0b-22bd-4564-b946-98ef8fa62464","resolution":{"observed_at":"2026-08-10T20:14:35.733389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.710606Z","title":"Scaling mean field games by online mirror descent","venue":null,"work_id":"14727acb-f626-4c16-8569-a1756f355eaf","year":2022},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.973328Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:207d379fe37010c1aac2a744866c58a3011278f8c3ee38156b6c050957249eef","observation_id":"8f216ae7-77ce-44dd-9a7f-457b5c3cd4c8","resolution":{"observed_at":"2026-08-10T20:14:35.716194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.694946Z","title":"Fictitious play for mean field games: Continuous time analysis and applications","venue":null,"work_id":"264f3ee8-2676-4ff2-9f03-fed8f37fbbf0","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.978137Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:9488408ff125d5f2d0a84d6a54332d47a0672a29cc563c90f53756fc070bee2c","observation_id":"e8e445d5-187d-4203-9465-2d8cf2a84aba","resolution":{"observed_at":"2026-08-10T20:14:35.699906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.679038Z","title":"Approximation theory of the MLP model in neural networks","venue":null,"work_id":"4f65288d-2a17-4474-9cd2-247e82297189","year":1999},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.983237Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:dab58d3f54e9e251b420a15105c802061d93a7bd0dd621c531115fe9052cdf6b","observation_id":"5a73b777-ca6e-4f06-8c04-5a4c15acede7","resolution":{"observed_at":"2026-08-10T20:14:35.684620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.662077Z","title":"A modification of the A rrow- H urwicz method for search of saddle points","venue":null,"work_id":"1c297528-247b-4827-8895-fd1aef4425c9","year":1980},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.988105Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:39c2b4b2e7d2ed9a37fe1c97ecd5b8ff18f6830a928c4b5aab26da9ffd9d950c","observation_id":"4b6bd344-1a64-4e1f-8052-930b45818801","resolution":{"observed_at":"2026-08-10T20:14:35.667516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.645810Z","title":"On the spectral bias of neural networks","venue":null,"work_id":"b5244b62-3670-4489-abcd-c46ec040f6d1","year":null},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.992770Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:2eb932f9569d7adf23659862276145c0a584d2a79fd1dedeef994b0219cd46d2","observation_id":"ad076151-6ce2-44dd-865e-7afe2fac2123","resolution":{"observed_at":"2026-08-10T20:14:35.650775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.630283Z","title":null,"venue":null,"work_id":"15f4f58b-b0b6-4f1e-a009-fdc8b65e1386","year":1992},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:34.997727Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:5db5399dc8f940a590f258a42ec36694ac5667f41a745eef8dc707383bbfd406","observation_id":"da8c0ef7-71f3-48aa-b470-22171904b23a","resolution":{"observed_at":"2026-08-10T20:14:35.635004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.614675Z","title":"The unreasonable effectiveness of quasirandom sequences, 2018","venue":null,"work_id":"afe13c67-67f9-4269-9479-06d9ea6b1f73","year":2018},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.002503Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:8b1923d18c89214d93a2799a428ac46c439847fae357bb14afb160b6dd8b13fe","observation_id":"e49852de-d70b-42e6-aa0e-26a08ba9bf18","resolution":{"observed_at":"2026-08-10T20:14:35.619819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.599707Z","title":"Ben Rosen","venue":null,"work_id":"0803db14-f94d-411b-b43f-f18685e8d1a4","year":1965},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.007425Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:2224d743e63581e09c673f7ccf2c5cfd1ff5c800584f94367c0415862c6637b7","observation_id":"9d653db8-fffe-4fd1-a229-2414cc5a93f7","resolution":{"observed_at":"2026-08-10T20:14:35.604437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.582670Z","title":"An automatic method for finding the greatest or least value of a function","venue":null,"work_id":"2ea94088-6f14-40b0-90f1-564e010d4e20","year":1960},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.012152Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:9f346d04b2ee465e7fc2961f148c9803462adca6a6c3a72e093e54e5572b2e6f","observation_id":"f47da52a-b5f0-45c4-9dc5-d73f7e0293dd","resolution":{"observed_at":"2026-08-10T20:14:35.588388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.017114Z","title":"Evolution strategies as a scalable alternative to reinforcement learning, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.017114Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:767567c60e6643efbd77a3ca2acdef68cee97abd15787aa8ea559e3580837b05","observation_id":"5bc59a9d-f20a-4446-9bd6-f2c3b95e1a40","resolution":{"observed_at":"2026-08-10T20:14:35.017114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.556642Z","title":"Equilibrium points of nonatomic games","venue":null,"work_id":"d43a3237-fa6a-4110-8e55-6a5d1d28fe04","year":1973},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.022084Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:b82251188f7d4238289a36bb64f412bda47b38a8d61f86c54cd6ccef44184f09","observation_id":"2b18bc48-3df1-47f7-8f3d-3fcacddb051f","resolution":{"observed_at":"2026-08-10T20:14:35.561629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.541058Z","title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","venue":null,"work_id":"96a298b3-4b6c-4f27-b1e4-4638ece1d664","year":2017},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.026879Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:0153317911d56fbb7ac6c97f78c2b6a97ae46945c42e26e9842c075182852296","observation_id":"195107a5-f3c9-4bee-a778-f9689a763dd9","resolution":{"observed_at":"2026-08-10T20:14:35.546129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.525902Z","title":"Fourier features let networks learn high frequency functions in low dimensional domains","venue":null,"work_id":"f61b7322-391a-45df-90cb-ebc68f6932bc","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.031850Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:97eb99957bbf91048f5802a597ed3697c92358935d1a520b79fffcd2b93c40e7","observation_id":"c6c5a147-cbdc-4132-ab3e-0f4462039c91","resolution":{"observed_at":"2026-08-10T20:14:35.530736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.510665Z","title":"Approximate exploitability: Learning a best response","venue":null,"work_id":"c1ffc865-287a-4040-978a-922a35acf64a","year":2022},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.036780Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:d42fdf1950f8d5df11e6b4200c7eeffbc1ad62b8db2ff5bff39ed54681d7f50f","observation_id":"621482a0-c841-4f37-b274-b7504f2744e0","resolution":{"observed_at":"2026-08-10T20:14:35.515470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.494734Z","title":"Munchausen reinforcement learning","venue":null,"work_id":"68eb8973-1d93-4fa7-a1be-96906a91c289","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.041481Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:0d0af011ae2562543ccfba264a72a2765ecf869a462c6e952a6712392d638fa6","observation_id":"10410c92-6524-413c-a20e-d25d5acc7a18","resolution":{"observed_at":"2026-08-10T20:14:35.499466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.479037Z","title":"Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, St \\'e fan J","venue":null,"work_id":"d6f83924-0321-4bb2-b9bc-3fe3919c6d8e","year":2020},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.046301Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:ba11506c110634e0217acbf198ee3f4682bff54c899604d4238d99d1ef3e1bfb","observation_id":"58de487f-5b04-4533-b760-5e3716072443","resolution":{"observed_at":"2026-08-10T20:14:35.484227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00187","last_updated":"2021-03-02T03:41:22Z","snapshot_observed_at":"2026-08-16T18:42:34.457697Z","submitted_at":"2021-02-27T11:16:09Z","title":"Multi-agent Reinforcement Learning in OpenSpiel: A Reproduction Report","version":2},"cited_work":{"arxiv_id":"2103.00187","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.00187","snapshot_observed_at":"2026-08-10T20:14:35.125100Z","title":"Multi-agent Reinforcement Learning in OpenSpiel: A Reproduction Report","venue":"cs.AI","work_id":"67b2afc7-8e9c-4c63-883b-71d6337535c0","year":2021},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.051362Z"},"links":{"cited_paper":"/paper/2103.00187","citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:78428c5b1685e776c781b5ca0a6badab9d0a8d38c83496680617dbddb6b2cec6","observation_id":"cac0c91d-3ebb-4a24-b1fa-2346ec72f10d","resolution":{"observed_at":"2026-08-10T20:14:35.132172Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.463129Z","title":null,"venue":null,"work_id":"667534cd-64a0-440a-9840-b9b22cb6d1b2","year":2023},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.056694Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:8a87c4e3f2121ffa0f3eb671dac410eb2a301f0294ae70c986a9b5c4613d23c8","observation_id":"1cd76dcd-c8c0-4321-93d5-960fa7668ae8","resolution":{"observed_at":"2026-08-10T20:14:35.468353Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.446447Z","title":"Natural evolution strategies","venue":null,"work_id":"5dc98b10-ea03-413e-bdc1-379feef9b3fb","year":2014},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.061919Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:0b6c85ffbe1b927b9682ea64205915e6cc8961ff27f877df3a9de8c12a88293a","observation_id":"da5e111a-2f4b-43e6-bb66-80c1927f4f49","resolution":{"observed_at":"2026-08-10T20:14:35.451940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.429978Z","title":"COLA : Consistent learning with opponent-learning awareness","venue":null,"work_id":"ad5e937d-ef8a-41a2-8df1-978c816fab3e","year":2022},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.066665Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:d664a8478d5a1ef2a341c37d07b43af8b9ad0eff759f8b677e4166718d912442","observation_id":"3cf24be7-76f2-4f6d-80c2-2d0e4bd5ce06","resolution":{"observed_at":"2026-08-10T20:14:35.434939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.414154Z","title":"Open and closed loop Nash equilibria in games with a continuum of players","venue":null,"work_id":"ebb12faf-553f-49f6-8760-461313dd40d0","year":2014},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.071594Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:93a87900e7248d8c05c2a3451e3bb187f4f3aea7ae32c900b43cdf11f0e4e1d9","observation_id":"2412e98c-d17d-45f9-a85d-147f3f6d3ed1","resolution":{"observed_at":"2026-08-10T20:14:35.419148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.397966Z","title":"Population-aware online mirror descent for mean-field games by deep reinforcement learning","venue":null,"work_id":"1b4935e1-fd41-40fe-a0bb-d125772b06a0","year":2024},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.076405Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:ef35b5705901986520a698229deb707c7fb2231ac0ed5d59022212c2e12c38f4","observation_id":"770a45b7-9f33-4831-92d4-e1e27addcbdf","resolution":{"observed_at":"2026-08-10T20:14:35.403137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.381903Z","title":null,"venue":null,"work_id":"c60633af-219e-4ff4-8716-bdf1b85698ea","year":2017},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.081464Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:aecd9daec9d9d2935ff6b258682c33af49e3bc771cb3015549677699cc031d2d","observation_id":"7a03ff14-dd87-49f2-a435-35a2bf7255b6","resolution":{"observed_at":"2026-08-10T20:14:35.386951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:14:35.365904Z","title":"Stochastic search using the natural gradient","venue":null,"work_id":"f0ac7b82-c32a-43b0-97e3-18eec1ea3ccb","year":2009},"citing_paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-10T20:14:35.085921Z"},"links":{"citing_paper":"/paper/2501.09330"},"observation_digest":"sha256:7a566dc7dfe867823ccb35e933fd07dccd8d417db8137354853b5cb9f99321d9","observation_id":"11a67a80-9433-409c-957d-427255a850c4","resolution":{"observed_at":"2026-08-10T20:14:35.371031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.09330","last_updated":"2025-01-16T07:01:01Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-14T20:47:47.485714Z","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks"},"reference_resolution":{"displayed":88,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":22,"verified_exact":2,"verified_fuzzy":63},"total_outbound_references":88},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 88 of 88 outbound references and 0 inbound Pith citation observations for arXiv:2501.09330."}