{"as_of":"2026-08-12T06:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7e9a219e627917738dbd5518bca65c77cb4aabc4368009b5bc54abfb89013dc","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T12:42:58.392711Z","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-07-03T01:47:31.640170Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.05371","last_updated":"2021-02-10T10:27:49Z","snapshot_observed_at":"2026-08-06T21:10:42.763482Z","submitted_at":"2021-02-10T10:27:49Z","title":"Risk-Averse Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05371","snapshot_observed_at":"2026-08-04T12:42:58.392711Z","title":"Risk-averse offline reinforcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.03013","last_updated":"2026-05-27T19:46:08Z","snapshot_observed_at":"2026-08-10T10:26:21.494267Z","submitted_at":"2025-10-03T13:58:09Z","title":"Distributional Inverse Reinforcement Learning","version":4},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T12:42:58.392711Z"},"links":{"cited_paper":"/paper/2102.05371","citing_paper":"/paper/2510.03013"},"observation_digest":"sha256:4166c961119ae4f93d025537efaf9477d8f2c7970e8195a630c00662605b379b","observation_id":"ae7feb3d-cf74-45cc-9a8f-b91b17477862","resolution":{"observed_at":"2026-08-04T12:42:58.392711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05371","last_updated":"2021-02-10T10:27:49Z","snapshot_observed_at":"2026-08-06T21:10:42.763482Z","submitted_at":"2021-02-10T10:27:49Z","title":"Risk-Averse Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2102.05371","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.05371","snapshot_observed_at":"2026-07-03T01:47:31.640170Z","title":"arXiv preprint arXiv:2102.05371 , year=","venue":null,"work_id":"ad39a349-cf4e-4e8f-8e7e-17dae16bd6a7","year":2021},"citing_paper":{"arxiv_id":"2605.01663","last_updated":"2026-05-28T02:21:27Z","snapshot_observed_at":"2026-08-11T13:45:14.782986Z","submitted_at":"2026-05-03T01:32:11Z","title":"Towards Efficient and Expressive Offline RL via Flow-Anchored Noise-conditioned Q-Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-10T16:25:25.739019Z"},"links":{"cited_paper":"/paper/2102.05371","citing_paper":"/paper/2605.01663"},"observation_digest":"sha256:b9537176779db3b2e235fbb1d8bb3e383b0cce433aba9dbcabf93435fc0aefde","observation_id":"daadc186-9b29-413b-bd8f-02cdf141f8c4","resolution":{"observed_at":"2026-05-11T08:56:00.610765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05371","last_updated":"2021-02-10T10:27:49Z","snapshot_observed_at":"2026-08-06T21:10:42.763482Z","submitted_at":"2021-02-10T10:27:49Z","title":"Risk-Averse Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2102.05371","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.05371","snapshot_observed_at":"2026-07-03T01:47:31.640170Z","title":"arXiv preprint arXiv:2102.05371 , year=","venue":null,"work_id":"ad39a349-cf4e-4e8f-8e7e-17dae16bd6a7","year":2021},"citing_paper":{"arxiv_id":"2606.11249","last_updated":"2026-06-08T12:27:17Z","snapshot_observed_at":"2026-08-06T09:01:45.077157Z","submitted_at":"2026-06-08T12:27:17Z","title":"MASK: Multi-Agent Semantic K-Scheduling for Risk-Sensitive 6G Robotics","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T16:18:09.604549Z"},"links":{"cited_paper":"/paper/2102.05371","citing_paper":"/paper/2606.11249"},"observation_digest":"sha256:f0d573ea8ce6c357f0e39e748830068fd40abf54a238713f50bba009bcd2ce24","observation_id":"ab4ce17b-2fc2-4bbd-8812-864542ffefe3","resolution":{"observed_at":"2026-07-03T01:47:31.641891Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05371","last_updated":"2021-02-10T10:27:49Z","snapshot_observed_at":"2026-08-06T21:10:42.763482Z","submitted_at":"2021-02-10T10:27:49Z","title":"Risk-Averse Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2102.05371","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.05371","snapshot_observed_at":"2026-07-03T01:47:31.640170Z","title":"arXiv preprint arXiv:2102.05371 , year=","venue":null,"work_id":"ad39a349-cf4e-4e8f-8e7e-17dae16bd6a7","year":2021},"citing_paper":{"arxiv_id":"2606.27766","last_updated":"2026-06-26T06:51:16Z","snapshot_observed_at":"2026-08-05T05:40:05.365084Z","submitted_at":"2026-06-26T06:51:16Z","title":"RS-Diffuser: Risk-Sensitive Diffusion Planning with Distributional Value Guidance","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T05:05:39.828659Z"},"links":{"cited_paper":"/paper/2102.05371","citing_paper":"/paper/2606.27766"},"observation_digest":"sha256:2cf14082d18e161dd794e5abbd391d69e2dfb9a737c60b0908c3ad6924706dfe","observation_id":"974876a1-4367-40cf-be29-f964a6b80754","resolution":{"observed_at":"2026-06-29T18:23:51.475599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.05371/citation-record","integrity":"/paper/2102.05371/integrity","json":"/paper/2102.05371/citation-record.json","paper":"/paper/2102.05371"},"outbound":[],"paper":{"arxiv_id":"2102.05371","last_updated":"2021-02-10T10:27:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T21:10:42.763482Z","submitted_at":"2021-02-10T10:27:49Z","title":"Risk-Averse Offline Reinforcement Learning"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2102.05371."}