{"as_of":"2026-08-12T21:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a00ecf41555e321c9910c63275230a99945620a4a5fe2d6018de86258af6247","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:37:21.691697Z","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-07-01T23:56:23.868697Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.05660","last_updated":"2022-10-11T17:56:01Z","snapshot_observed_at":"2026-08-12T15:36:32.196023Z","submitted_at":"2022-10-11T17:56:01Z","title":"The Typical Behavior of Bandit Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05660","snapshot_observed_at":"2026-08-11T17:37:21.691697Z","title":"Fan and P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08843","last_updated":"2025-02-16T06:55:38Z","snapshot_observed_at":"2026-08-12T02:53:12.901098Z","submitted_at":"2024-12-12T00:44:43Z","title":"Precise Asymptotics and Refined Regret of Variance-Aware UCB","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T17:37:21.691697Z"},"links":{"cited_paper":"/paper/2210.05660","citing_paper":"/paper/2412.08843"},"observation_digest":"sha256:f7adf6cdb2a0f2924e7d255eed4a8e432b87cb6e68682b9cd9efdc7d9afc56b9","observation_id":"4026be9f-0931-45d7-8283-d0240b6429a2","resolution":{"observed_at":"2026-08-11T17:37:21.691697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05660","last_updated":"2022-10-11T17:56:01Z","snapshot_observed_at":"2026-08-12T15:36:32.196023Z","submitted_at":"2022-10-11T17:56:01Z","title":"The Typical Behavior of Bandit Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05660","snapshot_observed_at":"2026-08-03T04:12:58.851623Z","title":"and Szepesv´ari, C","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.06014","last_updated":"2026-06-15T18:03:00Z","snapshot_observed_at":"2026-08-09T00:01:52.599079Z","submitted_at":"2026-02-05T18:52:54Z","title":"Optimism Stabilizes Thompson Sampling for Adaptive Inference","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T04:12:58.851623Z"},"links":{"cited_paper":"/paper/2210.05660","citing_paper":"/paper/2602.06014"},"observation_digest":"sha256:a03b09f4a43fb0765df8d3e08a10ffae66b3dafe28d066f79df64b6ca2ebfe1b","observation_id":"f9baa395-1616-41c9-908c-62adf3e2ba0d","resolution":{"observed_at":"2026-08-03T04:12:58.851623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05660","last_updated":"2022-10-11T17:56:01Z","snapshot_observed_at":"2026-08-12T15:36:32.196023Z","submitted_at":"2022-10-11T17:56:01Z","title":"The Typical Behavior of Bandit Algorithms","version":1},"cited_work":{"arxiv_id":"2210.05660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.05660","snapshot_observed_at":"2026-07-01T23:56:23.868697Z","title":"and Glynn, P","venue":null,"work_id":"1fcf8669-cf05-4e39-8d93-4e9744be3b56","year":2022},"citing_paper":{"arxiv_id":"2604.14876","last_updated":"2026-04-16T11:05:30Z","snapshot_observed_at":"2026-07-06T23:02:31.717911Z","submitted_at":"2026-04-16T11:05:30Z","title":"Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-10T10:18:29.242190Z"},"links":{"cited_paper":"/paper/2210.05660","citing_paper":"/paper/2604.14876"},"observation_digest":"sha256:152ce7847fff3fb6328b41dacfa4c3ca48600718cebd3c2b0287f4afb882d10c","observation_id":"65af8657-70cb-41d4-bbb4-4bccc1d8497c","resolution":{"observed_at":"2026-05-10T10:19:19.844855Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05660","last_updated":"2022-10-11T17:56:01Z","snapshot_observed_at":"2026-08-12T15:36:32.196023Z","submitted_at":"2022-10-11T17:56:01Z","title":"The Typical Behavior of Bandit Algorithms","version":1},"cited_work":{"arxiv_id":"2210.05660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.05660","snapshot_observed_at":"2026-07-01T23:56:23.868697Z","title":"and Glynn, P","venue":null,"work_id":"1fcf8669-cf05-4e39-8d93-4e9744be3b56","year":2022},"citing_paper":{"arxiv_id":"2606.01655","last_updated":"2026-06-01T04:08:05Z","snapshot_observed_at":"2026-08-09T20:22:10.436317Z","submitted_at":"2026-06-01T04:08:05Z","title":"MINTS: Minimalist Thompson Sampling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T13:48:09.661620Z"},"links":{"cited_paper":"/paper/2210.05660","citing_paper":"/paper/2606.01655"},"observation_digest":"sha256:1d28b6e78f840f1439b61abc9d0e752489486241def4061a1c4ff41fe63358a5","observation_id":"1fde4d07-6c95-43cf-8f94-32698fb43047","resolution":{"observed_at":"2026-07-01T23:56:23.870585Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.05660/citation-record","integrity":"/paper/2210.05660/integrity","json":"/paper/2210.05660/citation-record.json","paper":"/paper/2210.05660"},"outbound":[],"paper":{"arxiv_id":"2210.05660","last_updated":"2022-10-11T17:56:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T15:36:32.196023Z","submitted_at":"2022-10-11T17:56:01Z","title":"The Typical Behavior of Bandit Algorithms"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2210.05660."}