{"as_of":"2026-08-11T05:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e3607a2fddb35dee47e5fa1819ddcfdb0b49836fd0edc11b24adeb713eb527a","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T17:33:36.210383Z","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-07-01T21:06:13.269124Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.07461","last_updated":"2023-08-08T22:36:08Z","snapshot_observed_at":"2026-07-06T09:38:20.471004Z","submitted_at":"2020-07-15T03:25:24Z","title":"Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity","version":3},"cited_work":{"arxiv_id":"2007.07461","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.07461","snapshot_observed_at":"2026-07-01T21:06:13.269124Z","title":"arXiv preprint arXiv:2007.07461 , year=","venue":null,"work_id":"b4fcda9e-0e79-43fa-ad58-6dda4177eb01","year":2007},"citing_paper":{"arxiv_id":"2606.01382","last_updated":"2026-05-31T18:11:26Z","snapshot_observed_at":"2026-08-06T07:55:08.019280Z","submitted_at":"2026-05-31T18:11:26Z","title":"Efficient Exploration for Iterative Nash Preference Optimization","version":1},"reference_index":124,"source":"arxiv_source","source_observed_at":"2026-06-28T17:33:36.210383Z"},"links":{"cited_paper":"/paper/2007.07461","citing_paper":"/paper/2606.01382"},"observation_digest":"sha256:895bcea89051e9f90d2c22079b0e50fd3fe9edbc4ab7a048e85b9cb30d1304a7","observation_id":"82a1860c-f379-410a-b32c-3234ef7cc18d","resolution":{"observed_at":"2026-07-01T21:06:13.271138Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.07461/citation-record","integrity":"/paper/2007.07461/integrity","json":"/paper/2007.07461/citation-record.json","paper":"/paper/2007.07461"},"outbound":[],"paper":{"arxiv_id":"2007.07461","last_updated":"2023-08-08T22:36:08Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:38:20.471004Z","submitted_at":"2020-07-15T03:25:24Z","title":"Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2007.07461."}