{"as_of":"2026-08-09T08:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd8ccfa56939a54f3c6fa418f9599cf131390eb4d4d91e47bafcb379a7f0999f","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T06:57:24.510463Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.04305/citation-record","integrity":"/paper/2606.04305/integrity","json":"/paper/2606.04305/citation-record.json","paper":"/paper/2606.04305"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:ad382ab5b67c51d21c1c73b08fb868ff1526a5a8491e5b24f3a4e2f8365478be","observation_id":"8d5e47cc-5975-49ce-9201-b4f73b8bfe44","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Jump starting bandits with LLM -generated prior knowledge","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:2b95553291922be0a63b63c3788d80f64f10d6111d08f5582dd7a8b17eceb7b6","observation_id":"cb3adeb0-9cde-48b6-86cb-cc16774cd602","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:cf3dcc96a69d4373b8490f5750dfda51d470ef81a6d973c0dd29ed9a5ba4e547","observation_id":"cd17f499-8023-4dae-9419-8ea440741adb","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Bandit online linear optimization with hints and queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:711d187ef99f36cf90167e502c86f6525b149b6cfc89beb046c401bf0646c833","observation_id":"81e49d25-7eae-4c80-8b81-0766da39f630","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Leveraging (biased) information: Multi-armed bandits with offline data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:c051d381247b48f68257db07753f952e593e1f0f10c4b9a9ac468340ebe6c8d3","observation_id":"df477036-392d-4dda-8f83-8adf4a1683b5","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Leveraging initial hints for free in stochastic linear bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:fc884614bf7b46748432af768fd18b5df0a8ab44e23bdd34221440621cbc665a","observation_id":"40c33903-f05f-41f9-82c8-cc5ddb7cfdaf","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Leveraging demonstrations to improve online learning: Quality matters","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:75494894c12bd5b00655ec3a4299f5c11d9e5ac9c43da54f499706a636ff1e35","observation_id":"4ede5438-309c-4020-8c46-5d1f656ff80e","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Learning across the gap: Hybrid multi-armed bandits with heterogeneous offline and online data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:2a43ae6f0e6bfd00c2bf2f8326348bfd077f86c048b184a0b992ef6e4aa42839","observation_id":"b4ec17da-45be-4117-8746-ea74022623a2","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Conservative contextual linear bandits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:04507f4ef86057314c5d4b470f2111549299c3d706040483044e2587056697c6","observation_id":"23a59bf0-3815-422d-be6d-0fdc17f4c2a7","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Bandit algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:3e06e77053eb7bbd709160c87e54a968a3e5d88304c3a229753fc3deaa32463b","observation_id":"17420425-ee18-490c-b91a-06dc741c7334","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Pessimism for offline linear contextual bandits using _p confidence sets","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:19c3298f37d8588a11219ef256ebd0c938e6281eb5e1c834ea918fc473942931","observation_id":"bdf16dc5-bb3f-4860-844c-6b6041a6dcb9","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"A contextual-bandit approach to personalized news article recommendation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:bd7c45a0364e0519c81ab167cc07a51f66c561b85619aae2e8fd7713b117f3e2","observation_id":"31509049-0645-42f3-80fd-19aa45da837c","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08259","last_updated":"2025-03-10T16:30:27Z","snapshot_observed_at":"2026-08-08T05:45:31.100040Z","submitted_at":"2025-02-12T10:05:25Z","title":"Balancing optimism and pessimism in offline-to-online learning","version":2},"cited_work":{"arxiv_id":"2502.08259","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08259","snapshot_observed_at":"2026-07-04T08:49:42.822778Z","title":"Sumo: Search-based uncertainty estimation for model-based offline reinforcement learning","venue":null,"work_id":"26b03739-5b02-423a-9916-691b0abffbd6","year":2025},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"cited_paper":"/paper/2502.08259","citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:94d6fe2280ebb104d1bbcead23dfca340b069c9a3b768e400935cd13566eb885","observation_id":"8b459540-178e-4b47-85ec-3ba033f53549","resolution":{"observed_at":"2026-07-02T07:26:45.903892Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Multi-armed bandit problems with history","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:1ea105a0fa5f8285bcd9dfc7204bb10546f9c82569f8bcc4639129f5248738e0","observation_id":"b273fa15-3ecb-4e7f-badd-46c04c800649","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Spectral bandits for smooth graph functions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:8ecf6f761ab7474587994ecb5a73f8f35d2e530113dffec858c90650faf8aca1","observation_id":"953f1640-8167-49d7-a59b-78174cd13a11","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.08420","last_updated":"2026-05-12T05:33:22Z","snapshot_observed_at":"2026-08-06T03:28:20.367950Z","submitted_at":"2025-08-11T19:14:56Z","title":"Regret minimization in Linear Bandits with offline data via extended D-optimal exploration","version":3},"cited_work":{"arxiv_id":"2508.08420","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.08420","snapshot_observed_at":"2026-07-02T07:26:45.905324Z","title":"Regret minimization in Linear Bandits with offline data via extended D-optimal exploration","venue":"cs.LG","work_id":"9e2b93b7-8737-4e77-a66c-f14d427ddf91","year":2025},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"cited_paper":"/paper/2508.08420","citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:293f8ebfbe50d5c55a4dd770a4ba3a68740e65ba7751dbc5db3c1c35acaca949","observation_id":"8ab6aad4-f164-47e8-a3b4-be7187288a35","resolution":{"observed_at":"2026-07-02T07:26:45.906618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Taking a hint: How to leverage loss predictors in contextual bandits? Conference on Learning Theory, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:bdc270c6175b16535a125eb99de88fd60b060a0603bb12ecf583c1b93e29702e","observation_id":"71d3b1db-1b2d-4617-9273-f82022629a03","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"Conservative bandits","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:606342856a077764e77201318e7d35efccdfba398ece5aefd16c0cabb28b841a","observation_id":"13032a3a-3631-4d76-9536-57157e806b6d","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T06:57:24.510463Z","title":"On the optimality of batch policy optimization algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T06:57:24.510463Z"},"links":{"citing_paper":"/paper/2606.04305"},"observation_digest":"sha256:9cbce492e83a422dd9ac1d8b926082cf360d5f89d1a28c78042137615aa651fc","observation_id":"4ff653a7-ca9b-4f90-b4b4-d3d5bbdcea73","resolution":{"observed_at":"2026-06-28T06:57:24.510463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.04305","last_updated":"2026-06-03T00:18:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T12:02:13.016399Z","submitted_at":"2026-06-03T00:18:46Z","title":"Offline-to-Online Learning in Linear Bandits"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":19},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2606.04305."}