{"as_of":"2026-08-17T01:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2804c6b4ab719688be92c3d63ce3ff0166a4f775ba6a5f6d712c11d2676204b0","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-16T06:30:59.297886+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-08-15T14:55:08.196587Z","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-08-15T14:55:08.826845Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.01992","last_updated":"2019-01-06T22:00:10Z","snapshot_observed_at":"2026-08-14T17:34:33.220218Z","submitted_at":"2019-01-06T22:00:10Z","title":"Large-Scale Markov Decision Problems via the Linear Programming Dual","version":1},"cited_work":{"arxiv_id":"1901.01992","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.01992","snapshot_observed_at":"2026-08-15T14:55:08.826845Z","title":"Large-Scale Markov Decision Problems via the Linear Programming Dual","venue":"math.OC","work_id":"a60a8224-3b12-4567-84e4-779045b820e6","year":2019},"citing_paper":{"arxiv_id":"2608.03562","last_updated":"2026-08-04T12:28:39Z","snapshot_observed_at":"2026-08-17T00:04:00.512210Z","submitted_at":"2026-08-04T12:28:39Z","title":"Robust General Utility for Reinforcement Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T14:55:08.196587Z"},"links":{"cited_paper":"/paper/1901.01992","citing_paper":"/paper/2608.03562"},"observation_digest":"sha256:a88e2fd9cccde866b4b7d84d4b055bbe88dc1bbc9f4b4a8564d1293305741924","observation_id":"dbf95b70-b330-42da-a1eb-653c82dc923f","resolution":{"observed_at":"2026-08-15T14:55:08.831865Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.01992/citation-record","integrity":"/paper/1901.01992/integrity","json":"/paper/1901.01992/citation-record.json","paper":"/paper/1901.01992"},"outbound":[],"paper":{"arxiv_id":"1901.01992","last_updated":"2019-01-06T22:00:10Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T17:34:33.220218Z","submitted_at":"2019-01-06T22:00:10Z","title":"Large-Scale Markov Decision Problems via the Linear Programming Dual"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.01992."}