{"as_of":"2026-08-09T04:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b940a2fa7685708a6ca9af1d3ca1336791c4409be3fc7a1bc8bd56e098c9d52f","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:49.315365Z","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.532739Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.05944","last_updated":"2021-07-02T08:21:07Z","snapshot_observed_at":"2026-08-06T00:52:01.343606Z","submitted_at":"2020-11-11T18:01:59Z","title":"Asymptotically Optimal Information-Directed Sampling","version":4},"cited_work":{"arxiv_id":"2011.05944","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.05944","snapshot_observed_at":"2026-08-07T13:35:52.532739Z","title":"Asymptotically Optimal Information-Directed Sampling","venue":"stat.ML","work_id":"a7599f03-b39c-4948-9dc7-9116d55bc5d3","year":2020},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:49.315365Z"},"links":{"cited_paper":"/paper/2011.05944","citing_paper":"/paper/2505.21841"},"observation_digest":"sha256:370caa9371f18d7aa281894f2465ea56b8560920b830aa1dcd3146402efa13f1","observation_id":"4cc7faf8-aad4-4a61-8a87-fc00818c6150","resolution":{"observed_at":"2026-08-07T13:35:52.598973Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2011.05944/citation-record","integrity":"/paper/2011.05944/integrity","json":"/paper/2011.05944/citation-record.json","paper":"/paper/2011.05944"},"outbound":[],"paper":{"arxiv_id":"2011.05944","last_updated":"2021-07-02T08:21:07Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T00:52:01.343606Z","submitted_at":"2020-11-11T18:01:59Z","title":"Asymptotically Optimal Information-Directed Sampling"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2011.05944."}