{"as_of":"2026-08-11T04:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1dc4ed079693469cbc03a2f1dbb44d80ef45c2e4aca2fbd8ba42d94d2184fb7","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:35:50.654786Z","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-07T13:35:52.255278Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.12435","last_updated":"2022-01-05T19:21:00Z","snapshot_observed_at":"2026-07-06T09:00:46.442419Z","submitted_at":"2020-02-27T20:58:39Z","title":"Learning in Markov Decision Processes under Constraints","version":5},"cited_work":{"arxiv_id":"2002.12435","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.12435","snapshot_observed_at":"2026-08-07T13:35:52.255278Z","title":"Learning in Markov Decision Processes under Constraints","venue":"cs.LG","work_id":"8b475650-d4ef-4507-a043-30aee4d71d1f","year":2020},"citing_paper":{"arxiv_id":"2505.21841","last_updated":"2025-05-28T00:16:34Z","snapshot_observed_at":"2026-08-10T12:03:35.177178Z","submitted_at":"2025-05-28T00:16:34Z","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:50.654786Z"},"links":{"cited_paper":"/paper/2002.12435","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:15ea61305219f8f04c968b87de0d728358e377904e2fa45f276c600a859546ee","observation_id":"5435887d-aee8-47e5-be4a-1626685ea8d8","resolution":{"observed_at":"2026-08-07T13:35:52.311657Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.12435/citation-record","integrity":"/paper/2002.12435/integrity","json":"/paper/2002.12435/citation-record.json","paper":"/paper/2002.12435"},"outbound":[],"paper":{"arxiv_id":"2002.12435","last_updated":"2022-01-05T19:21:00Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:00:46.442419Z","submitted_at":"2020-02-27T20:58:39Z","title":"Learning in Markov Decision Processes under Constraints"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2002.12435."}