{"as_of":"2026-08-17T02:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fdd6eb58adeb8e0a1649e147d1b6b572457af4b6966746c2d6b9eb67439bcbe0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:35:50.106454Z","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.896960Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.15776","last_updated":"2024-07-19T14:00:43Z","snapshot_observed_at":"2026-08-16T14:15:42.487282Z","submitted_at":"2024-02-24T09:47:46Z","title":"Truly No-Regret Learning in Constrained MDPs","version":3},"cited_work":{"arxiv_id":"2402.15776","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.15776","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Truly No-Regret Learning in Constrained MDPs","venue":null,"work_id":"8934690a-716d-46b8-af5f-e1b9948fbd53","year":2024},"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":55,"source":"arxiv_source","source_observed_at":"2026-05-23T21:58:56.180393Z"},"links":{"cited_paper":"/paper/2402.15776","citing_paper":"/paper/2408.16286"},"observation_digest":"sha256:ab9af714af99cc94b3176421259207a200a91b50b02dde1b96a4ab3adec46ebb","observation_id":"0b112a79-ae19-4585-ad14-1282813a7f50","resolution":{"observed_at":"2026-05-23T22:03:30.898987Z","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":"2402.15776","last_updated":"2024-07-19T14:00:43Z","snapshot_observed_at":"2026-08-16T14:15:42.487282Z","submitted_at":"2024-02-24T09:47:46Z","title":"Truly No-Regret Learning in Constrained MDPs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15776","snapshot_observed_at":"2026-08-07T13:35:50.106454Z","title":"Truly no-regret learning in constrained mdps","venue":null,"work_id":null,"year":2024},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:50.106454Z"},"links":{"cited_paper":"/paper/2402.15776","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:3ac09c1ed4bba8b0add3611823567ad46d89f46f6de8be8bd852c54b246572d3","observation_id":"132bc39d-c3d1-47da-bf21-fd3bedf6e30a","resolution":{"observed_at":"2026-08-07T13:35:50.106454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.15776/citation-record","integrity":"/paper/2402.15776/integrity","json":"/paper/2402.15776/citation-record.json","paper":"/paper/2402.15776"},"outbound":[],"paper":{"arxiv_id":"2402.15776","last_updated":"2024-07-19T14:00:43Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:15:42.487282Z","submitted_at":"2024-02-24T09:47:46Z","title":"Truly No-Regret Learning in Constrained MDPs"},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.15776."}