{"as_of":"2026-08-12T04:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3043b2f20342dcb6d29b4f5092700c31a45e481edcc565a0720449b9c6dc31e","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-11T06:34:44.6726+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-11T00:10:22.356655Z","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-20T14:08:21.088360Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.10458","last_updated":"2022-10-12T14:25:27Z","snapshot_observed_at":"2026-07-06T13:44:18.807144Z","submitted_at":"2022-08-22T17:24:55Z","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.10458","snapshot_observed_at":"2026-08-11T00:10:22.356655Z","title":"Minimax-opti mal multi-agent rl in markov games with a generative model","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":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.356655Z"},"links":{"cited_paper":"/paper/2208.10458","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:11ee4f084eec8808250f30952c689293e822c3fbf33c9484e748f56fd11fc82f","observation_id":"915506fb-b58e-4222-b634-75fc90fcb3ae","resolution":{"observed_at":"2026-08-11T00:10:22.356655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.10458","last_updated":"2022-10-12T14:25:27Z","snapshot_observed_at":"2026-07-06T13:44:18.807144Z","submitted_at":"2022-08-22T17:24:55Z","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","version":2},"cited_work":{"arxiv_id":"2208.10458","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.10458","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2208.10458 , year=","venue":null,"work_id":"48aed690-985b-4bfa-baa4-36e097f44b01","year":null},"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":161,"source":"arxiv_source","source_observed_at":"2026-05-20T14:04:44.364824Z"},"links":{"cited_paper":"/paper/2208.10458","citing_paper":"/paper/2605.17189"},"observation_digest":"sha256:50bf20c79c5ba19599c936f03a3cd4003dfc71564e69729de0aacd6bac4db317","observation_id":"c7c166cd-a447-49bc-97ec-fe96def33904","resolution":{"observed_at":"2026-05-20T14:08:21.090953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.10458/citation-record","integrity":"/paper/2208.10458/integrity","json":"/paper/2208.10458/citation-record.json","paper":"/paper/2208.10458"},"outbound":[],"paper":{"arxiv_id":"2208.10458","last_updated":"2022-10-12T14:25:27Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:44:18.807144Z","submitted_at":"2022-08-22T17:24:55Z","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2208.10458."}