{"as_of":"2026-08-20T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:841dc12a9a8ef8607a9642bc9629283c19e7bdc8a771535b1cf60e0ac89cbd11","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:27:42.254293Z","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-23T22:03:30.892214Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.06866","last_updated":"2022-09-14T18:29:02Z","snapshot_observed_at":"2026-08-16T16:32:29.432211Z","submitted_at":"2022-09-14T18:29:02Z","title":"Robust Constrained Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2209.06866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.06866","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust Constrained Reinforcement Learning","venue":null,"work_id":"20d4b0ad-41bb-434c-9169-7d930c76cb32","year":2022},"citing_paper":{"arxiv_id":"2408.16286","last_updated":"2026-04-24T03:11:36Z","snapshot_observed_at":"2026-08-15T05:35:21.765788Z","submitted_at":"2024-08-29T06:37:16Z","title":"Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form","version":5},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-23T21:58:56.180393Z"},"links":{"cited_paper":"/paper/2209.06866","citing_paper":"/paper/2408.16286"},"observation_digest":"sha256:4cc72e8d9e5187e2a65f4f3c8b6770865deabffaa10ce66dbd9fca6bb9512fff","observation_id":"1df4ecea-cd46-421f-98dd-7165b08b020f","resolution":{"observed_at":"2026-05-23T22:03:30.895012Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.06866","last_updated":"2022-09-14T18:29:02Z","snapshot_observed_at":"2026-08-16T16:32:29.432211Z","submitted_at":"2022-09-14T18:29:02Z","title":"Robust Constrained Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2209.06866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.06866","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust Constrained Reinforcement Learning","venue":null,"work_id":"20d4b0ad-41bb-434c-9169-7d930c76cb32","year":2022},"citing_paper":{"arxiv_id":"2604.14243","last_updated":"2026-04-17T15:08:39Z","snapshot_observed_at":"2026-08-11T13:36:47.085999Z","submitted_at":"2026-04-15T04:53:29Z","title":"Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T13:36:59.355147Z"},"links":{"cited_paper":"/paper/2209.06866","citing_paper":"/paper/2604.14243"},"observation_digest":"sha256:55021a26c0b3b8a93b2f768e6cc3d6bfe483e46a5e2b10c215c9fc4473c802a4","observation_id":"af011cdb-4e83-4f46-af56-9400fcba9758","resolution":{"observed_at":"2026-05-10T13:40:27.176165Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.06866","last_updated":"2022-09-14T18:29:02Z","snapshot_observed_at":"2026-08-16T16:32:29.432211Z","submitted_at":"2022-09-14T18:29:02Z","title":"Robust Constrained Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.06866","snapshot_observed_at":"2026-08-01T23:27:42.254293Z","title":"Robust constrained reinforcement learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.15457","last_updated":"2026-07-16T21:00:50Z","snapshot_observed_at":"2026-08-01T23:27:39.838789Z","submitted_at":"2026-07-16T21:00:50Z","title":"Robust Peak-cost Constrained Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T23:27:42.254293Z"},"links":{"cited_paper":"/paper/2209.06866","citing_paper":"/paper/2607.15457"},"observation_digest":"sha256:998e13dfdca19080b6d5a0e10029f1bb7c14fbee9065ce38fb956e61776592f6","observation_id":"840bcb1f-cfb1-4b76-9202-9cb806b31959","resolution":{"observed_at":"2026-08-01T23:27:42.254293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2209.06866/citation-record","integrity":"/paper/2209.06866/integrity","json":"/paper/2209.06866/citation-record.json","paper":"/paper/2209.06866"},"outbound":[],"paper":{"arxiv_id":"2209.06866","last_updated":"2022-09-14T18:29:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:32:29.432211Z","submitted_at":"2022-09-14T18:29:02Z","title":"Robust Constrained 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2209.06866."}