{"as_of":"2026-08-18T15:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3020fc97a0b40a6e6aa56c29bf17809509e5d45fe8d5d5caaa426ec5db4d6769","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:38:32.978586Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2509.03030/citation-record","integrity":"/paper/2509.03030/integrity","json":"/paper/2509.03030/citation-record.json","paper":"/paper/2509.03030"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:38:32.151991Z","title":"Multi-agent systems: A survey,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.151991Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:a9973d41d06829dec1023532f858852054367195ed1344e78238ec18d966d178","observation_id":"1ec1ba86-a4af-453a-9b15-f214bdfe06fb","resolution":{"observed_at":"2026-08-15T16:38:32.151991Z","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-15T16:38:32.159720Z","title":"Flocking for multi-agent dynamic systems: Algorithms and theory,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.159720Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:4aebfcc029e928124faef54445ebd265bc0ec84db4644543a3c849070ac1038a","observation_id":"987f944a-6e6f-42b5-9754-72f97f215eab","resolution":{"observed_at":"2026-08-15T16:38:32.159720Z","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-15T16:38:35.225982Z","title":"Emergent behavior in flocks,","venue":null,"work_id":"1dc636af-361a-4597-b0c5-74d5dc57d712","year":2007},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.168555Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:49020f93f9c8ee7a657d74ca3ee51907fb8e14d99645851e6b3249ade8a8be2c","observation_id":"233fee0a-9807-4f42-8edc-44b7f5d3a242","resolution":{"observed_at":"2026-08-15T16:38:35.242337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:35.066609Z","title":"Application of multi- agent systems in traffic and transportation,","venue":null,"work_id":"f823cc9d-09db-4fe7-87d7-f548b8c0c69f","year":1997},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.175754Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:492a4d22a01db19f68a48b21d1295191d4f63ca326d7cebf8a3844b9bbc3509b","observation_id":"201cb459-857d-4629-a17e-8f89d242d9d9","resolution":{"observed_at":"2026-08-15T16:38:35.119595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:32.181495Z","title":"A survey on aerial swarm robotics,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.181495Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:a08c5a20a976f6080f22ff91bee636cbfaf349194cdf5472171d33f4d4c8275c","observation_id":"e2cf963e-2a89-4fac-b151-0c44a3bbd298","resolution":{"observed_at":"2026-08-15T16:38:32.181495Z","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-15T16:38:32.189238Z","title":"Multi-agent actor-critic for mixed cooperative-competitive environments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.189238Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:06f2f13d0320f2eda00ba5b36cf28da5fb5ae4ae359732ac10524917f834e801","observation_id":"7f01d84d-06d6-42c9-87cf-e4a8a55aaeff","resolution":{"observed_at":"2026-08-15T16:38:32.189238Z","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-15T16:38:35.011012Z","title":"Monotonic value function factorisation for deep multi-agent reinforcement learning,","venue":null,"work_id":"66c93564-7543-46b9-855b-39eb1a175268","year":2020},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.197478Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:671fe903e21c2a9a88b85d268358697cdfb098c7f49ec1c6c5250c73a113bfea","observation_id":"435b6328-e272-48ba-8c0a-eb172e5bdd3d","resolution":{"observed_at":"2026-08-15T16:38:35.017498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.919386Z","title":"Mean field games,","venue":null,"work_id":"62124912-7a16-4db5-9a19-5fee4089c3c3","year":2007},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.204604Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:9f4a0f7f3d7df318b68ca55af8f13c2495dc4c195d4f851598ed9010bfe99e5f","observation_id":"1f7f8a3d-14ab-4631-a123-b7fd7f0cf084","resolution":{"observed_at":"2026-08-15T16:38:34.996585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.788945Z","title":"Large-population cost- coupled lqg problems with nonuniform agents: individual-mass behavior and decentralized ε-nash equilibria,","venue":null,"work_id":"ee72e253-c91b-4f6e-a9c9-5413ccf7b351","year":2007},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.221714Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:9180229b833bc79cfd3768823a7911f6464f95a5963d0bb77815185241b1346a","observation_id":"c11c0ba5-90de-46c7-a7c2-5ad5e42e0fc3","resolution":{"observed_at":"2026-08-15T16:38:34.827610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.765757Z","title":"Carmona and F","venue":null,"work_id":"d94ff66e-80b8-48ee-ad11-8444851cba49","year":2018},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.264039Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:94443b6db5a466631626e78764f2e81e0f559729195dd09721d62c8760a1b443","observation_id":"3a95b0ab-6eb1-4deb-b741-268013389a21","resolution":{"observed_at":"2026-08-15T16:38:34.771857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.742756Z","title":"Bensoussan, J","venue":null,"work_id":"cc9a230f-8420-4c0a-8aab-adc9d89f5be4","year":2013},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.346874Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:e9d1209b1650587c212d090b256c5914cff111dccb4e5c61b1eb119167f1fdff","observation_id":"4dfbe4e6-cc04-462c-9779-4908e7ab291f","resolution":{"observed_at":"2026-08-15T16:38:34.748046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.647890Z","title":"Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning,","venue":null,"work_id":"71644b95-8a77-4c9e-9b87-a55ffd6977b1","year":2019},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.360299Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:ec29b804c9e03000e0ae54d44b65d1aa718ac7a219db1a9be206f3abb93c2f77","observation_id":"310eaab3-d30c-407e-8ea9-86e368b581f3","resolution":{"observed_at":"2026-08-15T16:38:34.724328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.418064Z","title":"Learning mean-field games,","venue":null,"work_id":"06a7ea60-37f2-4725-b9b3-e636c97e0792","year":2019},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.369565Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:1b62a92805d92502e274957ee32ef73ccd48558e8ba16f38a22c2a74e01122ea","observation_id":"9f9102a1-6dec-4340-8951-e489c2bc7bd6","resolution":{"observed_at":"2026-08-15T16:38:34.523785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.355781Z","title":"Approximately solving mean field games via entropy-regularized deep reinforcement learning,","venue":null,"work_id":"c2b2249d-5bda-4139-b8f6-63c0484739b4","year":1909},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.377454Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:dbe7f697c918754de2c51c9098c686155e108296ef267cb918157703ef4e0904","observation_id":"d400de0e-eee9-46fe-b81a-2bbc2f7cfe63","resolution":{"observed_at":"2026-08-15T16:38:34.362940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.330769Z","title":"Q-learning in regularized mean-field games,","venue":null,"work_id":"0850c38d-b353-454d-83c0-bfd852112045","year":2023},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.383762Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:98d7edff081ed25372d06ce62c1bd329b7041e4d0a109eef6530759a4b4b1002","observation_id":"e9e27898-0cf2-4f0d-8452-2c8a775d3c72","resolution":{"observed_at":"2026-08-15T16:38:34.342630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:32.392991Z","title":"Iterative solution of games by fictitious play,","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.392991Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:fc2399bfda62a9a532156e12ddd8a0e862c03159ff80ab5a3ae194d0fb91b11e","observation_id":"00ad712a-4880-4d58-8011-52b86aa777f3","resolution":{"observed_at":"2026-08-15T16:38:32.392991Z","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-15T16:38:34.283450Z","title":"Brown’s original fictitious play,","venue":null,"work_id":"a003e9d4-c423-41a6-b035-a577f0f6ae62","year":2007},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.399447Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:00005d97e80fbbb0ffee680dd3672e4fafe03da487228a3cc571c0968eb2ae2a","observation_id":"529ac6f3-403b-4a88-8cf3-e016c3735c71","resolution":{"observed_at":"2026-08-15T16:38:34.292562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.258025Z","title":"Learning in mean field games: the fictitious play,","venue":null,"work_id":"7152f5ba-1956-4ae9-a2d5-3696c031ae1c","year":2017},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.410597Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:e746d65b95754b5896db023f3bf4856315f059bb3d2ff9e29ef0c75cbb49266f","observation_id":"3c334c90-7280-4629-9e0b-2e0f908a661d","resolution":{"observed_at":"2026-08-15T16:38:34.263429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.236236Z","title":"Finite mean field games: fictitious play and convergence to a first order continuous mean field game,","venue":null,"work_id":"26a6a694-d562-43a9-8171-215082bb6ebe","year":2019},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.418967Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:5cac05d4144887a47dee93d0f330b8b7498ff6bca4a7e6901ac9f7d8f90bc97a","observation_id":"622090f4-49c9-456b-82d8-033d6cb142ae","resolution":{"observed_at":"2026-08-15T16:38:34.242354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:34.166774Z","title":"Fictitious play for mean field games: Continuous time analysis and applications,","venue":null,"work_id":"d696183a-a6d3-4812-88b3-67f9a93e5187","year":2020},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.446963Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:2c25462124e3c85f4b1526ed477e1773841f2f98483449bd68ab174dc80363e9","observation_id":"e278b5f9-d856-46b0-993e-39eecd09f08e","resolution":{"observed_at":"2026-08-15T16:38:34.224238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.971471Z","title":"Scalable deep rein- forcement learning algorithms for mean field games,","venue":null,"work_id":"b7ef682a-3e5e-44a1-980e-743c8a8257de","year":2022},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.485702Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:0f9af0339f256f50b7ada6233f04586cfe0d21f88043b14581a41699858ae0ab","observation_id":"598eb8ae-f40c-4c95-a373-923bc753bdb0","resolution":{"observed_at":"2026-08-15T16:38:34.030546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00378","last_updated":"2017-04-02T22:31:29Z","snapshot_observed_at":"2026-08-14T21:08:41.285320Z","submitted_at":"2017-04-02T22:31:29Z","title":"Learning in anonymous nonatomic games with applications to first-order mean field games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.00378","snapshot_observed_at":"2026-08-15T16:38:32.556930Z","title":"Learning in anonymous nonatomic games with applications to first-order mean field games,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.556930Z"},"links":{"cited_paper":"/paper/1704.00378","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:e11b0cf11474679330217665cc76ba07e9f71e32c3a8c87e47ac53bf686c6faa","observation_id":"78691f11-f9f9-4b3d-8986-1af9b608b9a0","resolution":{"observed_at":"2026-08-15T16:38:32.556930Z","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-15T16:38:33.951304Z","title":"Hadikhanloo, Learning in mean field games","venue":null,"work_id":"fd7a90bf-7b68-425a-881c-654f6657a1c8","year":2018},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.586427Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:98c48c497e3b637b040a28685882b99c013f81bf15e8c338e5700ae4d43e21eb","observation_id":"9f29739b-88eb-4af8-9a1d-29de427dc6ca","resolution":{"observed_at":"2026-08-15T16:38:33.957302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.931361Z","title":"Scaling mean field games by online mirror descent,","venue":null,"work_id":"ee65c115-91e7-4807-a384-4f0d9d49a727","year":2022},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.592094Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:bca5965ed78b103e872f5836c44d99579c0d392fd0967466b06caa9c60e5bc64","observation_id":"e4148aeb-8995-4d98-92cc-d359609e938e","resolution":{"observed_at":"2026-08-15T16:38:33.937416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.911237Z","title":"Munchausen reinforcement learning,","venue":null,"work_id":"75cded81-6be8-4a65-9c10-674861fb667b","year":2020},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.602709Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:5cb78ce75d86be795b2bad040e04a3c25a6b3f2e54446bb3ac9496f3cd961498","observation_id":"9280284e-de17-4273-a538-30c0eb1b95f2","resolution":{"observed_at":"2026-08-15T16:38:33.917767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12944","last_updated":"2024-07-26T18:20:46Z","snapshot_observed_at":"2026-08-18T06:35:12.036493Z","submitted_at":"2022-05-25T17:49:37Z","title":"Learning in Mean Field Games: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12944","snapshot_observed_at":"2026-08-15T16:38:32.608330Z","title":"Learning in mean field games: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.608330Z"},"links":{"cited_paper":"/paper/2205.12944","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:b92070ce4973651ace415259b2aafb8769ae45120a9550ed474d4f726cf114cf","observation_id":"8b5f7984-5bc2-4ce7-9e5a-ca6645728216","resolution":{"observed_at":"2026-08-15T16:38:32.608330Z","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-15T16:38:33.867515Z","title":"Cardaliaguet, F","venue":null,"work_id":"67597472-cdb1-4058-8938-53757a148084","year":2019},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.615223Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:f5c4603c1d7cda089b3e65defd08c3fe196188b08b2cc8968529977e57ea45b1","observation_id":"29a3d99e-8b22-496b-90c5-d934a7bf4674","resolution":{"observed_at":"2026-08-15T16:38:33.896058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.751578Z","title":"Generalization in mean field games by learning master policies,","venue":null,"work_id":"6446d5bd-9e65-4b9e-8026-e8ae593e0ed9","year":2022},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.621625Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:19d90e17e0743d822f52867a6ac24ca1b5b6ed8ccdbba65b23c2c34c110c61e3","observation_id":"aa717685-7522-4400-b16e-9317d325ada3","resolution":{"observed_at":"2026-08-15T16:38:33.807336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03552","last_updated":"2024-03-06T08:55:34Z","snapshot_observed_at":"2026-08-16T18:37:39.431657Z","submitted_at":"2024-03-06T08:55:34Z","title":"Population-aware Online Mirror Descent for Mean-Field Games by Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03552","snapshot_observed_at":"2026-08-15T16:38:32.628743Z","title":"Population-aware online mirror descent for mean-field games by deep reinforcement learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.628743Z"},"links":{"cited_paper":"/paper/2403.03552","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:2943d4f9352f4c967013bf0235f7349214667f131896f541f654aaeec6225c1e","observation_id":"c9151804-421f-4a6f-8d98-d4acac624266","resolution":{"observed_at":"2026-08-15T16:38:32.628743Z","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-15T16:38:33.690412Z","title":"Computing approximate equilibria in sequential adversarial games by exploitability descent,","venue":null,"work_id":"1c21baf3-e80f-4a98-b18a-58638bcd7a5f","year":2019},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.725535Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:474f63ee3abd593a3f4e402d83e5a68a23815bccbd729d4dee61936ba8eb5fdd","observation_id":"218abebd-1d25-47ef-a164-5c22edcbed13","resolution":{"observed_at":"2026-08-15T16:38:33.696371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.667865Z","title":"Leverage the average: an analysis of kl regularization in reinforcement learning,","venue":null,"work_id":"9485cb82-98f7-4a68-af32-1398f45199b3","year":2020},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.831021Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:a5c6c293dda38bb9db12b6eeac514f0d1c9d499978d1bd9445350cc6ff351488","observation_id":"a4aa5809-99f9-4186-9fa5-da09ef358077","resolution":{"observed_at":"2026-08-15T16:38:33.675325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.639937Z","title":"Human-level control through deep reinforcement learning,","venue":null,"work_id":"024c04ee-8718-4d1e-b82d-256d9553b368","year":2015},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.902672Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:c64e77db8c8f0920afe1f59373c40e54352d805f601db74d4ec087c1938c5a3b","observation_id":"1a685fed-3b6f-411f-8cdf-6d1271ba6704","resolution":{"observed_at":"2026-08-15T16:38:33.648931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-08-15T17:33:32.559096Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-15T16:38:32.930299Z","title":"Prioritized experience replay,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.930299Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:e295765613cfb748f7e0f0f8cd4d962dfa3f11184b76b63064fe46c52841e7f6","observation_id":"412a88bf-3e9c-4c31-b144-30b849934a8b","resolution":{"observed_at":"2026-08-15T16:38:32.930299Z","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-15T16:38:33.614027Z","title":"Overcoming catastrophic forgetting in neural networks,","venue":null,"work_id":"32a089ad-189b-412f-9882-3424493e6c2a","year":2017},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.937814Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:a57ff68a9dfdd03bec86de70cfd7bde511c39d9e7182c5fdfc720d3988a4a579","observation_id":"759c6b9b-f900-4013-bbad-cd036e62c8c6","resolution":{"observed_at":"2026-08-15T16:38:33.622270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.456034Z","title":"Mean field games with common noise,","venue":null,"work_id":"b8c7606a-0fc1-4c9c-b7af-d03e79195eda","year":2016},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.944427Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:1a1129a7bbe6e3e3bcea5671ceaea0d5b77d970a42f74d6dec155c7269bbc580","observation_id":"88100299-774f-47ab-93f8-50a15718cdaf","resolution":{"observed_at":"2026-08-15T16:38:33.521700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07920","last_updated":"2021-02-16T02:16:54Z","snapshot_observed_at":"2026-08-17T17:11:06.140779Z","submitted_at":"2021-02-16T02:16:54Z","title":"Training Larger Networks for Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07920","snapshot_observed_at":"2026-08-15T16:38:32.950750Z","title":"Training larger networks for deep reinforcement learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.950750Z"},"links":{"cited_paper":"/paper/2102.07920","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:99fc30d3a13a0cb8d290de4e4fc5624ae680f48041d4be7d9fffb4337e3d0176","observation_id":"bb4c30b8-c5e7-4989-9635-bf16f2ea5a52","resolution":{"observed_at":"2026-08-15T16:38:32.950750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03787","last_updated":"2022-02-16T10:01:00Z","snapshot_observed_at":"2026-08-16T18:19:00.574893Z","submitted_at":"2021-06-07T16:51:07Z","title":"Concave Utility Reinforcement Learning: the Mean-Field Game Viewpoint","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.03787","snapshot_observed_at":"2026-08-15T16:38:32.956706Z","title":"Concave utility reinforcement learning: the mean-field game viewpoint,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.956706Z"},"links":{"cited_paper":"/paper/2106.03787","citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:7e1402c1c279c6032d89a97db6338f40e317c9d6b5acd9b016ade2b9ed68acce","observation_id":"93a6989a-cec1-4ee2-92da-d8e40595e8b5","resolution":{"observed_at":"2026-08-15T16:38:32.956706Z","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-15T16:38:33.431303Z","title":"Control of McKean– Vlasov dynamics versus mean field games,","venue":null,"work_id":"d4096ae2-2e83-479a-8c12-679dab49ca32","year":2013},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.963306Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:c37c535c3d394e90b346d48166eff9293aee9efecb2e5f7cfc1620fbde35377e","observation_id":"84fc1f63-73ea-4269-96d0-fad270f257e1","resolution":{"observed_at":"2026-08-15T16:38:33.438056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.374335Z","title":"Linear- quadratic mean field games,","venue":null,"work_id":"6f96c8fa-c720-4088-9f88-3ddf80fc2d7f","year":2016},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.970725Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:1872b77d3e63b67cd8b8dc109c682228449b8edd9b483d7d7b3834d073cac9d2","observation_id":"7e53002c-cff0-401b-8747-ab404dde84a0","resolution":{"observed_at":"2026-08-15T16:38:33.417416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:38:33.254246Z","title":"This set comprises 10 distributions originating from fixed points, 10 following Gaussian distributions, and 10 distributed across random points","venue":null,"work_id":"a02cea07-d4a8-4e07-946d-87eedfee2cfb","year":null},"citing_paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T16:38:32.978586Z"},"links":{"citing_paper":"/paper/2509.03030"},"observation_digest":"sha256:eeeaa32e265ee23a4aedaab8a55d6cda907e71962284782ad38d3a19e879a55f","observation_id":"2cff5988-d999-40f8-985e-5f210bce5c86","resolution":{"observed_at":"2026-08-15T16:38:33.295749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.03030","last_updated":"2025-09-03T05:33:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T17:12:12.553470Z","submitted_at":"2025-09-03T05:33:46Z","title":"Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":40},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2509.03030."}