{"as_of":"2026-08-14T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17a9f45c2041a33761391ad6b8d4ab6b2b521739aa898dbe94569c49715bf702","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:42:08.075493Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T22:39:42.446147Z","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-20T22:43:51.665870Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"cited_work":{"arxiv_id":"2602.22810","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22810","snapshot_observed_at":"2026-06-24T02:14:24.653602Z","title":"Multi-agent imitation learning with function approximation: Linear markov games and beyond","venue":null,"work_id":"b3138835-3a37-4c29-97a7-ab577dda34a2","year":2026},"citing_paper":{"arxiv_id":"2605.12000","last_updated":"2026-05-18T14:32:07Z","snapshot_observed_at":"2026-08-09T15:04:21.872619Z","submitted_at":"2026-05-12T11:49:08Z","title":"Split the Differences, Pool the Rest: Provably Efficient Multi-Objective Imitation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-13T07:17:21.543713Z"},"links":{"cited_paper":"/paper/2602.22810","citing_paper":"/paper/2605.12000"},"observation_digest":"sha256:0882c8573901c10ad004c3c482322ab6f26176ea837de2573cee7e05336e3358","observation_id":"f6181ae6-7416-488e-a7c0-59ea445f0b76","resolution":{"observed_at":"2026-06-24T02:14:24.653602Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"cited_work":{"arxiv_id":"2602.22810","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22810","snapshot_observed_at":"2026-06-24T02:14:24.653602Z","title":"Multi-agent imitation learning with function approximation: Linear markov games and beyond","venue":null,"work_id":"b3138835-3a37-4c29-97a7-ab577dda34a2","year":2026},"citing_paper":{"arxiv_id":"2605.12000","last_updated":"2026-05-18T14:32:07Z","snapshot_observed_at":"2026-08-09T15:04:21.872619Z","submitted_at":"2026-05-12T11:49:08Z","title":"Split the Differences, Pool the Rest: Provably Efficient Multi-Objective Imitation","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-20T22:39:42.446147Z"},"links":{"cited_paper":"/paper/2602.22810","citing_paper":"/paper/2605.12000"},"observation_digest":"sha256:9433c6fd5dce2cc501f79f6277880d71ad2d8e0ce3b3c5c73a1f0661c2827e6d","observation_id":"66dc5fdb-0b32-4f84-ae51-67ec2d771ccc","resolution":{"observed_at":"2026-06-24T02:14:24.653602Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.22810/citation-record","integrity":"/paper/2602.22810/integrity","json":"/paper/2602.22810/citation-record.json","paper":"/paper/2602.22810"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T20:42:08.009823Z","title":"Definition D.3","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.009823Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:10bd23b0dfe6c2c8c66d180960a97ab9c46da33c0c02f1963356d5bd26e07bd7","observation_id":"306e7af0-72e1-4ff5-b437-219d2c03fcf3","resolution":{"observed_at":"2026-08-02T20:42:08.009823Z","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-02T20:42:08.030768Z","title":"At this point, we can upper bound the sum of the expected local Hellinger divergences with the divergence between trajectories invoking Rohatgi et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.030768Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:3753035d16c1375c6af608ce06d2818c99a39c7e872d4ab7df21dc50fbfc9e06","observation_id":"6139846d-4f6c-4695-b8eb-69d7aff91203","resolution":{"observed_at":"2026-08-02T20:42:08.030768Z","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-02T20:42:08.043049Z","title":"The most important change is a change of notation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.043049Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:12a761118ce669cad74407cf3be977c0c7d6f73a692e539ff3f45a484676d167","observation_id":"f112b81d-5aca-4ad8-b6ae-0b70d2fdff05","resolution":{"observed_at":"2026-08-02T20:42:08.043049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15007","last_updated":"2024-11-30T18:07:50Z","snapshot_observed_at":"2026-08-12T23:17:58.656443Z","submitted_at":"2024-07-20T23:31:56Z","title":"Is Behavior Cloning All You Need? Understanding Horizon in Imitation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15007","snapshot_observed_at":"2026-08-02T20:42:07.886001Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.886001Z"},"links":{"cited_paper":"/paper/2407.15007","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:ddb98178d6571639c54dd7435cff3270cc5a31e1cf6bc68aea61f9c5cc085c29","observation_id":"a9f86ca2-7b13-4d2e-be84-567a85727555","resolution":{"observed_at":"2026-08-02T20:42:07.886001Z","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-02T20:42:07.892985Z","title":"Freihaut, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.892985Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:51c493e03e50af2271a84121402f1120cc936d699ce42b72f4cedb32a7b6d851","observation_id":"a12faa65-4d4e-4cac-a40f-47956cbd0c06","resolution":{"observed_at":"2026-08-02T20:42:07.892985Z","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-02T20:42:08.016413Z","title":"Therefore, Π n softlin is richer and more likely to realize the observe expert behaviour for largeη","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.016413Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:7a363e99e1faf16075d4e64e5b6e8d1b00c5bee20784db3594dfa2a24721a0ae","observation_id":"a7e512d2-a188-4a71-9924-2fd5802a6873","resolution":{"observed_at":"2026-08-02T20:42:08.016413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01507","last_updated":"2019-05-16T05:32:17Z","snapshot_observed_at":"2026-07-06T05:58:12.969533Z","submitted_at":"2017-09-05T17:42:13Z","title":"Squeeze-and-Excitation Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.01507","snapshot_observed_at":"2026-08-02T20:42:07.905616Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.905616Z"},"links":{"cited_paper":"/paper/1709.01507","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:9d715c77b2404b313d41cb2629e98d56000d75587819a13e840c74e253f2facb","observation_id":"28bbf6f4-ac7b-44fb-acb9-9b32c1e11c82","resolution":{"observed_at":"2026-08-02T20:42:07.905616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12465","last_updated":"2025-02-18T02:52:00Z","snapshot_observed_at":"2026-08-10T12:47:20.234703Z","submitted_at":"2025-02-18T02:52:00Z","title":"Computational-Statistical Tradeoffs at the Next-Token Prediction Barrier: Autoregressive and Imitation Learning under Misspecification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12465","snapshot_observed_at":"2026-08-02T20:42:07.934415Z","title":"Rohatgi, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.934415Z"},"links":{"cited_paper":"/paper/2502.12465","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:8231b208b8cd5c45036e01373039fabc7a2f0b27f78326d8ac9036ca2dfdc7a2","observation_id":"faebd7c4-9768-43bd-88ee-5c10adc41c4f","resolution":{"observed_at":"2026-08-02T20:42:07.934415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.14471","last_updated":"2021-10-26T06:06:31Z","snapshot_observed_at":"2026-08-13T21:28:14.747299Z","submitted_at":"2020-09-30T06:42:09Z","title":"PettingZoo: Gym for Multi-Agent Reinforcement Learning","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.14471","snapshot_observed_at":"2026-08-02T20:42:07.952959Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.952959Z"},"links":{"cited_paper":"/paper/2009.14471","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:8f3029fac622eae9ad28381c895d37b285c7774fe694e475554967be9d685367","observation_id":"f613a5c1-9d41-4cef-bbb5-1ff473aa9e06","resolution":{"observed_at":"2026-08-02T20:42:07.952959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19859","last_updated":"2025-05-30T16:16:51Z","snapshot_observed_at":"2026-08-07T17:43:42.618135Z","submitted_at":"2025-02-27T08:03:37Z","title":"IL-SOAR : Imitation Learning with Soft Optimistic Actor cRitic","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19859","snapshot_observed_at":"2026-08-02T20:42:07.959156Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.959156Z"},"links":{"cited_paper":"/paper/2502.19859","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:97e09e04fa34b8c6e6207f6f8643810976dd5403944b1b1a94aa0412a31313a3","observation_id":"bfc5417b-4b1e-42c5-a001-a907e3b2406b","resolution":{"observed_at":"2026-08-02T20:42:07.959156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11274","last_updated":"2020-06-19T17:59:36Z","snapshot_observed_at":"2026-08-05T14:57:00.030905Z","submitted_at":"2020-06-19T17:59:36Z","title":"On Reward-Free Reinforcement Learning with Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.11274","snapshot_observed_at":"2026-08-02T20:42:07.966293Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.966293Z"},"links":{"cited_paper":"/paper/2006.11274","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:b631dab9284869d12bf7deb1d7da9369a7c1e0594b1f781f2fd7da68cab56e88","observation_id":"71452cbf-5e6d-4c22-ae29-9827f29452c3","resolution":{"observed_at":"2026-08-02T20:42:07.966293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00210","last_updated":"2019-11-01T20:35:28Z","snapshot_observed_at":"2026-08-14T17:36:09.834261Z","submitted_at":"2019-01-01T21:17:21Z","title":"Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.00210","snapshot_observed_at":"2026-08-02T20:42:07.973187Z","title":null,"venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.973187Z"},"links":{"cited_paper":"/paper/1901.00210","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:9f38c32fad96a5431e0c260716f388801e514296d5ab4fc1166bd65a489c1368","observation_id":"917d3c25-81d3-43ce-b267-189440240415","resolution":{"observed_at":"2026-08-02T20:42:07.973187Z","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-02T20:42:07.979533Z","title":"18 Contents of Appendix This appendix provides supplementary material to support the main findings of the paper","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.979533Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:42506d7679743259d5d2f001439e6fa6ba07ad1c8110660c5d47ad482c847e55","observation_id":"19966ab9-24db-4825-b313-ca5a81d7e1cf","resolution":{"observed_at":"2026-08-02T20:42:07.979533Z","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-02T20:42:07.986306Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.986306Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:9bbf5ce3a4ddc8f765de77a3b6a35e2653bf51e3c6f5261e0c6b344a4db5d1cf","observation_id":"5f52b084-d626-4c79-8e97-d5d950db7759","resolution":{"observed_at":"2026-08-02T20:42:07.986306Z","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-02T20:42:07.997865Z","title":"Reward-free reinforcement learning.Reward free reinforcement learning was first introduced in the seminal work of Jin et al","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.997865Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:9170356f87eed7a5551c6fa63911b6767dddc1a7b60f2a1a23bc0c0186fd71a5","observation_id":"83af945a-d3fb-4d71-9623-b96dfd947504","resolution":{"observed_at":"2026-08-02T20:42:07.997865Z","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-02T20:42:08.004593Z","title":"In these situations, our algorithms could still be applied but the theoretical guarantees would not hold","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.004593Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:3eb3b41f2c5f8ff5e0a2d66bf6ae568f0913982fcb357e1c85d41589c98821fb","observation_id":"fbf1b2d2-c7bf-45ab-bcb4-8783827f3456","resolution":{"observed_at":"2026-08-02T20:42:08.004593Z","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-02T20:42:08.023289Z","title":"As a practical example of a Nash equilibrium we can recover consider the zero sum normal form games with payoff matrix 1 0 1 0","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.023289Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:ec6dc40632ab9a9aa1ac81b35f023fd15dacb286ac2d20c22b82111ae7a53b94","observation_id":"e0538c15-9123-4110-b35e-47b851be0256","resolution":{"observed_at":"2026-08-02T20:42:08.023289Z","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-02T20:42:08.036966Z","title":"We notice that Lemma 4.3 avoids completely the dependence onC φ,max.Instead it is replaced with maxπ−n∈Π−n φ πn E ,π−n, h (Λ−n,K h )−1","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.036966Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:7d64bd010ee6400cd3128630b2bab57d67223b1101e1d12cd539b98c24ca95a6","observation_id":"4106d615-f87d-48e6-852e-6c6f1f75b520","resolution":{"observed_at":"2026-08-02T20:42:08.036966Z","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-02T20:42:08.048658Z","title":"Note that multiple Nash equilibria exist","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.048658Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:d339482a9e3e98ec556f43755b9bc43f7b176b38891100253883686d23faed7e","observation_id":"f271b5be-e7ba-4ea2-b0c4-787d881688a6","resolution":{"observed_at":"2026-08-02T20:42:08.048658Z","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-02T20:42:08.059818Z","title":"The action spaces are discrete, consisting of 9 actions for Tic-Tac-Toe (corresponding to the grid cells) and 7 actions for Connect4 (corresponding to the columns)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.059818Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:cb36402b2aa25c86f4e29d916c394a87305020b01ccc36093bf5e582a3aae8b5","observation_id":"b6c2e5ed-b0ce-41b4-9207-76ee85c00c36","resolution":{"observed_at":"2026-08-02T20:42:08.059818Z","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-02T20:42:08.070181Z","title":"− 1 2 KX i=1 log πE(AE i |Xi) ˆπϵ(AE i |Xi) −log|C ϵ(log Πsoftlin)| − KX i=1 logE","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.070181Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:38766a8cf8ea0a63c7e3ff7fe654a665cd6b2fe0b714eb6d3f47c4cbc96b1e10","observation_id":"15548f71-6475-45a1-84d5-8ab8edda986c","resolution":{"observed_at":"2026-08-02T20:42:08.070181Z","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-02T20:42:08.075493Z","title":"[2025, Lemma F.4] withη= 1, we obtain that KX i=1 E \" f πE(AE i |Xi) ¯π(AE i |Xi) 2 F E i # ≤4(2 + logB ratio) KX i=1 E f πE(AE i |Xi) ¯π(AE i |Xi) F E i","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.075493Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:0054187337eaf807a64c309d55c4da68ed8a42eb99eb373bd1f78beff7d8113f","observation_id":"6990b5dd-13f8-467c-bbe8-b2cb01150a2f","resolution":{"observed_at":"2026-08-02T20:42:08.075493Z","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-02T20:42:08.054607Z","title":"This model is parameterized as a multi-layer feedforward network designed to improve representation learning while maintaining linear transformations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.054607Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:87673f184a060997a72a171887e60b96e9b7de29706525bf4ebfc3e48945b9ac","observation_id":"61bd9d78-5ca4-488a-b3ca-4cc20d1029f0","resolution":{"observed_at":"2026-08-02T20:42:08.054607Z","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-02T20:42:08.064858Z","title":"To address this, we employ an advanced neural architecture inspired by AlphaGo [Silver et al., 2017]","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:08.064858Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:aa15aa09fe89de312d46754a985b2e467866a0b6cf57b95192e777be49bbd7ab","observation_id":"c5f6bb20-8236-4fa5-8514-f3d53446e73e","resolution":{"observed_at":"2026-08-02T20:42:08.064858Z","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.1137/1031049","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1137/1031049","venue":"SIAM Review","work_id":"46f15ae2-6ee0-45fc-872d-93fe98f9ce87","year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.899269Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:5c0a93880f325befe387306bd89e0937d1a63c4e8d32e95a37ea79ee62d14804","observation_id":"d36f2df2-e0c0-44db-bfac-490408f44d61","resolution":{"observed_at":"2026-08-02T20:44:03.520469Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-08-14T03:19:40.736445Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-02T20:42:07.923228Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.923228Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:743f6426dc959f540862d1df816df37d3ab9b2c1491a86813c5fa7c52a3aa442","observation_id":"959a020e-be39-44fd-93ce-cee6cf3d4b9b","resolution":{"observed_at":"2026-08-02T20:42:07.923228Z","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-02T20:42:07.991878Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.991878Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:ba298a316eb3341120838e3bd803603194d623d46e5baea5a5fbbb49a11bfa57","observation_id":"61cef2af-21a5-4853-b3e9-db6e88fb808d","resolution":{"observed_at":"2026-08-02T20:42:07.991878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01815","last_updated":"2017-12-05T18:45:38Z","snapshot_observed_at":"2026-08-02T00:39:04.960144Z","submitted_at":"2017-12-05T18:45:38Z","title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01815","snapshot_observed_at":"2026-08-02T20:42:07.940055Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.940055Z"},"links":{"cited_paper":"/paper/1712.01815","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:718f8d43de0e344e63a6dcfb4283e6d1ae989c4c2412716cba7dc5760cde3a23","observation_id":"349ee6f0-86de-41a1-8875-d019a4a94633","resolution":{"observed_at":"2026-08-02T20:42:07.940055Z","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-02T20:42:07.946581Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.946581Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:876ee1334f707693c8af1fe576c67b53dca2e4b8c20cc5d86b07dd8b94ba8539","observation_id":"8a5ebcc5-c199-4bc4-ba0d-29e40dd1504e","resolution":{"observed_at":"2026-08-02T20:42:07.946581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.06223","last_updated":"2019-02-23T09:53:27Z","snapshot_observed_at":"2026-08-14T17:15:23.036620Z","submitted_at":"2019-02-17T08:54:05Z","title":"Learning Linear-Quadratic Regulators Efficiently with only $\\sqrt{T}$ Regret","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.06223","snapshot_observed_at":"2026-08-02T20:42:07.872717Z","title":null,"venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.872717Z"},"links":{"cited_paper":"/paper/1902.06223","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:0fd43548550e752647aab5c6dc8b3b6f560dd824f96f3a09ad7d01886760a9cd","observation_id":"7f64e07a-d333-42a9-9f78-c10be0d1ddcd","resolution":{"observed_at":"2026-08-02T20:42:07.872717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.13442","last_updated":"2020-10-10T17:15:28Z","snapshot_observed_at":"2026-08-04T12:08:16.574131Z","submitted_at":"2020-07-27T11:28:32Z","title":"Fast active learning for pure exploration in reinforcement learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.13442","snapshot_observed_at":"2026-08-02T20:42:07.929118Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.929118Z"},"links":{"cited_paper":"/paper/2007.13442","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:73d8745234e936b3edaec17be36646f779b93dc79f101ed520cb6547940de642","observation_id":"81fd62dc-2065-4699-8421-6631877d0a90","resolution":{"observed_at":"2026-08-02T20:42:07.929118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.14702","last_updated":"2021-10-30T16:57:14Z","snapshot_observed_at":"2026-08-14T08:27:38.001355Z","submitted_at":"2021-07-30T15:25:13Z","title":"Towards General Function Approximation in Zero-Sum Markov Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.14702","snapshot_observed_at":"2026-08-02T20:42:07.911165Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.911165Z"},"links":{"cited_paper":"/paper/2107.14702","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:65f09cf3c26cd3594cf2e0a9822e14db129e099e8334975d9273ba45a5701023","observation_id":"7fedc25d-f2de-4fee-9695-5b4b54640aa8","resolution":{"observed_at":"2026-08-02T20:42:07.911165Z","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-02T20:42:07.917048Z","title":"URLhttp: //dx.doi.org/10.1109/PDGC56933.2022.10053317","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.917048Z"},"links":{"citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:ec71ee12c6f74ae78b6854b195bc7b311711279e819c1d04fb46b4f593a30986","observation_id":"fb5ad161-668f-40cd-9448-7f49d8601b32","resolution":{"observed_at":"2026-08-02T20:42:07.917048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03673","last_updated":"2023-06-21T21:15:10Z","snapshot_observed_at":"2026-08-13T12:49:15.062447Z","submitted_at":"2023-02-07T18:47:48Z","title":"Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.03673","snapshot_observed_at":"2026-08-02T20:42:07.879803Z","title":"org/abs/2302.03673","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.879803Z"},"links":{"cited_paper":"/paper/2302.03673","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:3c8434686d9c0972676827535d318d5f6af81d056b28b87e53709a2ff9050587","observation_id":"e1c41c64-d772-4caf-bc1c-0b5120b640ff","resolution":{"observed_at":"2026-08-02T20:42:07.879803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18595","last_updated":"2025-05-24T08:43:42Z","snapshot_observed_at":"2026-08-07T14:26:51.958080Z","submitted_at":"2025-05-24T08:43:42Z","title":"MisoDICE: Multi-Agent Imitation from Unlabeled Mixed-Quality Demonstrations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.18595","snapshot_observed_at":"2026-08-02T20:42:07.859229Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.859229Z"},"links":{"cited_paper":"/paper/2505.18595","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:6cad8c5ba21cbc83411547dec951c85fd1c1769baa61b92c6c7ae2ac4ea1b970","observation_id":"eaf52a1c-f9c3-404d-8e13-bf02df8be244","resolution":{"observed_at":"2026-08-02T20:42:07.859229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.05267","last_updated":"2025-07-01T09:33:24Z","snapshot_observed_at":"2026-08-08T04:35:15.776602Z","submitted_at":"2025-07-01T09:33:24Z","title":"Strongly Solving $7 \\times 6$ Connect-Four on Consumer Grade Hardware","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.05267","snapshot_observed_at":"2026-08-02T20:42:07.866799Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.866799Z"},"links":{"cited_paper":"/paper/2507.05267","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:bbb4fa3b442885e451febaecc47b3933f190d67f6685d81ea772dc0565912cb7","observation_id":"b37fd57c-8eb6-4cdc-b6d7-bd3b39e2a597","resolution":{"observed_at":"2026-08-02T20:42:07.866799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 2 inbound Pith citation observations for arXiv:2602.22810."}