{"as_of":"2026-08-14T08:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:90e232614fe15b20d464d3c78e216a319b71590059c8541803b6aa72c1d6f4c8","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:19:48.074078Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:22:06.385512Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.11366","snapshot_observed_at":"2026-07-14T14:22:06.385512Z","title":"A parallelizable approach for characterizing ne in zero-sum games after a linear number of iterations of gradient descent.arXiv preprint arXiv:2507.11366, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09950","last_updated":"2026-07-10T20:04:08Z","snapshot_observed_at":"2026-08-11T01:38:40.560444Z","submitted_at":"2026-07-10T20:04:08Z","title":"Implicit Midpoint Gradient Descent: Fast and Learning rate free convergence for Zero-Sum Games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T14:22:06.385512Z"},"links":{"cited_paper":"/paper/2507.11366","citing_paper":"/paper/2607.09950"},"observation_digest":"sha256:3063dcd459e65f824add39dea1c6d2cedc29966c759c48571b437296402d6602","observation_id":"336c6131-7247-498a-b84f-c6838339de97","resolution":{"observed_at":"2026-07-14T14:22:06.385512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.11366/citation-record","integrity":"/paper/2507.11366/integrity","json":"/paper/2507.11366/citation-record.json","paper":"/paper/2507.11366"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:19:51.685198Z","title":"Last-iterate convergence rates for min-max optimization: Convergence of hamiltonian gradient descent and consensus optimization","venue":null,"work_id":"5f38f693-4257-4c68-b685-1f453e1e3176","year":2021},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:45.889401Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:90693ce5a12436be180f145679e76e74121f464161a8403468a396d3e70a93f9","observation_id":"7d278a29-6988-45d0-a3e4-d3c932aab415","resolution":{"observed_at":"2026-08-06T17:19:51.688441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.674902Z","title":"The equivalence of linear programs and zero-sum games","venue":null,"work_id":"c1ff487d-4967-487f-b1e9-94a6afb1cff8","year":2013},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:45.935218Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:58427c0bea03e4b749521d3e40a905d173bf0fa482c548eb2376dcba2351c787","observation_id":"17be902c-9d3f-46ad-8a88-32d1c6bffb04","resolution":{"observed_at":"2026-08-06T17:19:51.678406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02482","last_updated":"2021-10-06T03:29:21Z","snapshot_observed_at":"2026-08-14T08:02:18.894066Z","submitted_at":"2021-10-06T03:29:21Z","title":"$O\\left(1/T\\right)$ Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games","version":1},"cited_work":{"arxiv_id":"2110.02482","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02482","snapshot_observed_at":"2026-08-06T17:19:48.458165Z","title":"$O\\left(1/T\\right)$ Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games","venue":"cs.GT","work_id":"2da87952-6d8e-4059-ab7a-6da22920ba87","year":2021},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:45.996090Z"},"links":{"cited_paper":"/paper/2110.02482","citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:5f24062b33292a34c3dfd159f747138158ba2b3a6c69b203d3751eb746d9e5d9","observation_id":"6c668b6d-e43e-4f1c-ba54-7ffa47458164","resolution":{"observed_at":"2026-08-06T17:19:48.533072Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.666838Z","title":"Bailey, Gauthier Gidel, and Georgios Piliouras","venue":null,"work_id":"88ea4c1b-3242-46fc-8621-4d282eae0385","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.050055Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:c1c5802fd5fc3c6ae6a632d63617205ac76bfc68532f3a693b36a93fbd273af5","observation_id":"dc58cba9-791f-40ce-b720-12fbf4e15132","resolution":{"observed_at":"2026-08-06T17:19:51.669423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.657829Z","title":"Bailey and Georgios Piliouras","venue":null,"work_id":"187ab413-8ea4-43e5-8751-353ae500782d","year":2018},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.101414Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:701ff254221b3680b5c29fa77dca9e523d7ba27dabd329388e32ff0763d061f1","observation_id":"91b17e0c-bb90-40d5-a3cb-46f342932011","resolution":{"observed_at":"2026-08-06T17:19:51.660975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.646646Z","title":"Bailey and Georgios Piliouras","venue":null,"work_id":"423c31ec-88fc-4994-b011-6d22e0d5cb5c","year":2019},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.179118Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:5ff2fd326b9aa43aea5ad8ac62e2e2b19c128a103f06d17346d52fecd4fb7b4d","observation_id":"7f806d57-f135-49f8-9ad2-14df44c9916d","resolution":{"observed_at":"2026-08-06T17:19:51.649463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.637620Z","title":"Large scale gan training for high fidelity natural image synthesis","venue":null,"work_id":"5a50930d-1cee-497f-aabb-7cc182e5ec36","year":2018},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.248544Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:0b6a9f0a6d1ef979a00a898ce2a2525f54574f37a5493b1a0618e95fe2577f4c","observation_id":"864b354a-7a47-4c47-a628-4879fb095c48","resolution":{"observed_at":"2026-08-06T17:19:51.641023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.627479Z","title":"Zero-sum polymatrix games: A generalization of minmax","venue":null,"work_id":"e082f4ef-e909-4964-8497-49ae10493e0b","year":2016},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.340177Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:2d5d8923a3e8bfe13d871b9216122e3bcff1ac890299a866f912b296ac920fa8","observation_id":"174e3f01-07e2-4a2e-a9fe-471cd9358621","resolution":{"observed_at":"2026-08-06T17:19:51.630800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.618287Z","title":"Accelerated algorithms for constrained nonconvex- nonconcave min-max optimization and comonotone inclusion","venue":null,"work_id":"c7de8821-c21e-4ca6-96b5-e540537b62e1","year":2024},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.425888Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:26b41b3662c5e4dbe7ea7700b76e5f5428ddc3b2793ef03e75fd1c27d1a58735","observation_id":"4dc2db81-4d2d-42ce-af10-07ca18161cea","resolution":{"observed_at":"2026-08-06T17:19:51.621142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.608493Z","title":"Tikhonov regularization and the l-curve for large discrete ill-posed problems","venue":null,"work_id":"59977301-9709-485f-b8b9-86543632f952","year":2000},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.491601Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:ef09d818f949a822f3ef5410929e0288b714948a70a0f8aaf0e3a62bcfea3d70","observation_id":"2c9c0d0a-0fb9-49ef-b1a4-22b6279fc080","resolution":{"observed_at":"2026-08-06T17:19:51.611627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.598875Z","title":"Prediction, learning, and games","venue":null,"work_id":"a88f2266-0341-427e-b254-9fe87f1f83ab","year":2006},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.583590Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:dd7eea5f9088059afdba494a0b0d89227d6a710caf3c90119b96372a4cb84691","observation_id":"2f8a2ae3-ecba-431f-924d-83040a4c290a","resolution":{"observed_at":"2026-08-06T17:19:51.601732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.588075Z","title":"V ox2vox: 3d-gan for brain tumour segmentation","venue":null,"work_id":"2d87efa5-028c-4e7c-be70-5e62b092b7c3","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.653301Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:0fa9d3e8dd4002252adc21cb1f27bf6a3116c608ec3abab721e231f59fb3edc6","observation_id":"d58adf3a-751e-4ef4-a742-0b94c6023999","resolution":{"observed_at":"2026-08-06T17:19:51.591884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.549545Z","title":"Last-iterate convergence: Zero-sum games and constrained min-max opti- mization","venue":null,"work_id":"867ee667-1bb3-4642-8112-66551732221d","year":2019},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.735916Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:f7b6b61d28506d1d6cc77b20a47ad842c78781dd0839d274d8efb6430bfd7a64","observation_id":"506671ef-f635-41e2-a77d-ca11e49efcfd","resolution":{"observed_at":"2026-08-06T17:19:51.580539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:51.231760Z","title":"Near-optimal no-regret algorithms for zero- sum games","venue":null,"work_id":"07178439-098a-4c66-bc45-4d11f2321db3","year":2011},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.793286Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:e1ea3889dbe8f9d020413a282027f395ad78be63f350dea729fe3da8e1ce04da","observation_id":"c7bee0b6-695a-455a-946d-3101da49a1ff","resolution":{"observed_at":"2026-08-06T17:19:51.346499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:50.862406Z","title":"Near-optimal no-regret learning in general games, 2021","venue":null,"work_id":"100fb568-a455-41a3-bcfe-f97393ad6c99","year":2021},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.844257Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:a3dc9828b4d222edcb3daddfb05a824dd83c6bbb84f243a90b73a66591fa6241","observation_id":"364005e3-b9ee-49f3-afec-35c8cd61cd02","resolution":{"observed_at":"2026-08-06T17:19:51.005522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00141","last_updated":"2018-02-13T16:33:55Z","snapshot_observed_at":"2026-08-11T03:46:49.503188Z","submitted_at":"2017-10-31T23:09:08Z","title":"Training GANs with Optimism","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00141","snapshot_observed_at":"2026-08-06T17:19:46.872450Z","title":"Training gans with optimism","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.872450Z"},"links":{"cited_paper":"/paper/1711.00141","citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:642f11ebef8997aa46ae3157aa4063c7bde59ac82b8c1cd4f0e0f87efbdd3fdf","observation_id":"b0b2565e-759f-4980-bb77-3dd13c6a2680","resolution":{"observed_at":"2026-08-06T17:19:46.872450Z","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-06T17:19:50.530165Z","title":"The limit points of (optimistic) gradient descent in min-max optimization","venue":null,"work_id":"a6bb59de-a875-4935-a2e1-a2b382f9fcfb","year":2018},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:46.926030Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:8206e47f547faa54d7bdfc9ed22401e007dbe842c8b7d17dffaa09626a56288d","observation_id":"0b1ecc35-6ff2-41e3-b7c1-9f142a74d66c","resolution":{"observed_at":"2026-08-06T17:19:50.689089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:50.333347Z","title":"Multiagent online learning in time-varying games","venue":null,"work_id":"26f2c240-966a-4c92-bf55-b83947e7778c","year":2023},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.018284Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:837b2c905d8586782a1fe87e0a5d5f981e15aa0773b2d4bd4c6ac923ab88ca36","observation_id":"ead1d7f9-c76d-4095-b6d6-eba9a53360ca","resolution":{"observed_at":"2026-08-06T17:19:50.439230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:50.198675Z","title":"Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems","venue":null,"work_id":"82b725f0-edc6-4c08-9fbc-e19e4d20ef40","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.051229Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:ee5ded1c27da5079d638623e1b714a7e549d1dc6b80238994d1086a816a45a81","observation_id":"f570a8ba-a0a6-4a17-8944-2b91a0281a1f","resolution":{"observed_at":"2026-08-06T17:19:50.245210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:47.131306Z","title":"Generative adversarial nets","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.131306Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:ca80f7bafa0ee0be6e1a9b39b0abfa884eb6aecac0a2dbc98860b6df0a1f0fd1","observation_id":"6645f127-6d23-47ff-9b05-c2cc19496768","resolution":{"observed_at":"2026-08-06T17:19:47.131306Z","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-06T17:19:50.025251Z","title":"Long-time Energy Conservation , page 162–180","venue":null,"work_id":"800e6871-5b5c-4358-86bd-11ac8cfedd65","year":2006},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.222842Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:4c42c9b23605b551da91b11ec799a27a6062415d1e7c9f73b23881a143190ac4","observation_id":"0495d800-737f-4511-ab3d-d315d4001e62","resolution":{"observed_at":"2026-08-06T17:19:50.109586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.872110Z","title":"Precomputed real-time texture synthesis with markovian generative adversarial networks","venue":null,"work_id":"ce799ffc-b161-4397-a65b-b696dcdaa9f0","year":2016},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.279979Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:a22f482aca4a48d90c7f4f7c2ef2a30220095b3163678da2e0aefc6d31c32691","observation_id":"99400669-d420-4303-8db6-d8aac17a005b","resolution":{"observed_at":"2026-08-06T17:19:49.944147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.723368Z","title":"Cycles in adversarial regularized learning","venue":null,"work_id":"9a5966c2-de81-4d1e-9e78-7a86c087ee3f","year":2018},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.337038Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:af60e0f778cfb17c4c1b566cbc4d735ae687b20d1751613c16059dc0a32af3b0","observation_id":"4a9ed950-1d49-4cfd-82d5-3d2de704d554","resolution":{"observed_at":"2026-08-06T17:19:49.774884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.575811Z","title":"Convergence rate of O(1/k) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems","venue":null,"work_id":"07453d5f-a432-4bb4-bdde-54c0cf96a867","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.422426Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:f317c72f9d606d0568c7bb13c03a852a789adaeda580dfff14206e644d66a111","observation_id":"6746570e-ed9b-4d2f-bac5-cd37638eb596","resolution":{"observed_at":"2026-08-06T17:19:49.623111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.433489Z","title":null,"venue":null,"work_id":"f203503c-3699-4e1b-9342-48c49e2aca66","year":2004},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.482866Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:c5180b8550d661778cd884dd1135306aeef80a885c1c151daaad094e0edf352b","observation_id":"69f9a323-eb10-4016-ab21-73f3e9aaafe2","resolution":{"observed_at":"2026-08-06T17:19:49.493390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.335262Z","title":"Excessive gap technique in nonsmooth convex minimization","venue":null,"work_id":"e4cb6f66-a61a-4b3d-9de6-2733fb50527a","year":2005},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.542813Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:95062244c36080f9e6c1073caa69ff877557535c6e0069d1722ba1aad3b432e8","observation_id":"e964fd8b-a804-487d-9270-192cd337d430","resolution":{"observed_at":"2026-08-06T17:19:49.392216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.153400Z","title":"An online mechanism for resource allocation in networks","venue":null,"work_id":"c2aabca2-11d7-42ec-ad27-274b5807f1b7","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.631168Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:f69a1d3e780dc665e33b6ad7075fb938a288f05fc2b75444d0421f2252b39f81","observation_id":"d5ac03a3-1b45-49b4-af02-1480d76c4fff","resolution":{"observed_at":"2026-08-06T17:19:49.248643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:49.010524Z","title":"Twenty lectures on algorithmic game theory","venue":null,"work_id":"ed9c4256-954e-4319-af54-44ed44c07418","year":2016},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.700119Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:ba1922c998c324436a8afc86a31602407538e677c2695fbf916a0892f11f4214","observation_id":"05d9295e-1c36-4839-9ba3-d6bb2123111a","resolution":{"observed_at":"2026-08-06T17:19:49.072788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:48.896309Z","title":"On the Theory of Games of Strategy","venue":null,"work_id":"b044fac8-8ed6-45f8-b801-65c5b59ba3e4","year":1928},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.798009Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:0dee3830b277345a89b308d29b00bfa9305b1e97457b804eead481249fe7be6d","observation_id":"45afa6d2-bcb6-4aa3-8f59-6e5d59dbfebd","resolution":{"observed_at":"2026-08-06T17:19:48.930564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:48.778099Z","title":"Accelerated algorithms for smooth convex-concave minimax problems with o (1/kˆ 2) rate on squared gradient norm","venue":null,"work_id":"3d8afb9e-05ed-4ecb-9881-bdeb3703e944","year":2021},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.852927Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:992f23888b8495e47affbbdc2ab52ed79d1b544fa617290389dee2be9dad5013","observation_id":"69449838-6f2e-4b58-aea9-319b1265bd38","resolution":{"observed_at":"2026-08-06T17:19:48.814968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11430","last_updated":"2020-02-26T12:20:46Z","snapshot_observed_at":"2026-08-11T01:39:17.233310Z","submitted_at":"2020-02-26T12:20:46Z","title":"Deform-GAN:An Unsupervised Learning Model for Deformable Registration","version":1},"cited_work":{"arxiv_id":"2002.11430","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.11430","snapshot_observed_at":"2026-08-06T17:19:48.307765Z","title":"Deform-GAN:An Unsupervised Learning Model for Deformable Registration","venue":"cs.CV","work_id":"28c27acc-1601-48f9-bc66-135c83d12fbb","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:47.945384Z"},"links":{"cited_paper":"/paper/2002.11430","citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:030f50df20b6ad7df87e5f932f8a3134b1e547b075a113299953f443aca73b6a","observation_id":"cbb436bc-a83d-485a-a7fa-5c9046c3e84c","resolution":{"observed_at":"2026-08-06T17:19:48.383213Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11875","last_updated":"2021-04-22T15:04:17Z","snapshot_observed_at":"2026-08-11T01:39:23.409455Z","submitted_at":"2020-05-25T00:58:23Z","title":"Bayesian Conditional GAN for MRI Brain Image Synthesis","version":2},"cited_work":{"arxiv_id":"2005.11875","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.11875","snapshot_observed_at":"2026-08-06T17:19:48.185936Z","title":"Bayesian Conditional GAN for MRI Brain Image Synthesis","venue":"eess.IV","work_id":"97368c49-7868-4704-a05f-efe8197e036e","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:48.034116Z"},"links":{"cited_paper":"/paper/2005.11875","citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:09ddbe66f46c9593440612f92ef83c5f694005f77e64753e7e543c80be7737d7","observation_id":"822f8d48-c61d-4f4b-b6a8-9dba3aebdf36","resolution":{"observed_at":"2026-08-06T17:19:48.230776Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T17:19:48.622008Z","title":"3d high resolution generative deep-learning network for fluorescence microscopy imaging","venue":null,"work_id":"a1f462d0-25da-4881-b068-cd0ccd0a2cb7","year":2020},"citing_paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:48.074078Z"},"links":{"citing_paper":"/paper/2507.11366"},"observation_digest":"sha256:c60df37775328d419d8a0cb3671ce6bd50750592cd9e96e17da4e5e939a0853f","observation_id":"8b4b3802-3916-4cad-ba92-6c40dfb95fb5","resolution":{"observed_at":"2026-08-06T17:19:48.690136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.11366","last_updated":"2026-06-16T16:13:01Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-11T01:38:24.140970Z","submitted_at":"2025-07-15T14:39:40Z","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":27},"total_outbound_references":33},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 1 inbound Pith citation observation for arXiv:2507.11366."}