{"as_of":"2026-08-13T20:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa5862ab5ec259442626938862a2979301974d9e6e440655030b4f1ee8bb4c7f","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:25:28.303493Z","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-13T06:57:27.832583Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.07876","snapshot_observed_at":"2026-08-07T00:25:28.303493Z","title":"Xu and A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.14479","last_updated":"2025-06-17T12:57:33Z","snapshot_observed_at":"2026-08-13T14:12:20.197124Z","submitted_at":"2025-06-17T12:57:33Z","title":"Adaptive Data Augmentation for Thompson Sampling","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:25:28.303493Z"},"links":{"cited_paper":"/paper/2007.07876","citing_paper":"/paper/2506.14479"},"observation_digest":"sha256:3b5ff30c0b8f9cddc84e286645fd6ff72d8082fac2877f62caccb6b18dcee14d","observation_id":"776641db-f322-46dd-a4a2-f70fb83017ad","resolution":{"observed_at":"2026-08-07T00:25:28.303493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits","version":4},"cited_work":{"arxiv_id":"2007.07876","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.07876","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2007.07876 , year=","venue":null,"work_id":"0e854ac4-1f34-4707-acc6-ac1fd0102d5f","year":2007},"citing_paper":{"arxiv_id":"2604.18912","last_updated":"2026-04-20T23:28:22Z","snapshot_observed_at":"2026-07-06T23:05:39.724237Z","submitted_at":"2026-04-20T23:28:22Z","title":"Collaborative Contextual Bayesian Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-10T04:24:55.007678Z"},"links":{"cited_paper":"/paper/2007.07876","citing_paper":"/paper/2604.18912"},"observation_digest":"sha256:145a58d3a29f6819e96a52e770bb33c0af04a1fcec644ff076e2170248d43993","observation_id":"ff1bbcae-a8be-491b-bf27-4df3d8b700a0","resolution":{"observed_at":"2026-05-11T11:56:31.581350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits","version":4},"cited_work":{"arxiv_id":"2007.07876","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.07876","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2007.07876 , year=","venue":null,"work_id":"0e854ac4-1f34-4707-acc6-ac1fd0102d5f","year":2007},"citing_paper":{"arxiv_id":"2605.00393","last_updated":"2026-05-01T04:32:23Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T04:32:23Z","title":"Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-09T20:27:03.746672Z"},"links":{"cited_paper":"/paper/2007.07876","citing_paper":"/paper/2605.00393"},"observation_digest":"sha256:6b5f39f29bc28e8c91c9ce501c915b3fa2ffd16c26ab8eb4629202683188fb61","observation_id":"4c2795f1-68fb-4036-a2f4-fdc823738ef5","resolution":{"observed_at":"2026-05-11T15:16:05.218376Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits","version":4},"cited_work":{"arxiv_id":"2007.07876","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.07876","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2007.07876 , year=","venue":null,"work_id":"0e854ac4-1f34-4707-acc6-ac1fd0102d5f","year":2007},"citing_paper":{"arxiv_id":"2605.12316","last_updated":"2026-05-12T16:01:29Z","snapshot_observed_at":"2026-08-08T17:36:33.886659Z","submitted_at":"2026-05-12T16:01:29Z","title":"Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-13T06:55:33.934110Z"},"links":{"cited_paper":"/paper/2007.07876","citing_paper":"/paper/2605.12316"},"observation_digest":"sha256:c6edb7d52f16e7d22037da2b8d09680f89140542d72ca382861d17ea4b42683d","observation_id":"7893f4e3-5c62-4164-af38-28e1d1053780","resolution":{"observed_at":"2026-05-13T06:57:27.835791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.07876","snapshot_observed_at":"2026-08-01T17:37:57.149787Z","title":"arXiv preprint arXiv:2007.07876 , year=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.17607","last_updated":"2026-08-05T04:57:10Z","snapshot_observed_at":"2026-08-10T17:42:07.622592Z","submitted_at":"2026-07-20T06:53:59Z","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T17:37:57.149787Z"},"links":{"cited_paper":"/paper/2007.07876","citing_paper":"/paper/2607.17607"},"observation_digest":"sha256:67c4b9c0d00f924e59af24b4b2b069a50a08ee8d154cb0d528acff4e35ecdccc","observation_id":"01883a69-2110-459b-a96c-6248783e98c0","resolution":{"observed_at":"2026-08-01T17:37:57.149787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.07876/citation-record","integrity":"/paper/2007.07876/integrity","json":"/paper/2007.07876/citation-record.json","paper":"/paper/2007.07876"},"outbound":[],"paper":{"arxiv_id":"2007.07876","last_updated":"2024-03-09T20:11:36Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T02:39:25.294620Z","submitted_at":"2020-07-15T17:50:46Z","title":"Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2007.07876."}