{"as_of":"2026-08-13T04:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5987e52c4106da860639f5618db9055e8f9ab2cd9417dcdf22a559230cebf952","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-12T06:34:41.77262+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.338397Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-20T14:08:21.053385Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.00423","last_updated":"2019-06-02T15:24:19Z","snapshot_observed_at":"2026-07-06T07:57:18.438339Z","submitted_at":"2019-06-02T15:24:19Z","title":"Feature-Based Q-Learning for Two-Player Stochastic Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00423","snapshot_observed_at":"2026-08-11T00:10:22.338397Z","title":"Feature-based q-learn ing for two-player stochastic games","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-12T21:53:50.669859Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.338397Z"},"links":{"cited_paper":"/paper/1906.00423","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:f72f9a04fab413c2f9843b0c22591764af886474537b71cde5133a11eb627dd3","observation_id":"4ea42e5f-01e7-4d3b-8e87-e50599d88246","resolution":{"observed_at":"2026-08-11T00:10:22.338397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00423","last_updated":"2019-06-02T15:24:19Z","snapshot_observed_at":"2026-07-06T07:57:18.438339Z","submitted_at":"2019-06-02T15:24:19Z","title":"Feature-Based Q-Learning for Two-Player Stochastic Games","version":1},"cited_work":{"arxiv_id":"1906.00423","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.00423","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Feature-Based Q-Learning for Two-Player Stochastic Games","venue":"cs.LG","work_id":"34219c06-8255-4172-ba6f-856eb313ba3a","year":2019},"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":162,"source":"arxiv_source","source_observed_at":"2026-05-20T14:04:44.364824Z"},"links":{"cited_paper":"/paper/1906.00423","citing_paper":"/paper/2605.17189"},"observation_digest":"sha256:6681031ce309b23e90f73a80c58deb8b2b647271b0216e27f724e30a6afa4220","observation_id":"cefe402d-a4d3-4e3a-a206-b4a41c1fdf1b","resolution":{"observed_at":"2026-05-20T14:08:21.055630Z","resolver_source":"local_arxiv","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/1906.00423/citation-record","integrity":"/paper/1906.00423/integrity","json":"/paper/1906.00423/citation-record.json","paper":"/paper/1906.00423"},"outbound":[],"paper":{"arxiv_id":"1906.00423","last_updated":"2019-06-02T15:24:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:57:18.438339Z","submitted_at":"2019-06-02T15:24:19Z","title":"Feature-Based Q-Learning for Two-Player Stochastic Games"},"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 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1906.00423."}