{"as_of":"2026-08-12T18:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:43a80ce1f6dc869ce762d8e77cd587ddc22ae608836871b0f94553d79071d8e6","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:00:57.614294Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T09:34:16.945669Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","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":"2110.04184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently ?","venue":null,"work_id":"e5a1964c-f875-4362-b665-d00f1b11414c","year":2021},"citing_paper":{"arxiv_id":"2303.05307","last_updated":"2026-05-09T20:38:00Z","snapshot_observed_at":"2026-07-06T15:00:39.910973Z","submitted_at":"2023-03-09T14:57:15Z","title":"Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-24T09:31:48.298810Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2303.05307"},"observation_digest":"sha256:9d08950fcdd6ef9ae4b25c6b6d37e165fb6f4552014da6e477479da92a47c17a","observation_id":"e8c3dcc4-92e0-40fa-9a79-be50fab55608","resolution":{"observed_at":"2026-05-24T09:34:16.948297Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T13:45:53.505063Z","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-12T05:00:57.614294Z","title":"When can we learn general-sum Markov games with a large number of players sample-efficiently? arXiv preprint arXiv:2110.04184, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00985","last_updated":"2025-02-20T21:41:07Z","snapshot_observed_at":"2026-08-12T16:00:42.754639Z","submitted_at":"2024-12-01T22:26:27Z","title":"Provable Partially Observable Reinforcement Learning with Privileged Information","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T05:00:57.614294Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2412.00985"},"observation_digest":"sha256:06649b25664cb66c225c43483fa581a8e26010fe9501b87e5ffa304f1fd160b2","observation_id":"4df6750a-8ad8-4153-98ff-fc5ce1da62c0","resolution":{"observed_at":"2026-08-12T05:00:57.614294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","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-10T23:53:11.923237Z","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:c3189193dff684cbc4f86720e42d97ed0def1efa7da038e39d3ff3fd026a82a6","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":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","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-07T20:38:32.895105Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09780","last_updated":"2025-02-13T21:28:51Z","snapshot_observed_at":"2026-08-09T11:53:25.646352Z","submitted_at":"2025-02-13T21:28:51Z","title":"Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T20:38:32.895105Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2502.09780"},"observation_digest":"sha256:54068c9d462beb9c93fc78a6060e1f59c8055027995940e0eb6a61e4ab76703e","observation_id":"7192e4ea-b008-49b5-b477-c802699f76bf","resolution":{"observed_at":"2026-08-07T20:38:32.895105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","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-06T23:55:55.667677Z","title":"When can we learn general-sum markov games with a large number of players sample-efficiently? arXiv preprint arXiv:2110.04184, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":109,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.667677Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ffc3bef90b77a331a501ff9ae930e8e41909cc544927265c09aac01131be1526","observation_id":"9fed3e9f-c937-4f07-b473-bc9380fc8aac","resolution":{"observed_at":"2026-08-06T23:55:55.667677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04184","last_updated":"2022-03-31T12:12:43Z","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","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":"2110.04184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently ?","venue":null,"work_id":"e5a1964c-f875-4362-b665-d00f1b11414c","year":2021},"citing_paper":{"arxiv_id":"2603.28281","last_updated":"2026-04-09T09:10:22Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T11:03:36Z","title":"Corruption-robust Offline Multi-agent Reinforcement Learning From Human Feedback","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-14T21:03:48.813600Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2603.28281"},"observation_digest":"sha256:2c4a839945ad9a999042e05181785258a61bf70454a30767822890405eddf1e7","observation_id":"d00149d9-cf56-4d0d-94d6-dd1622a928da","resolution":{"observed_at":"2026-05-14T21:19:29.020075Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T13:45:53.505063Z","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":"2110.04184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently ?","venue":null,"work_id":"e5a1964c-f875-4362-b665-d00f1b11414c","year":2021},"citing_paper":{"arxiv_id":"2604.04394","last_updated":"2026-04-06T03:48:42Z","snapshot_observed_at":"2026-08-11T11:17:56.156735Z","submitted_at":"2026-04-06T03:48:42Z","title":"Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T19:49:31.844061Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2604.04394"},"observation_digest":"sha256:c9b0374649f8e7c332b1530584cb404e588c2dab3e4ed5ba04e6208d0c5ccb86","observation_id":"9db4e1d0-8d1c-448f-abbc-2afdf638af36","resolution":{"observed_at":"2026-05-10T22:30:50.058377Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T13:45:53.505063Z","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":"2110.04184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently ?","venue":null,"work_id":"e5a1964c-f875-4362-b665-d00f1b11414c","year":2021},"citing_paper":{"arxiv_id":"2605.03125","last_updated":"2026-05-06T22:03:28Z","snapshot_observed_at":"2026-08-04T04:13:10.377270Z","submitted_at":"2026-05-04T20:04:52Z","title":"Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T19:13:15.234351Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2605.03125"},"observation_digest":"sha256:832011605b1ed116ef81380a710630e72d4fb1b33a93f5b0b8a2087bc692ced9","observation_id":"02aa6b85-a6f5-4dd6-9a0a-cf8a1a2f725d","resolution":{"observed_at":"2026-05-09T06:00:35.889817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T13:45:53.505063Z","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":"2110.04184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently ?","venue":null,"work_id":"e5a1964c-f875-4362-b665-d00f1b11414c","year":2021},"citing_paper":{"arxiv_id":"2605.17189","last_updated":"2026-06-09T02:46:33Z","snapshot_observed_at":"2026-08-02T14:26:15.767422Z","submitted_at":"2026-05-16T23:10:10Z","title":"Sample-efficient inductive matrix completion with noise and inexact side-information","version":1},"reference_index":157,"source":"arxiv_source","source_observed_at":"2026-05-20T14:04:44.364824Z"},"links":{"cited_paper":"/paper/2110.04184","citing_paper":"/paper/2605.17189"},"observation_digest":"sha256:4ecd2a624f974431694350d58b22c70e253a91e3c8c5fe2f924fefae3f13977a","observation_id":"1d065284-5fc6-4f8e-b578-a41cf3fee67c","resolution":{"observed_at":"2026-05-20T14:08:21.102090Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.04184/citation-record","integrity":"/paper/2110.04184/integrity","json":"/paper/2110.04184/citation-record.json","paper":"/paper/2110.04184"},"outbound":[],"paper":{"arxiv_id":"2110.04184","last_updated":"2022-03-31T12:12:43Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T13:45:53.505063Z","submitted_at":"2021-10-08T15:06:22Z","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2110.04184."}