{"as_of":"2026-08-08T09:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4121f373b803cbb8b4efd0329a15c223b6829ca1d8248f5223322950cb8f07b9","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-08T06:32:00.761636+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-07T14:37:25.528158Z","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:26:53.640499Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.13642","last_updated":"2023-01-31T13:54:23Z","snapshot_observed_at":"2026-08-07T19:30:42.625842Z","submitted_at":"2023-01-31T13:54:23Z","title":"An Efficient Solution to s-Rectangular Robust Markov Decision Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13642","snapshot_observed_at":"2026-08-07T14:37:25.528158Z","title":"An efficient solution to s-rectangular robust markov decision processes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18447","last_updated":"2025-05-29T14:15:50Z","snapshot_observed_at":"2026-08-07T20:34:06.269545Z","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":34,"source":"arxiv_source","source_observed_at":"2026-08-07T14:37:25.528158Z"},"links":{"cited_paper":"/paper/2301.13642","citing_paper":"/paper/2505.18447"},"observation_digest":"sha256:c77bee83abbd3eb76124357e0d91ab52e077e443ebf25d1488687ea2caffbf28","observation_id":"07f3a0a6-574b-49fa-bbe2-de62f90969cc","resolution":{"observed_at":"2026-08-07T14:37:25.528158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13642","last_updated":"2023-01-31T13:54:23Z","snapshot_observed_at":"2026-08-07T19:30:42.625842Z","submitted_at":"2023-01-31T13:54:23Z","title":"An Efficient Solution to s-Rectangular Robust Markov Decision Processes","version":1},"cited_work":{"arxiv_id":"2301.13642","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.13642","snapshot_observed_at":"2026-08-07T14:26:53.640499Z","title":"An Efficient Solution to s-Rectangular Robust Markov Decision Processes","venue":"cs.LG","work_id":"1b19003a-7340-4365-b59b-574931d347d9","year":2023},"citing_paper":{"arxiv_id":"2505.19058","last_updated":"2025-05-25T09:22:06Z","snapshot_observed_at":"2026-08-07T14:18:47.204343Z","submitted_at":"2025-05-25T09:22:06Z","title":"Distributionally Robust Deep Q-Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:49.284674Z"},"links":{"cited_paper":"/paper/2301.13642","citing_paper":"/paper/2505.19058"},"observation_digest":"sha256:72cce09e3ca7c607a1f2e122c42021ebfac2077013e69e937859c0ca5b185678","observation_id":"2196972d-d2b4-4108-97d5-1b9403556f1d","resolution":{"observed_at":"2026-08-07T14:26:53.737945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2301.13642/citation-record","integrity":"/paper/2301.13642/integrity","json":"/paper/2301.13642/citation-record.json","paper":"/paper/2301.13642"},"outbound":[],"paper":{"arxiv_id":"2301.13642","last_updated":"2023-01-31T13:54:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T19:30:42.625842Z","submitted_at":"2023-01-31T13:54:23Z","title":"An Efficient Solution to s-Rectangular Robust 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2301.13642."}