{"as_of":"2026-08-10T10:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2819471ceaf9d5e97a42be92585560887c1658b0e9005360510eac4af7373a5","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:48.002331Z","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:53.242866Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.05284","last_updated":"2021-06-14T07:13:54Z","snapshot_observed_at":"2026-08-09T03:52:44.623387Z","submitted_at":"2021-02-10T06:33:04Z","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","version":2},"cited_work":{"arxiv_id":"2102.05284","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.05284","snapshot_observed_at":"2026-08-07T13:35:53.242866Z","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","venue":"cs.LG","work_id":"ab897678-bbfc-4318-be3c-a0c3b8b6c53b","year":2021},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:48.002331Z"},"links":{"cited_paper":"/paper/2102.05284","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:e6629d3a89f0d1f365cea23d61e307e68d6fd37e9e983b82e032b3e4a674ae2d","observation_id":"3347a759-18a2-4458-a690-11666c403118","resolution":{"observed_at":"2026-08-07T13:35:53.355079Z","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/2102.05284/citation-record","integrity":"/paper/2102.05284/integrity","json":"/paper/2102.05284/citation-record.json","paper":"/paper/2102.05284"},"outbound":[],"paper":{"arxiv_id":"2102.05284","last_updated":"2021-06-14T07:13:54Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T03:52:44.623387Z","submitted_at":"2021-02-10T06:33:04Z","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2102.05284."}