{"as_of":"2026-08-20T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0c4b234e35aea0e87eedc3dc734c1e654d1ab16638edc54acf4c52ae66ed434","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T20:20:43.894093Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2605.00237/citation-record","integrity":"/paper/2605.00237/integrity","json":"/paper/2605.00237/citation-record.json","paper":"/paper/2605.00237"},"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":"Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Ey- tan Bakshy","venue":null,"work_id":"94c521ca-ebbe-47f2-af54-6b1560d086e8","year":2020},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:b8401bd3f23c921eabc753f8d23c047cb8107cba92315d567da855762d39956d","observation_id":"f04610bf-e698-4a6e-9a80-89c2c7477f48","resolution":{"observed_at":"2026-05-24T13:26:12.914016Z","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":"R package version 1.0.4","venue":null,"work_id":"1cbb063f-4d35-4c52-afc9-7f3aa4575865","year":2022},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:8393cc31995e63c941c7ec155a1bdfa599dfc96b7eea668a3f1cd5ae25900758","observation_id":"b3ba2d56-6273-45eb-992b-839c9f571bef","resolution":{"observed_at":"2026-05-24T13:26:12.885102Z","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":null,"venue":null,"work_id":"6a9a1071-389d-46e7-a8ac-e96b3f40fcd5","year":2024},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:122cd9a6dd7fc69f3ccabec3bdc642a4f2adea7c2828b715ccb25c74817f4f46","observation_id":"ac38a4a7-f6a2-42fa-a51c-ac031de526a3","resolution":{"observed_at":"2026-05-24T13:26:12.817098Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"Standard particle swarm optimisation.HAL preprint hal-00764996","venue":null,"work_id":"84a910d6-a35d-420e-a903-caeabbb45083","year":2012},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:03d3aaa0c41d39cc8ebef02a3f7df40abcf8f2f09b69658d853567b6e872e1c3","observation_id":"6bba2cbc-e09b-42c6-b5bd-76d1fe666b2d","resolution":{"observed_at":"2026-05-24T13:26:12.918716Z","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":"Scalable global optimization via local Bayesian optimization","venue":null,"work_id":"64ece8ae-11f1-4778-8e8a-e0dde34313e0","year":2019},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:f8ad6823168f6aa2f9f4cbb9986fb2549990ad353d80d583f7fd8603d2d59361","observation_id":"856f232d-a7a0-4bfd-a83f-b4663890dbae","resolution":{"observed_at":"2026-05-24T13:26:12.858055Z","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":"CambridgeUniversity Press","venue":null,"work_id":"8f7e53b1-ed2a-4b9d-b80f-77bcaeef128b","year":2023},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:edb21cf0317b81ed894edf84162e272797cdf63cc26235d0a921b2f2d64d2e0a","observation_id":"00ec910e-d77c-4948-9ab5-f7407d458b7f","resolution":{"observed_at":"2026-05-24T13:26:12.914332Z","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":null,"venue":null,"work_id":"2da377ff-9c00-47a1-86f3-4ff0b7fae525","year":2017},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:0c3688c9a7445ea0e3e71049e248d1869ac007a0b0c63cf271a306446d885407","observation_id":"edff470e-5bf4-45b5-ad8a-e6632fc602cf","resolution":{"observed_at":"2026-05-24T13:26:12.855558Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"Scalable Bayesian opti- mization using Vecchia approximations of Gaussian processes","venue":null,"work_id":"9ff50a80-163c-4539-9f54-5be104df93f0","year":2023},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:0459d280d801455df6b3a5f46f2c030b9060fbb4f3d1c69e313608fc4d67e8fa","observation_id":"00fc9dce-4772-4181-b344-ae56815e9bc4","resolution":{"observed_at":"2026-05-24T13:26:12.820830Z","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":"Mopta 2008 benchmark","venue":null,"work_id":"b75e2d76-7022-43bc-bb2f-079e291626ae","year":2008},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:cc5558ff8418dd5b79707a07a2e69aadfa0ea03703ebd59436baf20057d71de5","observation_id":"35eb9fd6-1504-4071-99cd-0a0eeb2688a0","resolution":{"observed_at":"2026-05-24T13:26:12.888585Z","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":"Benchmark problems for constrained global optimizationwithhigh-dimensionalblack-boxfunctions","venue":null,"work_id":"5c58ed7d-b0e5-4b90-8d9d-15e64c6b5596","year":2025},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:17d1a49fac4a26112b9925810a3fcc3e5c5359ad0d256e4973ed5915dd6a0bb7","observation_id":"235de5a4-06a1-4c64-a5ae-94ee911b714c","resolution":{"observed_at":"2026-05-24T13:26:12.845414Z","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":"Efficient global optimization of expensive black-box functions","venue":null,"work_id":"7670ceff-25e1-40c2-8747-295ee1a7ced8","year":1998},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:3c1dab64913f76956a2fa7dcfdd02662e14df8da6660d9b5736607f856a079de","observation_id":"936fd8a8-e78e-45e4-96e8-4ecc5dff0a1e","resolution":{"observed_at":"2026-05-24T13:26:12.910759Z","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":"Welch.EGO: Efficient Global Optimization","venue":null,"work_id":"5e7fc7a1-9408-4440-80d5-04fd424ba83a","year":2023},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:24690f25c91932c5b45422c35ce8942c06c4a164fc6831496fbe9cb91c6afdb4","observation_id":"a3cd62ca-9052-4c46-a585-803608572a69","resolution":{"observed_at":"2026-05-24T13:26:12.906803Z","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":"Rousseeuw.Finding Groups in Data: An Introduction to Cluster Analysis","venue":null,"work_id":"5e2e25b8-ca0b-422d-b9bf-858243731229","year":1990},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:e672447c955c58e6622fa658653c61e27ace17c628596911be8e7905076db520","observation_id":"8e471f34-cb15-4a21-a07e-77f5e81fd362","resolution":{"observed_at":"2026-05-24T13:26:12.879960Z","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":"2410.23148","last_updated":"2025-04-03T15:37:26Z","snapshot_observed_at":"2026-08-16T13:04:29.467452Z","submitted_at":"2024-10-30T16:04:16Z","title":"Navigating in High-Dimensional Search Space: A Hierarchical Bayesian Optimization Approach","version":6},"cited_work":{"arxiv_id":"2410.23148","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.23148","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Navigating in high-dimensional search space: A hierarchical Bayesian opti- mization approach","venue":null,"work_id":"6fcea219-d6ab-405e-936f-79d3793e23f4","year":2024},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"cited_paper":"/paper/2410.23148","citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:5ea5a30cbd8245a02233e4f5da70bc583cd9d95efa3aabdcb70c92c76bc4909c","observation_id":"3ecf09dd-5188-43a7-b7d0-c21b4224a1da","resolution":{"observed_at":"2026-05-11T15:16:10.487785Z","resolver_source":"arxiv_id","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":"When Gaussian process meets big data: A review of scalable gps.IEEE transactions on neural networks and learning sys- tems","venue":null,"work_id":"cc9d7e63-d10b-4428-84a9-cb331d111e1c","year":2020},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:27cc17eb9903bdb6040993a12d66bade3c938e6f3f3716361fc2eb1a29b27007","observation_id":"628bd2a7-0533-4692-be58-1bf0b17bff01","resolution":{"observed_at":"2026-05-24T13:26:12.870660Z","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":"Choos- ing the sample size of a computer experiment: A practical guide.Technometrics","venue":null,"work_id":"e64c772f-a4ab-455f-a493-11c752917675","year":2009},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:cd02575915ac9a3d7c27162f711fad07d21728ffd8f27a07c47e7b90444cd7db","observation_id":"0745f150-761a-4313-9162-057bac7d2532","resolution":{"observed_at":"2026-05-24T13:24:32.247053Z","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":"Geneticoptimiza- tion using derivatives: The rgenoud package for R.Journal of Statistical Software","venue":null,"work_id":"94580940-ee0e-42af-b62d-4e8c39a96ee9","year":2011},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:c91f9ad0bcfe7a9857dfcbf930b3714ecbe27db0bbb481a5af6166bf0a235eac","observation_id":"e2ecbf47-7cb6-43a7-90c6-2aa91b09b70c","resolution":{"observed_at":"2026-05-24T13:26:12.849369Z","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":"Foundations of Machine Learning","venue":null,"work_id":"bb92c506-46a9-4cd7-8577-4f7df8b87f2a","year":2018},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:d90ab1d1a34c69614da30bb04bd41ff46788457154b406a4493bb8fca6e126a3","observation_id":"aea924e9-402b-44eb-9cd6-e11c2368962a","resolution":{"observed_at":"2026-05-24T13:26:12.874806Z","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":"Number153inAppliedMathematical Sciences","venue":null,"work_id":"2c1783c7-4228-4a50-97f9-69841373e4d6","year":2003},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:58d9a428878fb2c85a7b9ada9df4569b1d785ca94afe4db46d11e5dbd2d58c3e","observation_id":"7830345d-f589-4888-9879-385ba7814e82","resolution":{"observed_at":"2026-05-24T13:26:12.861831Z","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":"DiceOptim: Kriging-Based Optimization for Computer Ex- periments","venue":null,"work_id":"0827e15b-a6b6-4098-81e3-d997ee6f0a0d","year":2025},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:8592f3ad7ec784b3fd771c58155e894c1b23ec0f8e39bdc267c7e09dae946b8f","observation_id":"afa9456a-5cca-42fe-b182-5dcd4d796fd9","resolution":{"observed_at":"2026-05-24T13:26:12.866002Z","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":"R Foundation for Statistical Computing","venue":null,"work_id":"af977a95-d5ce-4d6a-8a73-e361b11a8fb5","year":2024},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:ceedf99d190823ef119b4a5c065b8610124897e79d5fc5dc3ff25d5edbb47607","observation_id":"57bbd130-916c-47d7-abb8-609ff69a7f03","resolution":{"observed_at":"2026-05-24T13:26:12.808924Z","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":"DiceK- riging, DiceOptim: Two R packages for the analysis of com- puter experiments by kriging-based metamodeling and opti- mization.Journal of Statistical Software","venue":null,"work_id":"7a5ebb6b-bf5a-456a-9376-a73edb608494","year":2012},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:38d02895fc02049e82d4ac6f10a9b3ae7c755fd40703d57c667a642b9a8ea1a7","observation_id":"8b9ad80b-bb43-4d40-97b0-8899a12a4e81","resolution":{"observed_at":"2026-05-24T13:26:12.860735Z","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 sim- ulation experiments: Test functions and datasets","venue":null,"work_id":"504c6e64-5972-45c0-a1d0-ea61997fc284","year":2013},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:3dc2c7687fa7b5ac475b88bb5c9ea870166fed1f436fb986499418ecc8a9bdea","observation_id":"fae42cf0-14c5-4bc4-995c-5d47d8a421eb","resolution":{"observed_at":"2026-05-24T13:26:12.897378Z","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":null,"venue":null,"work_id":"952f180b-ad4a-4f65-a064-3be9c5e5e37f","year":2024},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:af3f485ac90a491e18582e6a0ac774824821924f06bea1a3cb1d607f53a970cc","observation_id":"fdde65c2-61e1-4beb-9ee2-3b5d568e4bac","resolution":{"observed_at":"2026-05-24T13:26:12.853539Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"Blaschko","venue":null,"work_id":"348fd91d-c16e-452a-9489-4ef8296c3bac","year":2023},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:2b17275254f3ba3bd3cebb69bc1b8edcc3706acd4f1d8323448ed64874b2fa10","observation_id":"8ee23cbe-5d07-4dd2-b96f-0ed4c79dab32","resolution":{"observed_at":"2026-05-24T13:26:12.893487Z","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":"Bayesian op- timization is superior to random search for machine learning hyperparameter tuning: Analysis of the black-box optimiza- tion challenge 2020","venue":null,"work_id":"d1c01470-4eba-4741-b37a-59fc9a458f12","year":2020},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:c71fb8405bde701b79fa9cbd4581c43f66e5bac141447f54fc759c8c5040221f","observation_id":"a2cbda49-da83-4225-b510-5ae3a0559587","resolution":{"observed_at":"2026-05-24T13:26:12.897813Z","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":"Learning search space partition for black-box optimization using Monte Carlo tree search.Advances in Neural Information Processing Systems","venue":null,"work_id":"d5b35f9c-79b1-4f38-9113-bd2d57d3f449","year":2020},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:96a6fd1b3417b1cf2a25f2bedb597ee414a216995f3dbaf16a66fa8ed8e5162a","observation_id":"1e4c709b-81f4-4654-9242-64b9a8e40406","resolution":{"observed_at":"2026-05-24T13:26:12.844762Z","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":"Bayesianoptimizationinabilliondimen- sionsviarandomembeddings.JournalofArtificialIntelligence Research","venue":null,"work_id":"236fd3dc-4ab2-44e4-81ee-b7b56970ac5c","year":2016},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:6fefbd8848b646d097a7def4131df06e2bcbf54824ada1b456d9750ead7906b8","observation_id":"dac8c411-681a-46d6-9a47-81826f44693d","resolution":{"observed_at":"2026-05-24T13:26:12.878978Z","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":"ScalableBayesianoptimizationviafocalizedsparse Gaussian processes","venue":null,"work_id":"c9287b8a-76e0-48d3-8dbb-a226dcbf7405","year":2024},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:0eb551cd2c472e196bdfa2579071c497adb1102b86d9d42682785a4a9a61a5e0","observation_id":"52615995-51da-49e9-9459-f59200da50e3","resolution":{"observed_at":"2026-05-24T13:26:12.909133Z","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":"Using trajec- tory data to improve Bayesian optimization for reinforcement learning.Journal of Machine Learning Research","venue":null,"work_id":"dfc7ef0a-155b-4b08-a8aa-3a63b3ff0468","year":2014},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:9768958bea1ec3d9ff8f4841c728dd2025bceb0bbade2be5467f6c5dd32e1f71","observation_id":"57ab6e0d-56ad-4920-9527-7aca3f393c13","resolution":{"observed_at":"2026-05-24T13:26:12.889208Z","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":"Are ran- domdecompositionsallweneedinhighdimensionalBayesian optimisation? InInternational Conference on Machine Learn- ing","venue":null,"work_id":"3f423bd3-d7f8-44c7-abe6-aebecc1263ba","year":2023},"citing_paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-09T20:20:43.894093Z"},"links":{"citing_paper":"/paper/2605.00237"},"observation_digest":"sha256:009c1bb6fc61f637942e03d6a5a97ac0ee926fcd4d499fc684ad8f99a2c6f60a","observation_id":"11a64ca0-ed91-408c-9e13-e8cef2411cb4","resolution":{"observed_at":"2026-05-24T13:26:12.884093Z","resolver_source":"raw_fallback","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"}}],"paper":{"arxiv_id":"2605.00237","last_updated":"2026-04-30T21:16:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:13:42.661364Z","submitted_at":"2026-04-30T21:16:12Z","title":"Bayesian Optimization in Linear Time"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":31},"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 20 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2605.00237."}