{"as_of":"2026-08-17T17:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea98af25fb851018bf0d5a76c7e01de9a5d37b53c0ee0a400c98e27b8db6e9ad","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:10:22.389652Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-08-15T20:45:55.267200Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T20:45:56.341587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2412.19873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.19873","snapshot_observed_at":"2026-08-15T20:45:56.341587Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","venue":"cs.LG","work_id":"a9315254-6d5e-4da3-8dfd-5c0825e4ca21","year":2024},"citing_paper":{"arxiv_id":"2505.12462","last_updated":"2026-06-21T21:20:26Z","snapshot_observed_at":"2026-08-15T20:31:09.031623Z","submitted_at":"2025-05-18T15:34:45Z","title":"Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.267200Z"},"links":{"cited_paper":"/paper/2412.19873","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:24a6a79023c31f1dd5e7cf1260510b20e6392643984ad88a1e95d5fedc49417f","observation_id":"4957033f-4b06-4e80-8eec-b8f1f563a3f2","resolution":{"observed_at":"2026-08-15T20:45:56.347346Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2412.19873/citation-record","integrity":"/paper/2412.19873/integrity","json":"/paper/2412.19873/citation-record.json","paper":"/paper/2412.19873"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.10458","last_updated":"2022-10-12T14:25:27Z","snapshot_observed_at":"2026-08-17T08:30:32.670740Z","submitted_at":"2022-08-22T17:24:55Z","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.10458","snapshot_observed_at":"2026-08-11T00:10:22.356655Z","title":"Minimax-opti mal multi-agent rl in markov games with a generative model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.356655Z"},"links":{"cited_paper":"/paper/2208.10458","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:4594a322d855cf8ab05a8251c2003c4e8d94c65fbce86645b49101827a3d2526","observation_id":"915506fb-b58e-4222-b634-75fc90fcb3ae","resolution":{"observed_at":"2026-08-11T00:10:22.356655Z","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-11T00:10:22.653781Z","title":"Markov games as a framework for multi-age nt reinforcement learning","venue":null,"work_id":"44ae49b4-0fdb-4c62-a60d-3b238c2ffc8a","year":1994},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.361057Z"},"links":{"citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:4a939014011289b231daa46dd5681afa7b27c609a7f511f4985d617f3889de74","observation_id":"0f938e5a-86e0-4651-8374-64b4a7743f45","resolution":{"observed_at":"2026-08-11T00:10:22.658431Z","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":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-16T17:50:49.764970Z","submitted_at":"2021-10-08T15:06:22Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-08-11T00:10:22.369597Z","title":"When can we learn general-su m markov games with a large number of players sample-efficiently? arXiv preprint arXiv:2110.04184 ,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.369597Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:320b883afa703ac1ff6a680d5217186373ffa94c4ae1a353eee576eb30868f31","observation_id":"d2895eaa-edec-4d2a-8aaa-4105d8e89c17","resolution":{"observed_at":"2026-08-11T00:10:22.369597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01248","last_updated":"2023-09-12T16:20:15Z","snapshot_observed_at":"2026-08-16T15:58:08.436458Z","submitted_at":"2023-02-02T17:29:10Z","title":"Robust Markov Decision Processes without Model Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01248","snapshot_observed_at":"2026-08-11T00:10:22.378171Z","title":"Robust markov decision processes without model estimation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.378171Z"},"links":{"cited_paper":"/paper/2302.01248","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:ad2ba6b5133f27a20969d180404c32001633b2fb73394d86ad38ecc9612da5fc","observation_id":"5fc7b9a9-a76c-4ba5-823f-38be90703761","resolution":{"observed_at":"2026-08-11T00:10:22.378171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12430","last_updated":"2023-02-09T05:38:03Z","snapshot_observed_at":"2026-08-16T16:29:59.225933Z","submitted_at":"2022-09-26T05:35:44Z","title":"$O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12430","snapshot_observed_at":"2026-08-11T00:10:22.381901Z","title":"o(t−1) convergence of optimistic-follow-the-regularized-lead er in two-player zero-sum markov games","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.381901Z"},"links":{"cited_paper":"/paper/2209.12430","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:4ff4f162e6fd3ab6947e86da50ce6b5c007529fc7dbfe109b497711ec90705df","observation_id":"b3ce7b97-a151-420a-ba97-31cf6157b70f","resolution":{"observed_at":"2026-08-11T00:10:22.381901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.04724","last_updated":"2021-11-08T18:59:04Z","snapshot_observed_at":"2026-08-16T17:43:11.179758Z","submitted_at":"2021-11-08T18:59:04Z","title":"SustainBench: Benchmarks for Monitoring the Sustainable Development Goals with Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.04724","snapshot_observed_at":"2026-08-11T00:10:22.386033Z","title":"Sustainbench: Ben chmarks for monitoring the sustainable development goals with machine learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.386033Z"},"links":{"cited_paper":"/paper/2111.04724","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:5c745474f6c3de40f00ad8e3d6f12028dda424f8abee73589aca8de150eb6dcf","observation_id":"f2a7760c-9654-4f32-9bd4-e2096752ddfa","resolution":{"observed_at":"2026-08-11T00:10:22.386033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09776","last_updated":"2020-11-01T01:32:36Z","snapshot_observed_at":"2026-08-16T19:12:19.861633Z","submitted_at":"2020-10-19T18:26:10Z","title":"SMARTS: Scalable Multi-Agent Reinforcement Learning Training School for Autonomous Driving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.09776","snapshot_observed_at":"2026-08-11T00:10:22.389652Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.389652Z"},"links":{"cited_paper":"/paper/2010.09776","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:f5406c8df1413c6e94ff68613146243c00b80968cb090ba93cff4a463b4ec122","observation_id":"6ebef0ff-5a5c-4bd3-8399-964dae04b62f","resolution":{"observed_at":"2026-08-11T00:10:22.389652Z","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":"10.1002/j.1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:10:22.630017Z","title":"URL https://onlinelibrary.wiley.com/doi/abs/10.1002/j.1538-7305.1952.tb01393.x","venue":null,"work_id":"d66824dd-c9a6-4739-9ef9-19e69493f06d","year":1952},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":1952,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.325880Z"},"links":{"citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:ea7c66367b6e6872bd17653d561d0264e538a342f92b13df5148353acf75a4e6","observation_id":"addabe88-3258-4706-b570-cb1396784e6a","resolution":{"observed_at":"2026-08-11T00:10:22.635176Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"2409.20067","last_updated":"2025-01-31T10:02:45Z","snapshot_observed_at":"2026-08-16T13:14:13.695639Z","submitted_at":"2024-09-30T08:09:41Z","title":"Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.20067","snapshot_observed_at":"2026-08-11T00:10:22.365457Z","title":"Breaking the curse of multiagency in robust multi-agent reinforcement learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":1953,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.365457Z"},"links":{"cited_paper":"/paper/2409.20067","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:d108c58330cfc59bd850ad3cefd44f3b2332f4af7e4751d6bb815d4cd8a30c85","observation_id":"39163fcf-0cbe-496c-a08c-d6efa405b086","resolution":{"observed_at":"2026-08-11T00:10:22.365457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09453","last_updated":"2020-09-26T11:49:05Z","snapshot_observed_at":"2026-08-16T12:59:48.696588Z","submitted_at":"2019-08-26T03:31:35Z","title":"OpenSpiel: A Framework for Reinforcement Learning in Games","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09453","snapshot_observed_at":"2026-08-11T00:10:22.352248Z","title":"Openspiel: A framework for reinforcement learning in games","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.352248Z"},"links":{"cited_paper":"/paper/1908.09453","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:f6dcb17e9f5c8880568f3ee0c332b3515d71826b44d1c0b33f2dc0a17423332a","observation_id":"02150360-0090-4cf1-981c-c15e25cc39c5","resolution":{"observed_at":"2026-08-11T00:10:22.352248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00423","last_updated":"2019-06-02T15:24:19Z","snapshot_observed_at":"2026-08-14T16:22:20.603665Z","submitted_at":"2019-06-02T15:24:19Z","title":"Feature-Based Q-Learning for Two-Player Stochastic Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00423","snapshot_observed_at":"2026-08-11T00:10:22.338397Z","title":"Feature-based q-learn ing for two-player stochastic games","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.338397Z"},"links":{"cited_paper":"/paper/1906.00423","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:d3485f303971008e49232723d4540879d92a80403b0ecbb3011dffc46c56561d","observation_id":"4ea42e5f-01e7-4d3b-8e87-e50599d88246","resolution":{"observed_at":"2026-08-11T00:10:22.338397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04044","last_updated":"2024-02-26T15:18:31Z","snapshot_observed_at":"2026-08-16T16:54:23.654640Z","submitted_at":"2022-06-08T17:58:06Z","title":"Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04044","snapshot_observed_at":"2026-08-11T00:10:22.373621Z","title":"Model-base d reinforcement learning is minimax-optimal for offline zero-sum markov games","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.373621Z"},"links":{"cited_paper":"/paper/2206.04044","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:352699b714010201406f1261b963c6e1f9150182adbdd8c12269a9e453b0a3c8","observation_id":"ddeba19e-c782-45bc-ad07-ea24804a82ec","resolution":{"observed_at":"2026-08-11T00:10:22.373621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14555","last_updated":"2021-10-27T16:25:55Z","snapshot_observed_at":"2026-08-16T17:46:01.331436Z","submitted_at":"2021-10-27T16:25:55Z","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14555","snapshot_observed_at":"2026-08-11T00:10:22.343287Z","title":"V-lear ning–a simple, efficient, decentralized algorithm for multiagent rl","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.343287Z"},"links":{"cited_paper":"/paper/2110.14555","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:092ac0831829c58f5fc7a8e928410649985c81945be71971c3fbcc9bd0967735","observation_id":"68fb79ea-9549-4541-8865-d5c546ea554d","resolution":{"observed_at":"2026-08-11T00:10:22.343287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01562","last_updated":"2019-11-05T01:40:42Z","snapshot_observed_at":"2026-08-14T02:09:49.454145Z","submitted_at":"2019-11-05T01:40:42Z","title":"DeepRacer: Educational Autonomous Racing Platform for Experimentation with Sim2Real Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.01562","snapshot_observed_at":"2026-08-11T00:10:22.321172Z","title":"Deepracer: Educa tional autonomous racing platform for experimentation with sim2real reinforcement learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.321172Z"},"links":{"cited_paper":"/paper/1911.01562","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:84fd5ad32d107bf045fa93c19c76d829280c6a8b5d5baacc829ceb5ca3b3a6c9","observation_id":"3cbd4675-0fb1-45e1-942f-2c23bf85c093","resolution":{"observed_at":"2026-08-11T00:10:22.321172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10062","last_updated":"2024-03-23T03:50:18Z","snapshot_observed_at":"2026-08-16T14:59:41.217277Z","submitted_at":"2023-09-18T18:17:56Z","title":"SMART-LLM: Smart Multi-Agent Robot Task Planning using Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10062","snapshot_observed_at":"2026-08-11T00:10:22.347791Z","title":"Smart-llm: Smart multi-agent robot task planning using large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.347791Z"},"links":{"cited_paper":"/paper/2309.10062","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:34c11ca11a05d0fa01d7eb35112c0cea435a37954c898c11f305f894f5336494","observation_id":"573bbe92-7adc-4381-a30f-f0deaafe9f67","resolution":{"observed_at":"2026-08-11T00:10:22.347791Z","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-11T00:10:22.665918Z","title":"Fast bell man updates for robust mdps","venue":null,"work_id":"ee253493-6382-401e-b10d-499ba3aabc55","year":1979},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.333835Z"},"links":{"citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:d62f0ebcbf780324025eb540f43c57fa17b4f84cc08054475f0d77226f0feedc","observation_id":"72b44bf1-66ce-4e3c-8873-a7c3b9a4e011","resolution":{"observed_at":"2026-08-11T00:10:22.669527Z","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":"2212.02705","last_updated":"2024-04-12T17:58:52Z","snapshot_observed_at":"2026-08-16T16:10:45.732792Z","submitted_at":"2022-12-06T01:57:33Z","title":"What is the Solution for State-Adversarial Multi-Agent Reinforcement Learning?","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.02705","snapshot_observed_at":"2026-08-11T00:10:22.329513Z","title":"What is the solution for state-adversarial multi-agent reinforcemen t learning? arXiv preprint arXiv:2212.02705 ,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.329513Z"},"links":{"cited_paper":"/paper/2212.02705","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:f9a2b40f0b5149b8d7a7a29ac0353721342571c44995628a6263e428e3f24418","observation_id":"352ad0fb-5974-488d-9a31-d218b7db4354","resolution":{"observed_at":"2026-08-11T00:10:22.329513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":17},"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 17 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2412.19873."}