{"as_of":"2026-08-09T14:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b621779f92fd86a772b8dd72b37841d2349a074a6c60b4dea413b04fe4f5d4a","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-09T06:31:02.800959+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:48.792791Z","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.691095Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.14326","last_updated":"2024-08-29T06:17:11Z","snapshot_observed_at":"2026-07-06T15:20:53.397829Z","submitted_at":"2023-04-27T16:58:29Z","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","version":2},"cited_work":{"arxiv_id":"2304.14326","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.14326","snapshot_observed_at":"2026-08-07T13:35:52.691095Z","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","venue":"cs.LG","work_id":"2068b860-f1f8-47aa-935d-32096eb9e9a0","year":2023},"citing_paper":{"arxiv_id":"2505.21841","last_updated":"2025-05-28T00:16:34Z","snapshot_observed_at":"2026-08-09T03:52:43.737009Z","submitted_at":"2025-05-28T00:16:34Z","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:48.792791Z"},"links":{"cited_paper":"/paper/2304.14326","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:a508327db5a7cacc6c8c8604a0c292827b42029c2df841c20f505dc7e2dad95d","observation_id":"3ad0cfde-e1bf-4a66-b104-c999d0353657","resolution":{"observed_at":"2026-08-07T13:35:52.838965Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2304.14326/citation-record","integrity":"/paper/2304.14326/integrity","json":"/paper/2304.14326/citation-record.json","paper":"/paper/2304.14326"},"outbound":[],"paper":{"arxiv_id":"2304.14326","last_updated":"2024-08-29T06:17:11Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:20:53.397829Z","submitted_at":"2023-04-27T16:58:29Z","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term 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-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 1 inbound Pith citation observation for arXiv:2304.14326."}