{"as_of":"2026-08-20T16:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52e16cbcd038d2b38de6edc6be5807621f4de5beb25ec0b45fa5bec91a2a2914","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-08-07T20:38:32.131670Z","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-09T06:00:35.933208Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.07082","last_updated":"2024-06-11T12:12:59Z","snapshot_observed_at":"2026-08-16T14:19:36.986683Z","submitted_at":"2024-02-11T01:51:15Z","title":"Refined Sample Complexity for Markov Games with Independent Linear Function Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07082","snapshot_observed_at":"2026-08-07T20:38:32.131670Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09780","last_updated":"2025-02-13T21:28:51Z","snapshot_observed_at":"2026-08-18T07:44:08.359696Z","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":18,"source":"arxiv_source","source_observed_at":"2026-08-07T20:38:32.131670Z"},"links":{"cited_paper":"/paper/2402.07082","citing_paper":"/paper/2502.09780"},"observation_digest":"sha256:14f16cda2ed05f5ae1309607d44052ec4fe1de9995c94968349ea790e542fb84","observation_id":"d2e1ea29-1775-4c7b-88ff-933e142d29be","resolution":{"observed_at":"2026-08-07T20:38:32.131670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07082","last_updated":"2024-06-11T12:12:59Z","snapshot_observed_at":"2026-08-16T14:19:36.986683Z","submitted_at":"2024-02-11T01:51:15Z","title":"Refined Sample Complexity for Markov Games with Independent Linear Function Approximation","version":2},"cited_work":{"arxiv_id":"2402.07082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.07082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"14 Baihe Huang, Jason D","venue":null,"work_id":"d50bf356-3071-4c11-a1ad-44fb3f31ef95","year":null},"citing_paper":{"arxiv_id":"2605.03125","last_updated":"2026-05-06T22:03:28Z","snapshot_observed_at":"2026-08-15T17:50:58.873332Z","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":17,"source":"pdf_text","source_observed_at":"2026-05-08T19:13:15.234351Z"},"links":{"cited_paper":"/paper/2402.07082","citing_paper":"/paper/2605.03125"},"observation_digest":"sha256:d74ba1f16a33cc0c6d3edc828fcb1103ef3f8026d6a45e6f21a84e0ee92be4f2","observation_id":"830378a1-9d87-4f4c-83d2-e68bdaf6646b","resolution":{"observed_at":"2026-05-09T06:00:35.934590Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.07082/citation-record","integrity":"/paper/2402.07082/integrity","json":"/paper/2402.07082/citation-record.json","paper":"/paper/2402.07082"},"outbound":[],"paper":{"arxiv_id":"2402.07082","last_updated":"2024-06-11T12:12:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:19:36.986683Z","submitted_at":"2024-02-11T01:51:15Z","title":"Refined Sample Complexity for Markov Games with Independent Linear Function Approximation"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.07082."}