{"as_of":"2026-08-16T12:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a4ef48040ad0b283bb52d1f083cb9e9a71294b0a0399aa408bd3d9d355e74d4","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:45:55.531036Z","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-19T09:12:14.617137Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-08-15T20:45:55.531036Z","title":"Distributionally robust reinforcement learning with interactive data collection: Fundamental hardness and near-optimal algorithm.arXiv preprint arXiv:2404.03578, 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-15T20:31:09.031623Z","submitted_at":"2025-05-18T15:34:45Z","title":"Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.531036Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:dd913b61dbafb6b73a2e3ed6ef38f013315895e6c5b4d0394c9878b9cada8874","observation_id":"c237809b-e432-4ccc-8c39-684560ff0331","resolution":{"observed_at":"2026-08-15T20:45:55.531036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-08-15T20:36:34.373712Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12868","last_updated":"2025-05-19T08:52:15Z","snapshot_observed_at":"2026-08-15T20:22:27.932320Z","submitted_at":"2025-05-19T08:52:15Z","title":"Causality-Inspired Robustness for Nonlinear Models via Representation Learning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:34.373712Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2505.12868"},"observation_digest":"sha256:0dd1dd657f250cf2c84dd7375a39de03b783fbc47621d4e8b73df79b8b2c2f92","observation_id":"84266ef8-f340-4834-b8df-54d1db93a83d","resolution":{"observed_at":"2026-08-15T20:36:34.373712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-08-07T14:37:25.885881Z","title":"Distributionally robust reinforcement learning with interactive data collection: Fundamental hardness and near-optimal algorithm","venue":null,"work_id":null,"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":39,"source":"arxiv_source","source_observed_at":"2026-08-07T14:37:25.885881Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2505.18447"},"observation_digest":"sha256:7a7d2242b75fe2ad3bc67b0b0f4f5e249881a41c64d087b8e580a4dc53f7081b","observation_id":"7fc2d69d-d1b2-41ba-8a55-fa137634eabd","resolution":{"observed_at":"2026-08-07T14:37:25.885881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":"2404.03578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-07-14T01:21:58.131331Z","title":"Distributionally robust reinforcement learning with interactive data collection: Fundamental hardness and near-optimal algorithm","venue":null,"work_id":"ad26aedd-cb82-49f3-ba0f-5e4190e0bd09","year":2024},"citing_paper":{"arxiv_id":"2506.12622","last_updated":"2026-04-18T21:54:34Z","snapshot_observed_at":"2026-08-13T08:23:08.625198Z","submitted_at":"2025-06-14T20:36:44Z","title":"DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T09:09:51.531488Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2506.12622"},"observation_digest":"sha256:5d56b02d2204dff75438dfaa83c42bdd0aa7d56c72529eccbea9bbac4e12b78c","observation_id":"01179285-566e-4a16-bf58-3d2eedf68f32","resolution":{"observed_at":"2026-07-14T01:21:58.131331Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":"2404.03578","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-07-14T01:21:58.131331Z","title":"Distributionally robust reinforcement learning with interactive data collection: Fundamental hardness and near-optimal algorithm","venue":null,"work_id":"ad26aedd-cb82-49f3-ba0f-5e4190e0bd09","year":2024},"citing_paper":{"arxiv_id":"2605.03125","last_updated":"2026-05-06T22:03:28Z","snapshot_observed_at":"2026-08-15T17:50:58.873332Z","submitted_at":"2026-05-04T20:04:52Z","title":"Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T19:13:15.234351Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2605.03125"},"observation_digest":"sha256:cae8147166027eaa41483e04bd2ecc6eb5c54c67e2a9f5817d0e359d67deefd1","observation_id":"08c2a4d9-6e1b-4f28-8799-f4f598767489","resolution":{"observed_at":"2026-07-14T01:21:58.131331Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03578","snapshot_observed_at":"2026-08-15T14:39:15.846221Z","title":"arXiv preprint arXiv:2404.03578 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06545","last_updated":"2026-08-06T19:49:48Z","snapshot_observed_at":"2026-08-16T06:31:47.673457Z","submitted_at":"2026-08-06T19:49:48Z","title":"Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions","version":1},"reference_index":165,"source":"arxiv_source","source_observed_at":"2026-08-15T14:39:15.846221Z"},"links":{"cited_paper":"/paper/2404.03578","citing_paper":"/paper/2608.06545"},"observation_digest":"sha256:1745e1635785c80551ea30385f39550d41e08d9589ac9b3e72fd096c421b2229","observation_id":"01267869-c504-4f99-a017-92ae53995928","resolution":{"observed_at":"2026-08-15T14:39:15.846221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.03578/citation-record","integrity":"/paper/2404.03578/integrity","json":"/paper/2404.03578/citation-record.json","paper":"/paper/2404.03578"},"outbound":[],"paper":{"arxiv_id":"2404.03578","last_updated":"2026-07-13T05:45:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T05:53:07.252285Z","submitted_at":"2024-04-04T16:40:22Z","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2404.03578."}