{"as_of":"2026-08-08T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d638b69f7e0315a46e194c0f46f2fdbd8aeb824a5d53ef065006924d7c68ec7","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-07T06:34:17.273281+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-05T22:45:20.354085Z","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-05T22:45:21.150231Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.03186","last_updated":"2023-03-21T10:04:25Z","snapshot_observed_at":"2026-07-06T12:44:56.137182Z","submitted_at":"2022-03-07T07:44:05Z","title":"Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm","version":2},"cited_work":{"arxiv_id":"2203.03186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.03186","snapshot_observed_at":"2026-08-05T22:45:21.150231Z","title":"Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm","venue":"cs.LG","work_id":"2609c28c-1ec2-4177-9998-6c3ff8875b6b","year":2022},"citing_paper":{"arxiv_id":"2508.06443","last_updated":"2025-08-08T16:36:16Z","snapshot_observed_at":"2026-08-05T22:45:18.658603Z","submitted_at":"2025-08-08T16:36:16Z","title":"The Fair Game: Auditing & Debiasing AI Algorithms Over Time","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T22:45:20.354085Z"},"links":{"cited_paper":"/paper/2203.03186","citing_paper":"/paper/2508.06443"},"observation_digest":"sha256:80cb75cf96a359d0236322346d55a74571d8da8649a8ccafd786c95596e417c8","observation_id":"e3294c8f-955a-4adc-a889-e64343286cf8","resolution":{"observed_at":"2026-08-05T22:45:21.155089Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.03186/citation-record","integrity":"/paper/2203.03186/integrity","json":"/paper/2203.03186/citation-record.json","paper":"/paper/2203.03186"},"outbound":[],"paper":{"arxiv_id":"2203.03186","last_updated":"2023-03-21T10:04:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:44:56.137182Z","submitted_at":"2022-03-07T07:44:05Z","title":"Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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:2203.03186."}