{"as_of":"2026-08-21T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2790d494d442b2ad335908624de7c61f6c0f2eb27127c270d83ddda8cf3e06e4","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:46:01.741027Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2506.10091/citation-record","integrity":"/paper/2506.10091/integrity","json":"/paper/2506.10091/citation-record.json","paper":"/paper/2506.10091"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.276374Z","title":"Gaussian process optimization in the bandit setting: no regret and experimental design","venue":null,"work_id":"80b8cf51-b7dd-4ad0-8098-7c77f588236b","year":2010},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:57.811099Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:8368b5d7f35ff6f37ea4dd255b90bbde386c17d0e2751114c8835fa7d8bfb6b3","observation_id":"ac9f0478-c8d9-4ed4-99ce-83f69f1140f6","resolution":{"observed_at":"2026-08-07T04:46:02.279710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.265916Z","title":"On kernelized multi-armed bandits","venue":null,"work_id":"45a17514-43e1-4734-9f97-c542cc0f30e9","year":2017},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:57.857980Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:8f2a293d3d48dd5666d2f0cf21d322218eb19193bc29dfcb4e5b8b1205b04f27","observation_id":"e35f878c-eb4b-4fe5-a69d-aa6dc74b6d5c","resolution":{"observed_at":"2026-08-07T04:46:02.269189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.255872Z","title":"On the sublinear regret of GP-UCB","venue":null,"work_id":"616d34f4-1ae9-48b7-a7ee-cb23ace9655d","year":2023},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:57.963662Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:1b36c393c4ab7b66ec989229d1ed57e26876da3a57d983f61eb9e7a01d100cc3","observation_id":"d9f4c71e-1a0a-425f-8973-d3640b604f91","resolution":{"observed_at":"2026-08-07T04:46:02.259292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.245724Z","title":"Survey on Applications of Multi-Armed and Contextual Bandits","venue":null,"work_id":"22566f96-3918-4b08-b292-d4ead0e277de","year":2020},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.046651Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:952fa3b93ac65e4f8a308701c1d60458031895f14067d77ca8c366e86a62d5ea","observation_id":"58068e6a-0423-484b-b3b5-afe6502c5ef7","resolution":{"observed_at":"2026-08-07T04:46:02.248991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-07T04:45:58.137874Z","title":"Bayesian Optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.137874Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:f1d1c84db4c4c595068862a2a93289e7330ae8bbcf0fc39625e599be4fb5fa36","observation_id":"e9612ff5-e674-4a14-97b8-69b0ecc8e843","resolution":{"observed_at":"2026-08-07T04:45:58.137874Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.230186Z","title":"Gaussian processes for machine learning","venue":null,"work_id":"d0247485-3f2a-4f0d-83e1-fdab9488dc90","year":2004},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.232489Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:d2caa1b317b86be324bf25184bff7f1db6f5917a19b25629e4e87045a78daec3","observation_id":"a7a99ec8-4833-415f-96c9-dbefe131565b","resolution":{"observed_at":"2026-08-07T04:46:02.232979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.220009Z","title":"Finite-time analysis of the multi-armed bandit problem","venue":null,"work_id":"6e407293-a1b5-4a33-81c8-76e426569da8","year":2002},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.326724Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:0736ab4c531620069295b40691034b034bb6a6f01e82f358064fc4d4da1f47c0","observation_id":"a7842652-697f-4527-a289-b28f61237784","resolution":{"observed_at":"2026-08-07T04:46:02.223225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.210141Z","title":"Near-optimal regret bounds for Thompson Sampling","venue":null,"work_id":"5f8dc74f-f35c-417f-ac6f-36e3424610ba","year":2017},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.426562Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:94c34b35495b6a21201cedd8fa61ad07462e6716f0c2c30f963bad5afebb51e9","observation_id":"55722ab6-9d24-4bf1-bf1a-334b7e37c3f9","resolution":{"observed_at":"2026-08-07T04:46:02.214023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.200147Z","title":"Thompson Sampling for contextual bandits with linear payoffs","venue":null,"work_id":"c1e16dc6-33dd-43ac-b41a-2831fa2824ce","year":2013},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.514275Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:17c4f48e4c49e82a4f780f3793785cff97ba75497f140aae4f1a9abac995c692","observation_id":"47f99c5d-2c01-40c0-b5b7-a2a55b382574","resolution":{"observed_at":"2026-08-07T04:46:02.203309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.191451Z","title":"Contextual bandits with linear payoff functions","venue":null,"work_id":"0c7d89b1-ccbb-45bf-8091-2f0c4c778efb","year":2011},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.617544Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:562617721bf262768381b1bd454b21bf81d25f7dbe9adad71928b892c10e5788","observation_id":"b61e87f6-e823-47a6-8d2a-2f6bb761bdc5","resolution":{"observed_at":"2026-08-07T04:46:02.194296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.182622Z","title":"Finite-time analysis of kernelised contextual bandits","venue":null,"work_id":"fff7db06-2ea4-46f2-a9c4-d5ff4e1223b4","year":2013},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.693752Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:891f85650eabe12f58ead10bfec501c6d2f2dba525f1036b2e15969e46ed3654","observation_id":"181345e8-5955-4fed-8bfd-8fb6d7bfd835","resolution":{"observed_at":"2026-08-07T04:46:02.185521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.173712Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"6c6797c5-d39b-4712-8d2d-38f56cebc059","year":2011},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.770101Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:f5564fb006dd163e7da9d26b223237b0eea0cf2801fe91952fe7464aabf47179","observation_id":"a0883603-8c44-48e2-87c8-9649ac39756f","resolution":{"observed_at":"2026-08-07T04:46:02.176738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.163654Z","title":"Lower bounds for time-varying kernelized bandits","venue":null,"work_id":"fea92223-3839-4365-82b3-a07ae56baac3","year":2025},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:58.873907Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:1ca583690b8697663a1175c988b49428250335bfaa44a0ed4316f4cfa29ddaf8","observation_id":"3cc2c4b6-25bf-4bee-bf08-15c93caae340","resolution":{"observed_at":"2026-08-07T04:46:02.166983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.058335Z","title":"Lower bounds on regret for noisy gaus- sian process bandit optimization","venue":null,"work_id":"1c80524a-f9c5-4e2b-98d5-374e31c8c2b8","year":2017},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.033924Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:0bdef80a51f01104f360f10f1fa9eed5287e3a1b7bc8e4547891a51ce5eef6a3","observation_id":"4e95f8fa-31f0-43ff-8908-4e7493103daa","resolution":{"observed_at":"2026-08-07T04:46:02.061821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.049240Z","title":"Random exploration in Bayesian optimization: Order-optimal regret and computational efficiency","venue":null,"work_id":"969b7ae7-3dab-4f24-a065-c47d9dd043b0","year":2024},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.145718Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:328cb4797ec261e63a99364396bc55b7234911c5e17160206f208af8f8435703","observation_id":"064e231f-9bca-4547-a93a-6e3bcc759d13","resolution":{"observed_at":"2026-08-07T04:46:02.052268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.039529Z","title":"Gaussian process bandit optimization with few batches","venue":null,"work_id":"9d82339d-dc23-4404-bfa2-fc425eb2ece5","year":2022},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.277336Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:22a65b5706309090b91ad678385ec1a0a9be06c6e5fa97ef7b76f9ed710607f5","observation_id":"be8f8d7b-77de-4c1e-a54b-6f50b12f1fad","resolution":{"observed_at":"2026-08-07T04:46:02.043410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.031001Z","title":"UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem","venue":null,"work_id":"26457675-a8b1-4eda-9ea5-d02a9aa64033","year":2010},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.449961Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:ae8fc31fb8ec9730ac71f8bff203095e93ab95d499172919b5ac861463519acc","observation_id":"70b019a5-a807-43a7-a10a-490d80653f98","resolution":{"observed_at":"2026-08-07T04:46:02.034019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.021769Z","title":"Using confidence bounds for exploitation-exploration trade-offs","venue":null,"work_id":"1bf5596a-6c72-4559-855f-8fddc905ba27","year":2002},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.562042Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:96d23c5240e9075e26363a5f90985f6920b9101a77b1c0e881dea98b2fc072ca","observation_id":"61b4d054-8d37-4693-927b-bcecefd0a81b","resolution":{"observed_at":"2026-08-07T04:46:02.025035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.012450Z","title":"On information gain and regret bounds in gaussian process bandits","venue":null,"work_id":"41feb12c-9fa5-42de-ab97-3d683bba8213","year":2021},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.679156Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:8b668b5cdb62246ec7f944dcccd2aa3fe9d868de6d80c3b0f82d659ac4ea664e","observation_id":"ad342119-8821-49cf-b980-26a45c694f5d","resolution":{"observed_at":"2026-08-07T04:46:02.015654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:02.002364Z","title":"Bandit optimisation of functions in the Matérn kernel RKHS","venue":null,"work_id":"75e0e5b4-786d-4e28-a90a-3deb8de9d745","year":2020},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.789692Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:232e5d7a16593ec8cc6667ccb66157f05a512726400deb57d0eaf7c5085a577a","observation_id":"ea31f964-4b2d-406d-acdd-aae189f2e79b","resolution":{"observed_at":"2026-08-07T04:46:02.006384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.991133Z","title":"Gaussian process bandits with adaptive discretization","venue":null,"work_id":"bdd8b34d-7cc0-4f57-94f9-528b305710dd","year":2018},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:59.898791Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:b3fe8567e72de2a3934d5e14c6a599817281421680d0afd9c0ee4a3b840757e4","observation_id":"3fd3f7a6-b9a6-45ff-bc6f-04d4a6938480","resolution":{"observed_at":"2026-08-07T04:46:01.996346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.982232Z","title":"Instance dependent regret analysis of kernelized ban- dits","venue":null,"work_id":"19eee61b-e822-43da-b82c-d5833db54afc","year":2022},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.007945Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:ca4e53916473f3a274e6b01e778b8ddeb07f0fcdbf19012b0a1afafaebbef337","observation_id":"b567f476-59c0-4ec3-b10d-650dbece307a","resolution":{"observed_at":"2026-08-07T04:46:01.985287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.972616Z","title":"A lower bound for linear and kernel regression with adaptive covariates","venue":null,"work_id":"52b37190-16fe-4410-ad7a-4a9705337d64","year":2023},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.090819Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:3dcd2d061c14f1e798cff7720aad4c7387fa28113d0e7c948e9fcfbbde6ea58f","observation_id":"eb5c8f29-9ce1-42e0-892c-58f98570ace1","resolution":{"observed_at":"2026-08-07T04:46:01.975855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.963543Z","title":"Open problem: Regret bounds for noise-free kernel-based bandits","venue":null,"work_id":"5e27d762-256d-4cd3-9fdd-58146f98bd1d","year":2022},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.205626Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:9334da3ea686c0fc7f900a6d41e6c72e4f0f9968f414e09349e6c98640dd932a","observation_id":"6513dc3f-4d5b-46d6-a103-0dfda6caa95e","resolution":{"observed_at":"2026-08-07T04:46:01.966954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.954862Z","title":"Optimal order simple regret for Gaussian process bandits","venue":null,"work_id":"52778cb2-f70f-489f-98dc-bf71e9829af7","year":2021},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.264749Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:c14cf14d516ce7b53e850034e826b163bed032eec8419fbb15d777bca4033046","observation_id":"5e5c53be-066d-41ff-a6ef-c810bfd46084","resolution":{"observed_at":"2026-08-07T04:46:01.957752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.946058Z","title":"Open problem: Tight online confidence intervals for RKHS elements","venue":null,"work_id":"07fd39a9-9b14-4ed9-9dc1-54cfee77fe13","year":2021},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.347621Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:4b1252d6a67d41fac57e3e20e8616770d6bb93d1dcf6a787ea88891d60043b8c","observation_id":"ad95c9f5-2989-4784-87f9-a66afd900127","resolution":{"observed_at":"2026-08-07T04:46:01.949147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.936710Z","title":"Open problem: Order optimal regret bounds for kernel-based reinforcement learning","venue":null,"work_id":"b00f1ef4-8185-4135-bb08-84a71cc3c903","year":2024},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.480258Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:875c8ce0ad7a8aebdf5138fbaf5e3a6248dbf8edbc64e08263eab7c6db4ff870","observation_id":"05b5675c-920b-4951-bd95-3eab25ce263e","resolution":{"observed_at":"2026-08-07T04:46:01.939764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.927074Z","title":"Bayesian optimization under heavy-tailed payoffs","venue":null,"work_id":"ff464a24-433b-487e-9526-9ba2b40b6fdc","year":2019},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.590318Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:16eafb4f98e85743db7f5229746f67e8131d22e8a6a914805feb07e5ab305019","observation_id":"baa734fc-1c5a-4f01-a8ee-49f1a194a84d","resolution":{"observed_at":"2026-08-07T04:46:01.930792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.917999Z","title":"Multi-scale zero-order optimization of smooth functions in an RKHS","venue":null,"work_id":"d9b69906-15dc-4563-802f-9d047d069610","year":2022},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.683372Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:791651c1ef32f3062c0b4904ba007b12095ab523cfa56edb01d156298c3d0cc7","observation_id":"b05d556d-144b-4129-805e-a2fa605e1fae","resolution":{"observed_at":"2026-08-07T04:46:01.921611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.908818Z","title":"Streaming kernel regression with provably adaptive mean, variance, and regularization","venue":null,"work_id":"8c6f47fc-7005-45a3-bfd1-865279caf6ae","year":2018},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.806096Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:fa172d5cea328678746c1991660b39992b0ad29c9ed38de83f80377ee42cb094","observation_id":"ee71ede7-1ede-46cb-8ddd-97682d6c99e0","resolution":{"observed_at":"2026-08-07T04:46:01.911930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12732","last_updated":"2024-11-11T16:50:48Z","snapshot_observed_at":"2026-08-16T14:08:23.733437Z","submitted_at":"2024-03-19T13:47:35Z","title":"Tighter Confidence Bounds for Sequential Kernel Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12732","snapshot_observed_at":"2026-08-07T04:46:00.900457Z","title":"Tighter confidence bounds for sequential kernel regression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:00.900457Z"},"links":{"cited_paper":"/paper/2403.12732","citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:2abb3195ee0d2e55bf1888434dfd7ce0f6b0c541ffc2f01011a24e133dad93e7","observation_id":"99b56138-3c06-43d5-af6f-f3b2c707c626","resolution":{"observed_at":"2026-08-07T04:46:00.900457Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.899577Z","title":"Enhancing Gaussian process surrogates for optimiza- tion and posterior approximation via random exploration","venue":null,"work_id":"62e2412d-24f1-456e-8eb9-dc725e2289ba","year":2025},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.018914Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:7557841e3b15b3bac39a1433689aca71c249939ff0061483fab1ca2628d58446","observation_id":"51b3726b-c17e-4ac1-8805-fc5eb46c19b4","resolution":{"observed_at":"2026-08-07T04:46:01.903131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.890123Z","title":"Worst-case regret bounds for exploration via randomized value functions","venue":null,"work_id":"c8bf5bb6-b9e0-4bab-ac14-0080b70d6cf8","year":2019},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.134500Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:cdb4f597d939dbb252d0303492c02f2aa2c2f23c0fe9825f262ba5daa4b9a3f7","observation_id":"c5441646-0fb9-451e-bd4f-451fab7ba94b","resolution":{"observed_at":"2026-08-07T04:46:01.893918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.881411Z","title":"Near-optimal ran- domized exploration for tabular markov decision processes","venue":null,"work_id":"d0695184-d8a6-46a3-ab1b-27af2194a2e1","year":2022},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.305531Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:75b0e903da4846cf1c3bbb7a587faf251726ac3fc98a21c34dae224acd798789","observation_id":"fe5e59a2-864d-42f7-98f6-bf7393459279","resolution":{"observed_at":"2026-08-07T04:46:01.884788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.871281Z","title":"A data fusion approach to optimize compositional stability of halide perovskites","venue":null,"work_id":"76c8d9b2-88e9-48e4-acb7-598b0cbccd27","year":2021},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.482207Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:669174b6d539695552bf7e70e529623874191212837c5a53ffa74814d470d01a","observation_id":"07b308ca-f693-4b4c-87c5-2cc6e28483ec","resolution":{"observed_at":"2026-08-07T04:46:01.875367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.862814Z","title":null,"venue":null,"work_id":"9ecf46ff-1803-4834-9511-b8e1a9b023c8","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.551185Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:5ebdcfd5212af2fa134a957e93658e4862e798199a039ba0a4c383d004db968d","observation_id":"12071d60-4423-4058-94c8-e27fccdf183c","resolution":{"observed_at":"2026-08-07T04:46:01.865525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.854305Z","title":null,"venue":null,"work_id":"3182e0d2-5a9e-4c1f-a186-05f70c5c7091","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.630319Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:a580ab2cafed20bf752508acdd5097d1e17d13fab3f9fdc2b7f8e4b5a4aaeba3","observation_id":"f73b772b-c390-4e9f-866f-50afcb79a533","resolution":{"observed_at":"2026-08-07T04:46:01.857203Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.845523Z","title":null,"venue":null,"work_id":"5f6c8a47-c546-4aff-8841-85e57f7b50d7","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.683471Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:c0aab4176e5724299535f159111549c89a21ad761461604b8b86dc93cb16a5c2","observation_id":"a5f49d59-040a-4003-902e-9dd14ce20e53","resolution":{"observed_at":"2026-08-07T04:46:01.848275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.837002Z","title":null,"venue":null,"work_id":"de70e463-223e-41a5-875d-f572a807c679","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.720375Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:66c383539e65e877b5f3e3c1f821a2488a2c19fb1f52c63a5b64a79117acd9f3","observation_id":"e53ca195-9721-4228-84ef-26f5916259a9","resolution":{"observed_at":"2026-08-07T04:46:01.839817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.826254Z","title":"V −1/2 t−1 K(·, Xt) · s 2R2 log q det V t−1 /δ + D !# ≤(c) p 2R2γT + 2R2 ln(1/δ) + D E TP t=1 V −1/2 t−1 K(·, Xt) ≤(d) p 2R2γT + 2R2 ln(1/δ) + D E","venue":null,"work_id":"7e27dff9-2bcc-4240-8ef0-1d17596a7190","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.723495Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:6289e1b813e149d85850c4630962a664c6e951ef9a3b5fd90033759b4c13c0e2","observation_id":"b4ffc44e-a4ab-4c17-89df-8cf9e6efb814","resolution":{"observed_at":"2026-08-07T04:46:01.830038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.816935Z","title":null,"venue":null,"work_id":"eb3b9c28-1b9f-4bc9-a17e-0063d260ff26","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.728038Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:89a542cef9e00e3916b6f5ed75eddc6a9b32c4ac541fc2cef369c1fe0ecc7c82","observation_id":"91480f40-3ccd-42da-97ef-1055631ad409","resolution":{"observed_at":"2026-08-07T04:46:01.819841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.807808Z","title":"ghost sample","venue":null,"work_id":"69dbf5b2-ceb8-43e2-8c1c-f8f3dc461c0e","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.731351Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:e781f174225e2fc6e032ce765c8280d83f56fc7fac2307ad9009fce10fe9687c","observation_id":"fa89416a-5847-4fca-ab9d-95418662778d","resolution":{"observed_at":"2026-08-07T04:46:01.810955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.797935Z","title":null,"venue":null,"work_id":"2bec90c0-833a-42b0-b18b-98bd36562e14","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.734516Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:513aeeeac775791d9a3fb5dc693c40bea614016b69afab23aae0617d29ba11e9","observation_id":"31b43904-b668-4537-a88f-310e0009a1a8","resolution":{"observed_at":"2026-08-07T04:46:01.801329Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.788193Z","title":null,"venue":null,"work_id":"c2819dd9-9527-4b57-9291-5272edcd88d2","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.737731Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:e7909a09f71116f4ed96ed116141cf23c3565cb6c59f7d5a9315804393909f2e","observation_id":"4ae607ed-ee25-48d7-a879-4e24545d7b1a","resolution":{"observed_at":"2026-08-07T04:46:01.791451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:46:01.776172Z","title":"Construct a learning problem instance","venue":null,"work_id":"fc5eed0f-136a-4a24-9439-c51e92be331b","year":null},"citing_paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:46:01.741027Z"},"links":{"citing_paper":"/paper/2506.10091"},"observation_digest":"sha256:d91fefc44be60a806e7b0530823171aed7ec84464c931bd494ab4c7e2d1879ad","observation_id":"895938c1-c99d-4b42-85c3-21676c70aa25","resolution":{"observed_at":"2026-08-07T04:46:01.781274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10091","last_updated":"2025-06-11T18:23:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-21T21:21:12.659574Z","submitted_at":"2025-06-11T18:23:43Z","title":"Efficient kernelized bandit algorithms via exploration distributions"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":45},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2506.10091."}