{"as_of":"2026-08-16T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b79943d44d8e1a260897728fa61132c2462b79dd0d8c5b7c77ab4a24a4011164","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-15T06:32:42.880941+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-03T09:55:51.101038Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.09869","last_updated":"2020-02-23T09:10:14Z","snapshot_observed_at":"2026-08-13T20:34:42.355159Z","submitted_at":"2020-02-23T09:10:14Z","title":"Near-optimal Regret Bounds for Stochastic Shortest Path","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.09869","snapshot_observed_at":"2026-08-03T09:55:51.101038Z","title":"arXiv preprint arXiv:2002.09869 , year=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.29294","last_updated":"2026-07-31T11:12:31Z","snapshot_observed_at":"2026-08-13T20:34:15.935730Z","submitted_at":"2026-07-31T11:12:31Z","title":"Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T09:55:51.101038Z"},"links":{"cited_paper":"/paper/2002.09869","citing_paper":"/paper/2607.29294"},"observation_digest":"sha256:5559ed86fb1dc933969ad3eb6cc9a7bad17f378b61b3f229ed22201669c939b4","observation_id":"a2c4b5df-29ed-4a17-a0b7-ec9dcf8c2b51","resolution":{"observed_at":"2026-08-03T09:55:51.101038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.09869/citation-record","integrity":"/paper/2002.09869/integrity","json":"/paper/2002.09869/citation-record.json","paper":"/paper/2002.09869"},"outbound":[],"paper":{"arxiv_id":"2002.09869","last_updated":"2020-02-23T09:10:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T20:34:42.355159Z","submitted_at":"2020-02-23T09:10:14Z","title":"Near-optimal Regret Bounds for Stochastic Shortest Path"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2002.09869."}