{"as_of":"2026-08-21T04:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0835f6d72af857db64e437d720dbb50aa67d7c73314174f836af1c446b13ad8e","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T03:27:45.840995Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-04T00:12:45.802687Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-23T03:32:28.420139Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"cited_work":{"arxiv_id":"2502.08208","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08208","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploring Exploration in Bayesian Optimization","venue":"cs.LG","work_id":"cb43e64d-523d-43c6-bbc2-e28f35f62332","year":2025},"citing_paper":{"arxiv_id":"2502.09198","last_updated":"2025-06-10T12:46:41Z","snapshot_observed_at":"2026-08-18T10:36:29.073088Z","submitted_at":"2025-02-13T11:37:55Z","title":"Understanding High-Dimensional Bayesian Optimization","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-23T03:28:16.413359Z"},"links":{"cited_paper":"/paper/2502.08208","citing_paper":"/paper/2502.09198"},"observation_digest":"sha256:9aab492d46b863ff0bb062725fe524ed66f1543cc7636bfb3748abe5a77ee794","observation_id":"71d05d1d-435e-48e7-93bc-7261bd939a4a","resolution":{"observed_at":"2026-05-23T03:32:28.422906Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08208","snapshot_observed_at":"2026-08-04T00:12:45.802687Z","title":"Papenmeier, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02570","last_updated":"2026-07-31T11:30:18Z","snapshot_observed_at":"2026-08-13T22:15:22.553503Z","submitted_at":"2025-11-04T13:44:04Z","title":"Dynamic Priors in Bayesian Optimization for Hyperparameter Optimization","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T00:12:45.802687Z"},"links":{"cited_paper":"/paper/2502.08208","citing_paper":"/paper/2511.02570"},"observation_digest":"sha256:a7932fc1c4df331e0acfd5999d3a026b73a5e4c07ab00e8a78fe047e13232519","observation_id":"88492079-2aa2-4dab-9ad9-f5e5cc448c7c","resolution":{"observed_at":"2026-08-04T00:12:45.802687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08208/citation-record","integrity":"/paper/2502.08208/integrity","json":"/paper/2502.08208/citation-record.json","paper":"/paper/2502.08208"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"PI is back! Switching Acquisition Functions in Bayesian Optimization","venue":null,"work_id":"f63616f7-d136-4eae-8370-d5cd59578096","year":2022},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:36c29e8c95f038838cc814e16c1a7d33d50924eb41588e4d91c25228df6a3789","observation_id":"7449118c-9741-4a1e-9455-173a9e7f0153","resolution":{"observed_at":"2026-05-23T04:05:22.762507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00169","last_updated":"2017-05-16T16:26:48Z","snapshot_observed_at":"2026-08-16T03:24:17.087346Z","submitted_at":"2016-04-01T09:07:26Z","title":"A sequential Monte Carlo approach to Thompson sampling for Bayesian optimization","version":3},"cited_work":{"arxiv_id":"1604.00169","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.00169","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A sequential Monte Carlo approach to Thompson sampling for Bayesian optimization","venue":"stat.ML","work_id":"f56cc26a-b5dd-46ce-8130-1194315be390","year":2016},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"cited_paper":"/paper/1604.00169","citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:bae098fda57dfa821cd83f9090f0073c5fd4ce4f8a20f5938543d53959fd11e5","observation_id":"bb3dd2e2-cfbc-45dd-aa67-2c22f92fe7f4","resolution":{"observed_at":"2026-05-23T03:32:28.747015Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Advanced population diversity measures in genetic programming","venue":null,"work_id":"7c76aca4-f9af-4c1b-9bbf-b97b71733a03","year":2002},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:8763f9c27552b825e3eed33e7bfbe9f7ce0195e63e20bbc6f7902b0858faa32c","observation_id":"54461ed6-5e21-42b3-814c-d49dff320c69","resolution":{"observed_at":"2026-05-23T04:05:22.747055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Cambridge online dictionary","venue":null,"work_id":"d49507df-7564-4ee7-bbb4-80e46bc22047","year":2025},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:dd1617723af97eb7a47429f47eb31b23f98b68cfac30c4ed2b3376bc022b5d09","observation_id":"4d1d2a72-f5ce-42a6-a181-0cbbea572e41","resolution":{"observed_at":"2026-05-23T04:05:22.739210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18756","last_updated":"2025-05-31T04:48:23Z","snapshot_observed_at":"2026-08-16T21:35:19.327302Z","submitted_at":"2025-01-30T21:15:00Z","title":"A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization","version":2},"cited_work":{"arxiv_id":"2501.18756","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.18756","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization","venue":"stat.ML","work_id":"1797e6d3-67c6-468d-85c4-55a8467edfd8","year":2025},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"cited_paper":"/paper/2501.18756","citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:cde2ea12516933b56ad49716788981e065660618505a80a5bebe91a134570f54","observation_id":"57c69585-4f9c-4d4d-aad3-8127720c06a2","resolution":{"observed_at":"2026-05-23T03:32:28.740925Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Accessed: 2025-02-06","venue":null,"work_id":"67284480-8ca2-4417-be22-fc1ef054741b","year":2025},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:f5cd0d62b3bdc224acc51236c87bb14fa0e3f50fb6e9d18ca67204e632cfbf25","observation_id":"5e4de021-81ee-41f7-a155-6cbab179b429","resolution":{"observed_at":"2026-05-23T04:05:22.735682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Towards Gaus- sian process-based optimization with finite time horizon","venue":null,"work_id":"13ab8432-4ffd-4965-a049-c8925d4a814b","year":2010},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:e0a01d1d0641bcda488c1b5eeae0bb1e313e05f34098d7b4bd6a9e2f3b1b7af0","observation_id":"963df5ab-049a-48e9-87f4-4aee5ad6d510","resolution":{"observed_at":"2026-05-23T04:05:22.759706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00772","last_updated":"2023-03-10T09:45:23Z","snapshot_observed_at":"2026-08-16T12:36:28.312560Z","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial","version":2},"cited_work":{"arxiv_id":"1604.00772","doi":"10.48550/arxiv.1604.00772","metadata_source":"pith","pith_arxiv_id":"1604.00772","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The CMA Evolution Strategy: A Tutorial","venue":"cs.LG","work_id":"14b4547d-c2f5-4df0-88d7-c7f931a9cb2d","year":2016},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"cited_paper":"/paper/1604.00772","citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:70de8f66459d47db31b334f3d7c8e248108856ceac144bf27fdc5609a9e73e3c","observation_id":"cc949c93-dcea-4cfc-ba0f-8f4d8e5e1c8a","resolution":{"observed_at":"2026-05-23T03:32:28.729886Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T06:23:10.593752+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T06:23:10.593752+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.2559634","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CMA-ES/pycma on Github","venue":"Zenodo (CERN European Organization for Nuclear Research)","work_id":"599fcf9d-7c2f-423f-9b18-41468b8699ea","year":2019},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:c3f340c3647d15d66710b5fae721750ba3394bae780c70a7712ca7c8e4cc05c0","observation_id":"aa8b2086-e1a9-4e7c-99be-092a290decf7","resolution":{"observed_at":"2026-05-23T03:32:27.608102Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-23T22:53:26.136159+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T22:53:26.136159+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"librosa/librosa: 0.6.3","venue":"Electronic Volyn National University Institutional Repository","work_id":"a2be0426-0f15-4d3d-a62d-9b21d5ec8960","year":2025},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:9cf2f411e0b5525c5d7cfba538c088d76f153d909c0a64f3ed83b449e5a57fb8","observation_id":"4ab83967-3819-4d58-b2ad-a270a6844a4e","resolution":{"observed_at":"2026-05-23T03:32:27.612819Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Analyzing exploration exploita- tion trade-off by means of PI similarity index and dic- tyostelium based genetic algorithm","venue":null,"work_id":"003d749e-8c9a-434c-bdc3-7a32c69ef976","year":2015},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:446252604e4af7f138550fb5b15f84e2db3b3d83cb84997faf8ccaceb5c11ce0","observation_id":"aaf7039f-71a4-4ed5-b898-3b2a05ad763a","resolution":{"observed_at":"2026-05-23T04:05:22.765968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-08-17T00:30:50.886580Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":"1402.6028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-07-04T16:49:57.171090Z","title":"Algorithms for multi-armed bandit problems","venue":"cs.AI","work_id":"a980fe93-ee0f-4b19-9600-f80d85e6e306","year":2014},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:9b0da93988c6ae74ded241d74202338ca72141da45db7833f9d344ee5aba3886","observation_id":"5ddf42b8-a476-4735-81af-7454ff96c086","resolution":{"observed_at":"2026-05-23T03:32:28.735921Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Approximate algorithms for the traveling sales- person problem","venue":null,"work_id":"8825e9a7-108a-486f-9796-aad653a52de9","year":1974},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:61c5725dc5e433da753e90de57e3e4497206f336605d21717e1dea9525339e44","observation_id":"51ae97a4-6735-47ae-b09d-fbb44161790c","resolution":{"observed_at":"2026-05-23T04:05:22.755655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Plan- ning to be surprised: Optimal Bayesian exploration in dynamic environments","venue":null,"work_id":"36c8eeb0-6bf9-4a28-a985-a8f76bde8908","year":2011},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:ec946e4a8987512f0b006a2bdaa5c74a9c0f49e84199cf9c3b96d9fd4a70802b","observation_id":"00256104-e62c-4886-9ac1-a51d5cca3d37","resolution":{"observed_at":"2026-05-23T04:05:22.759128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Virtual library of simulation experiments: Test functions and datasets, optimization test problems","venue":null,"work_id":"af0359fc-6e9c-4ef4-86da-814c93294e1a","year":2024},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:a7c7a182198f356d55eceec38ef8e1a8c085bb9f122db5101a7dbc81fd218fb1","observation_id":"e3349d8a-763e-497b-bd6b-021a64e44996","resolution":{"observed_at":"2026-05-23T04:05:22.767446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Our proof follows from Balogh et al","venue":null,"work_id":"b02bf94d-8747-446d-b07b-a0299fe36c47","year":2024},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:31fab43ac365a961192eb64a3de99b8bab69f57fe1b0d27713ff7f48d3c622c7","observation_id":"eb13e113-05f7-4fba-be0c-db1827bf053d","resolution":{"observed_at":"2026-05-23T04:05:22.771753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"A more recent study [Devroye and Györfi, 2021] presents a consistency result for the KL estimator even when the density function is not smooth","venue":null,"work_id":"11f856e0-9e6d-4a8c-a8ba-4987f5d8a636","year":2021},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:3134210f6b61e0b1c065de1e50589c910dd280abca1a23f8aac960ca640aa554","observation_id":"bd7677cf-323d-44f7-a1ab-0922399dbb7e","resolution":{"observed_at":"2026-05-23T04:05:22.754073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"E RUNTIME ANALYSIS We analyze the runtimes for OTSD and OE","venue":null,"work_id":"be0cecb3-869d-481d-b2ee-b974a2bb3bf4","year":2000},"citing_paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T03:27:45.840995Z"},"links":{"citing_paper":"/paper/2502.08208"},"observation_digest":"sha256:0a3d0a6723c1cf1b49a81ef24c5b532ddb8ccc56ad302b61d28e21cef17ab21b","observation_id":"a6b0daf0-0b02-4ca3-85f8-01ebcd15728f","resolution":{"observed_at":"2026-05-23T04:05:22.756944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08208","last_updated":"2025-02-12T08:38:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T21:46:00.290987Z","submitted_at":"2025-02-12T08:38:37Z","title":"Exploring Exploration in Bayesian Optimization"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":12},"total_outbound_references":18},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 2 inbound Pith citation observations for arXiv:2502.08208."}