{"as_of":"2026-08-19T14:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4437d540c1a6e8fe2c150e8c3a0027038c70415e33d1c473d2508aaaf75bcd2","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T10:58:56.297484Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T13:01:34.241104Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.06811","last_updated":"2022-07-10T02:02:58Z","snapshot_observed_at":"2026-08-16T17:00:27.563806Z","submitted_at":"2022-05-13T17:58:58Z","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06811","snapshot_observed_at":"2026-08-08T10:58:56.297484Z","title":"Nearly optimal algorithms for linear contextual bandits with adversarial corruptions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.297484Z"},"links":{"cited_paper":"/paper/2205.06811","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:b84d0224436a57048b6df2ac1fbcaa325abff28b8500b9445634fbd8badf434c","observation_id":"70fdc965-5861-4d41-b4e6-5b67fd48e066","resolution":{"observed_at":"2026-08-08T10:58:56.297484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06811","last_updated":"2022-07-10T02:02:58Z","snapshot_observed_at":"2026-08-16T17:00:27.563806Z","submitted_at":"2022-05-13T17:58:58Z","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","version":2},"cited_work":{"arxiv_id":"2205.06811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.06811","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nearly optimal algorithms for linear contextual bandits with adversarial corruptions","venue":null,"work_id":"87415cdd-5b59-49fc-ad1c-d77d502606a1","year":2022},"citing_paper":{"arxiv_id":"2509.08933","last_updated":"2026-05-21T17:37:36Z","snapshot_observed_at":"2026-08-18T15:35:48.669340Z","submitted_at":"2025-09-10T18:56:39Z","title":"Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-22T12:58:26.626172Z"},"links":{"cited_paper":"/paper/2205.06811","citing_paper":"/paper/2509.08933"},"observation_digest":"sha256:a4d6c099e95eb79e1ab313dd3a39ab64359e6f90164d5dd8c96504b4b8fc0acd","observation_id":"d17e7e4e-7182-4aee-80d3-c3abb32558bf","resolution":{"observed_at":"2026-05-22T13:01:34.244559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.06811/citation-record","integrity":"/paper/2205.06811/integrity","json":"/paper/2205.06811/citation-record.json","paper":"/paper/2205.06811"},"outbound":[],"paper":{"arxiv_id":"2205.06811","last_updated":"2022-07-10T02:02:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:00:27.563806Z","submitted_at":"2022-05-13T17:58:58Z","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.06811."}