{"as_of":"2026-08-08T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9676c915a177d1fa783b869759a930be2898a6bf3ed0aa43c57a4902f62da004","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-08T06:32:00.761636+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-05T21:34:29.277153Z","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-01T21:36:15.095575Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.06790","last_updated":"2023-04-20T21:35:31Z","snapshot_observed_at":"2026-07-06T09:28:16.483371Z","submitted_at":"2020-06-11T20:19:41Z","title":"On Frequentist Regret of Linear Thompson Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.06790","snapshot_observed_at":"2026-08-05T21:34:29.277153Z","title":"On worst-case regret of linear thompson sampling.arXiv preprint arXiv:2006.06790,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-07T12:16:45.804784Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.277153Z"},"links":{"cited_paper":"/paper/2006.06790","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:6c02e4552ca6561d81e4e15c4988a54adb1a23c000d57fcf08f1585a7077c2f2","observation_id":"a9dcd4b8-2629-4e3d-adee-59b9053a8190","resolution":{"observed_at":"2026-08-05T21:34:29.277153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06790","last_updated":"2023-04-20T21:35:31Z","snapshot_observed_at":"2026-07-06T09:28:16.483371Z","submitted_at":"2020-06-11T20:19:41Z","title":"On Frequentist Regret of Linear Thompson Sampling","version":3},"cited_work":{"arxiv_id":"2006.06790","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.06790","snapshot_observed_at":"2026-07-01T21:36:15.095575Z","title":"arXiv preprint arXiv:2006.06790 , year=","venue":null,"work_id":"0c3bedf9-3e12-42a7-adec-fb2c373ad609","year":2006},"citing_paper":{"arxiv_id":"2606.00984","last_updated":"2026-05-31T03:46:16Z","snapshot_observed_at":"2026-08-02T06:06:46.486146Z","submitted_at":"2026-05-31T03:46:16Z","title":"Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates","version":1},"reference_index":179,"source":"arxiv_source","source_observed_at":"2026-06-28T16:43:54.405426Z"},"links":{"cited_paper":"/paper/2006.06790","citing_paper":"/paper/2606.00984"},"observation_digest":"sha256:abc54ead715f0a14d61d5286953d77ea7e188f232feadd08da73b6e9a3ad7d4b","observation_id":"565528fe-6b14-4cc7-ac4a-23401cdb4c9e","resolution":{"observed_at":"2026-07-01T21:36:15.097239Z","resolver_source":"arxiv_id","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/2006.06790/citation-record","integrity":"/paper/2006.06790/integrity","json":"/paper/2006.06790/citation-record.json","paper":"/paper/2006.06790"},"outbound":[],"paper":{"arxiv_id":"2006.06790","last_updated":"2023-04-20T21:35:31Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:28:16.483371Z","submitted_at":"2020-06-11T20:19:41Z","title":"On Frequentist Regret of Linear Thompson 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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.06790."}