{"as_of":"2026-08-08T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8eff68d109079f011b300e513139d308c9893eac6304892088d642d7d8179c6","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-08T06:32:00.761636+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:51.152297Z","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:51.787799Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.02275","last_updated":"2024-10-03T07:54:04Z","snapshot_observed_at":"2026-07-06T19:26:49.672415Z","submitted_at":"2024-10-03T07:54:04Z","title":"Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization","version":1},"cited_work":{"arxiv_id":"2410.02275","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.02275","snapshot_observed_at":"2026-08-07T13:35:51.787799Z","title":"Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization","venue":"cs.LG","work_id":"2acb72e9-0bd0-48be-acb8-fb4795419475","year":2024},"citing_paper":{"arxiv_id":"2505.21841","last_updated":"2025-05-28T00:16:34Z","snapshot_observed_at":"2026-08-07T13:19:25.695756Z","submitted_at":"2025-05-28T00:16:34Z","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:51.152297Z"},"links":{"cited_paper":"/paper/2410.02275","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:35f45de248128948aeb4c126877075d605f13d7a74babcec8ba7ceee21a5a530","observation_id":"b8adca20-6eb5-4929-a697-dde12424916b","resolution":{"observed_at":"2026-08-07T13:35:51.890075Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.02275/citation-record","integrity":"/paper/2410.02275/integrity","json":"/paper/2410.02275/citation-record.json","paper":"/paper/2410.02275"},"outbound":[],"paper":{"arxiv_id":"2410.02275","last_updated":"2024-10-03T07:54:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:26:49.672415Z","submitted_at":"2024-10-03T07:54:04Z","title":"Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2410.02275."}