{"as_of":"2026-08-09T23:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a31c08fb3f9c1cef27b311a3769137a1699c86b2e361a3a72e65ba21c7af16ad","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:00:44.339758Z","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-03T23:29:02.972851Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06323","snapshot_observed_at":"2026-08-03T05:00:44.339758Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03778","last_updated":"2026-06-30T15:15:04Z","snapshot_observed_at":"2026-08-05T22:17:21.917922Z","submitted_at":"2026-02-03T17:39:45Z","title":"Reward Redistribution for CVaR MDPs using a Bellman Operator on L-infinity","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T05:00:44.339758Z"},"links":{"cited_paper":"/paper/2403.06323","citing_paper":"/paper/2602.03778"},"observation_digest":"sha256:0f237bbc307058dd1b8b12b1f90dee2e39eb4456133c3477d09e72765b41a334","observation_id":"9c91a862-2c0c-4c93-b634-0fdaf4ed1ae8","resolution":{"observed_at":"2026-08-03T05:00:44.339758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents","version":2},"cited_work":{"arxiv_id":"2403.06323","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.06323","snapshot_observed_at":"2026-07-03T23:29:02.972851Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2024, pages 15503–15514","venue":null,"work_id":"0f2204d5-e271-48ec-a050-2ca1db4671ea","year":2024},"citing_paper":{"arxiv_id":"2604.04795","last_updated":"2026-07-07T17:01:01Z","snapshot_observed_at":"2026-07-13T09:40:41.819534Z","submitted_at":"2026-04-06T16:01:59Z","title":"Sample Complexity for Markov Decision Processes and Stochastic Optimal Control with Static Risk Measures","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T19:31:33.732451Z"},"links":{"cited_paper":"/paper/2403.06323","citing_paper":"/paper/2604.04795"},"observation_digest":"sha256:f4dcde1fb073ebd85661100b3f9a95ed043080f34271198a693749262b0aca48","observation_id":"20e6c319-674f-4f0f-b4ec-30535281caaf","resolution":{"observed_at":"2026-05-10T22:50:51.124687Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents","version":2},"cited_work":{"arxiv_id":"2403.06323","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.06323","snapshot_observed_at":"2026-07-03T23:29:02.972851Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2024, pages 15503–15514","venue":null,"work_id":"0f2204d5-e271-48ec-a050-2ca1db4671ea","year":2024},"citing_paper":{"arxiv_id":"2604.25136","last_updated":"2026-04-28T02:24:51Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-28T02:24:51Z","title":"Frictive Policy Optimization for LLMs: Epistemic Intervention, Risk-Sensitive Control, and Reflective Alignment","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T16:46:54.773875Z"},"links":{"cited_paper":"/paper/2403.06323","citing_paper":"/paper/2604.25136"},"observation_digest":"sha256:2971fb6f974bdfc08e3cdcf837163f3bb4853a858d99b689bc74026d474dd66b","observation_id":"c868b12f-69dd-4d5e-ba20-8bebc07651a4","resolution":{"observed_at":"2026-05-11T23:31:17.191999Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents","version":2},"cited_work":{"arxiv_id":"2403.06323","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.06323","snapshot_observed_at":"2026-07-03T23:29:02.972851Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2024, pages 15503–15514","venue":null,"work_id":"0f2204d5-e271-48ec-a050-2ca1db4671ea","year":2024},"citing_paper":{"arxiv_id":"2606.18531","last_updated":"2026-06-16T22:55:45Z","snapshot_observed_at":"2026-08-04T10:57:17.249083Z","submitted_at":"2026-06-16T22:55:45Z","title":"When Does Trajectory-Level Supervision Permit Efficient Offline Reinforcement Learning?","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-26T22:06:24.412259Z"},"links":{"cited_paper":"/paper/2403.06323","citing_paper":"/paper/2606.18531"},"observation_digest":"sha256:f408ca5703b551914e2de168e2300c9e3fc256b8771f441efbfbe738365350d7","observation_id":"3165639d-6090-4286-af50-0c727135af8f","resolution":{"observed_at":"2026-07-03T23:29:02.974873Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06323","snapshot_observed_at":"2026-08-02T02:23:27.955351Z","title":"arXiv preprint arXiv:2403.06323 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14373","last_updated":"2026-07-15T21:22:50Z","snapshot_observed_at":"2026-08-02T02:23:13.870355Z","submitted_at":"2026-07-15T21:22:50Z","title":"A Noise-Robust Elicit-to-Optimize Framework for Distortion Riskmetrics via Inverse Reinforcement Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T02:23:27.955351Z"},"links":{"cited_paper":"/paper/2403.06323","citing_paper":"/paper/2607.14373"},"observation_digest":"sha256:b4ff9ae1e41805774f49150582155da9026e0930dd4cc61b5230fa714711f70a","observation_id":"66a5e51f-9fd9-411d-935c-731dc791db9b","resolution":{"observed_at":"2026-08-02T02:23:27.955351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.06323/citation-record","integrity":"/paper/2403.06323/integrity","json":"/paper/2403.06323/citation-record.json","paper":"/paper/2403.06323"},"outbound":[],"paper":{"arxiv_id":"2403.06323","last_updated":"2025-02-28T02:35:06Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T22:51:39.828623Z","submitted_at":"2024-03-10T21:45:12Z","title":"A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2403.06323."}