{"as_of":"2026-08-18T12:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0acb4082298c48bf12f1c309d12c080aebd032dc8513d2b40dd98ce8b6638513","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-18T06:34:40.430872+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-15T20:45:55.519507Z","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-07T14:37:31.119029Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.12946","last_updated":"2024-06-27T03:16:30Z","snapshot_observed_at":"2026-08-18T06:04:06.247732Z","submitted_at":"2024-03-19T17:48:42Z","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12946","snapshot_observed_at":"2026-08-15T20:45:55.519507Z","title":"Sample complexity of offline distributionally robust linear markov decision processes.arXiv preprint arXiv:2403.12946, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.12462","last_updated":"2026-06-21T21:20:26Z","snapshot_observed_at":"2026-08-17T19:23:25.884434Z","submitted_at":"2025-05-18T15:34:45Z","title":"Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.519507Z"},"links":{"cited_paper":"/paper/2403.12946","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:a3332ee3295e10ba64b72b55d57e370e09095a843860e627e2b7274b9a84df26","observation_id":"bf25c8fe-24d5-4a71-b7e8-fee6f65a26e0","resolution":{"observed_at":"2026-08-15T20:45:55.519507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12946","last_updated":"2024-06-27T03:16:30Z","snapshot_observed_at":"2026-08-18T06:04:06.247732Z","submitted_at":"2024-03-19T17:48:42Z","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2403.12946","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12946","snapshot_observed_at":"2026-08-07T14:37:31.119029Z","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","venue":"cs.LG","work_id":"61fa955d-0c21-4e15-8f7e-a7478742fe69","year":2024},"citing_paper":{"arxiv_id":"2505.18447","last_updated":"2025-05-29T14:15:50Z","snapshot_observed_at":"2026-08-14T03:00:34.416333Z","submitted_at":"2025-05-24T01:09:10Z","title":"Pessimism Principle Can Be Effective: Towards a Framework for Zero-Shot Transfer Reinforcement Learning","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T14:37:29.102856Z"},"links":{"cited_paper":"/paper/2403.12946","citing_paper":"/paper/2505.18447"},"observation_digest":"sha256:7e1dc21c3f9b5f13a689fb8a981e4b4230dbbbc4608f09b2c66b2d8f83d28249","observation_id":"2d44951e-5027-47ea-a6e8-03f2f6e0143b","resolution":{"observed_at":"2026-08-07T14:37:31.168085Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.12946/citation-record","integrity":"/paper/2403.12946/integrity","json":"/paper/2403.12946/citation-record.json","paper":"/paper/2403.12946"},"outbound":[],"paper":{"arxiv_id":"2403.12946","last_updated":"2024-06-27T03:16:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T06:04:06.247732Z","submitted_at":"2024-03-19T17:48:42Z","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.12946."}