{"as_of":"2026-08-09T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cfadc18ea87920ce5446c5b481bf954c1999cc1821d6db3ed53d9ae0c984b604","coverage":[{"denominator":106,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:10:00.344043Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.05256/citation-record","integrity":"/paper/2502.05256/integrity","json":"/paper/2502.05256/citation-record.json","paper":"/paper/2502.05256"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.819776Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.819776Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:9fa3569aa7da67814070c6b84a2c4ed98401145706e3b4891882cb3dce4f07a1","observation_id":"5225e5b7-ed48-4b9d-9afb-6d2c10adf673","resolution":{"observed_at":"2026-08-08T20:09:59.819776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.825495Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.825495Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:452f171e907fd94aff757f596f6653044ce1967fe57780b6ae6da8916989195f","observation_id":"198f7d5a-5ad1-47f1-afe6-b43b66b3d982","resolution":{"observed_at":"2026-08-08T20:09:59.825495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.829706Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.829706Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:90791ec305b5b5019e9ad94052f254136f31fa30c8d87cb2f089c0fed7c6713f","observation_id":"b5f00e65-deb3-4663-8946-adbd6722f37f","resolution":{"observed_at":"2026-08-08T20:09:59.829706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.834136Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.834136Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:f8e7597d33de9763630ade8c6187714381a1c8cbe23604eaaa52febe9b45db2e","observation_id":"58b9c730-e00b-4282-9976-028cd9c447f4","resolution":{"observed_at":"2026-08-08T20:09:59.834136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.838805Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.838805Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:c8adc0cec777da2205d624229d391258bef6fe50f92ab653bf7b71f7dc8bbe9b","observation_id":"a6e8cc35-c72e-4652-8bec-2d37d7051c75","resolution":{"observed_at":"2026-08-08T20:09:59.838805Z","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":"10.1145/1559845","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.562399Z","title":null,"venue":null,"work_id":"0db70b1e-a780-42b7-8a35-f3097b05cc8a","year":2009},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.843325Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2cfd0655902e9d1e922cfc3b07ce17972a5688a67e462f6fc03d84c226516dfa","observation_id":"15e86b11-a399-4390-a936-b39c57636ab9","resolution":{"observed_at":"2026-08-08T20:10:00.566740Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.326877Z","title":null,"venue":null,"work_id":"a06b4679-dbcd-41df-97b1-87f93be185c1","year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.848908Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:bc33c3d2866c083f41719e6d58f9357190596dfff2d9a4c5391c86c334cdb6ca","observation_id":"97e9c088-dbf7-4835-9778-b0731af61325","resolution":{"observed_at":"2026-08-08T20:10:03.331153Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.288531Z","title":null,"venue":null,"work_id":"fa0b5eef-375d-4cf7-a01c-9c5c8597b07c","year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.853799Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:71ee7fa3c8049278bb0b007cdf54c6314ea0ed4508e25200ed48b4317da4bd4d","observation_id":"36ea0408-1dd8-4ede-b9c7-a9f307cddacc","resolution":{"observed_at":"2026-08-08T20:10:03.295998Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.858617Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.858617Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2e530619cf6b93b5e09cd90fb5295529b7df26ec9825a0fd03d9068c3522d36d","observation_id":"2ce06d78-5b8b-4de7-bbc1-ccf3ae855f98","resolution":{"observed_at":"2026-08-08T20:09:59.858617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14135","last_updated":"2022-06-23T17:53:32Z","snapshot_observed_at":"2026-07-06T13:14:48.753329Z","submitted_at":"2022-05-27T17:53:09Z","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14135","snapshot_observed_at":"2026-08-08T20:09:59.863057Z","title":"Fu, Stefano Ermon, Atri Rudra, and Christopher Ré","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.863057Z"},"links":{"cited_paper":"/paper/2205.14135","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:5600bceb5db4b4d6d362d152c104c0280879f20faa4e650d9b6decb812dd75cf","observation_id":"44da41ba-70da-464b-9f7a-51fba358dbe7","resolution":{"observed_at":"2026-08-08T20:09:59.863057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.01186","last_updated":"2021-11-01T18:26:22Z","snapshot_observed_at":"2026-07-06T12:04:21.124474Z","submitted_at":"2021-11-01T18:26:22Z","title":"Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces","version":1},"cited_work":{"arxiv_id":"2111.01186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.01186","snapshot_observed_at":"2026-08-08T20:10:03.159937Z","title":"Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces","venue":"cs.LG","work_id":"35bcf9d3-0b41-4a9c-bc8d-1328fce6f4be","year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.867997Z"},"links":{"cited_paper":"/paper/2111.01186","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2ce49734fea947a8cb60debbaf90aaa22c686a265570ce3374705ae330bff467","observation_id":"bd189211-f357-41b5-9edf-450599920d41","resolution":{"observed_at":"2026-08-08T20:10:03.164926Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.873619Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.873619Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:4eb722c13dde65a3e2f2e01b5a5f2cb2561241320e0a6e966a6bed4c90b14223","observation_id":"e68048bf-d46d-4686-bd97-5fa71bc2563b","resolution":{"observed_at":"2026-08-08T20:09:59.873619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.882927Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.882927Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:279f7b4c72949b8a68219dd3e9be309b2bcc2e871ed8ac9731ad387cbd8de162","observation_id":"af165432-462d-4054-b0bd-6800f17653ee","resolution":{"observed_at":"2026-08-08T20:09:59.882927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.887610Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.887610Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:23132d59b292542e824a9cc3e6ac7c1b687780419d9726d3012132200c2a5ffd","observation_id":"9d796fba-2199-47d4-a91a-f8f2b66b7a32","resolution":{"observed_at":"2026-08-08T20:09:59.887610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.891868Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.891868Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:8da3b81a7e3e9840b17b6c3deb2e0ad87f80e6bd30b2a55a819b8daf30f8e26e","observation_id":"eb6d9a25-760c-42d2-a092-5d32de7ae928","resolution":{"observed_at":"2026-08-08T20:09:59.891868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.13828","last_updated":"2020-09-29T07:32:30Z","snapshot_observed_at":"2026-07-06T09:59:41.727913Z","submitted_at":"2020-09-29T07:32:30Z","title":"Neural Model-based Optimization with Right-Censored Observations","version":1},"cited_work":{"arxiv_id":"2009.13828","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.13828","snapshot_observed_at":"2026-08-08T20:10:02.976495Z","title":"Neural Model-based Optimization with Right-Censored Observations","venue":"cs.AI","work_id":"1b46bfdb-5ada-4a35-a12e-538cf79e93f4","year":2020},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.901458Z"},"links":{"cited_paper":"/paper/2009.13828","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:9ce5dcce552cac29ae26f0165a976cb4e48356e4bfb4313563225e29bc9002fa","observation_id":"3c64edf6-8ab8-4518-ab77-d803e5619524","resolution":{"observed_at":"2026-08-08T20:10:02.981381Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.906302Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.906302Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:0b8b0e8eca2a83d749ceaff7214fdf9903eb467edc439fce06654ca152b3b986","observation_id":"ced8d692-d01e-4cfe-a7f4-788fecfd24da","resolution":{"observed_at":"2026-08-08T20:09:59.906302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.916576Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.916576Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:9971fda8a498a379b6fcc9ddb876e43bd10d6356f5bcce12484efe6773b3151b","observation_id":"8786c19d-cd10-4ef1-81b2-a2e7fb506e85","resolution":{"observed_at":"2026-08-08T20:09:59.916576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.922101Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.922101Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:6461bd57343577bc456f8c412b41d8e91dc6efc311f9b162fe7d041f3e88573b","observation_id":"2922fe47-13cf-4421-9a05-019a5970960a","resolution":{"observed_at":"2026-08-08T20:09:59.922101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.931288Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.931288Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2db9acdf60907b0e3d9ecbe5991ff0cf379aa7e6b0189b956564bbf8cf596ba3","observation_id":"26840ddc-b533-49f2-b242-41692402b639","resolution":{"observed_at":"2026-08-08T20:09:59.931288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.936021Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.936021Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e9098d51c16e2277ff666e1b47794c34c1aa10ed273115936c7088bc4b5303df","observation_id":"7aa59e1b-2729-4ad8-a68d-adb377e1c2b2","resolution":{"observed_at":"2026-08-08T20:09:59.936021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.940848Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.940848Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:00076e99ba10d1665804935f467818d3167c333068b94605be4c2601e64289a3","observation_id":"6b6ff686-1281-49cb-9027-a5d4079e1aa1","resolution":{"observed_at":"2026-08-08T20:09:59.940848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07895","last_updated":"2024-10-10T13:21:06Z","snapshot_observed_at":"2026-07-06T19:31:09.594589Z","submitted_at":"2024-10-10T13:21:06Z","title":"Grid-AR: A Grid-based Booster for Learned Cardinality Estimation and Range Joins","version":1},"cited_work":{"arxiv_id":"2410.07895","doi":"10.48550/arxiv.2410.07895","metadata_source":"pith","pith_arxiv_id":"2410.07895","snapshot_observed_at":"2026-08-09T00:16:22.132183Z","title":"Grid-AR: A Grid-based Booster for Learned Cardinality Estimation and Range Joins","venue":"cs.DB","work_id":"13d00525-fdf0-43cd-8e3c-58661f5054cb","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.945962Z"},"links":{"cited_paper":"/paper/2410.07895","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:dfb0f6b777c20f4b4bb571cb0ab09801023fed99b4691ad31771ab8e9177c316","observation_id":"4ce0cb5f-17ed-481b-99db-47d16bd5aa49","resolution":{"observed_at":"2026-08-08T20:10:00.532642Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.951589Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.951589Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:c149a866dcc961731118a643603511808cefbff1c9212e0d62d38686dd78d761","observation_id":"c3601e02-6afa-4f8f-b54c-1f22bddfb1b6","resolution":{"observed_at":"2026-08-08T20:09:59.951589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.955555Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.955555Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e779e403891ff809de3107ef3abd96cca084d030040d483e931865291b110e65","observation_id":"9374848f-1a17-4d7f-9bcc-a69c2ca33fd7","resolution":{"observed_at":"2026-08-08T20:09:59.955555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03609","last_updated":"2021-11-01T11:53:58Z","snapshot_observed_at":"2026-08-05T00:36:17.087265Z","submitted_at":"2021-06-07T13:35:47Z","title":"High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.03609","snapshot_observed_at":"2026-08-08T20:09:59.959747Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.959747Z"},"links":{"cited_paper":"/paper/2106.03609","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:890ca0f0a19f356d831e0fbe86c544d7a03e9c4904b53dc5e60164df0953eb63","observation_id":"a5311b50-8f1d-47c2-a6ce-8b7ccb04e4a4","resolution":{"observed_at":"2026-08-08T20:09:59.959747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.964155Z","title":"Lawrence","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.964155Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:47f6c0c6eb29fef98564aa5b0b92cb8cc80b4b6351d3b7a57e94a804ab283043","observation_id":"aaa8bf73-0720-4cd7-a934-3cf1ef590046","resolution":{"observed_at":"2026-08-08T20:09:59.964155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.2005","last_updated":"2014-11-07T19:01:19Z","snapshot_observed_at":"2026-07-06T03:59:54.234697Z","submitted_at":"2014-11-07T19:01:19Z","title":"Scalable Variational Gaussian Process Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.2005","snapshot_observed_at":"2026-08-08T20:09:59.968347Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.968347Z"},"links":{"cited_paper":"/paper/1411.2005","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:a0f3e1aa0304a78f40f700bcd043e2754acf7969d6d5d8b1b1e5a1fdc5f2e50f","observation_id":"a50a0f96-0990-45f1-9449-a2ae3554eadd","resolution":{"observed_at":"2026-08-08T20:09:59.968347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.973395Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.973395Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:d7ebcb6f2dd6aac74f53311d5109643c77dc8fe19a2ae5dd3bf1d42683ea5f25","observation_id":"2702d34a-849c-483e-86d3-6df0904dcadd","resolution":{"observed_at":"2026-08-08T20:09:59.973395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.1947","last_updated":"2013-10-07T20:43:16Z","snapshot_observed_at":"2026-07-06T03:25:01.073018Z","submitted_at":"2013-10-07T20:43:16Z","title":"Bayesian Optimization With Censored Response Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.1947","snapshot_observed_at":"2026-08-08T20:09:59.983159Z","title":"Hoos, and Kevin Leyton-Brown","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.983159Z"},"links":{"cited_paper":"/paper/1310.1947","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:ffba5d4811d17016bbf3a6139b4b7250eec1a7409c08255f846f40e39b05e564","observation_id":"21919343-512c-4a9e-ab85-1c43b699645f","resolution":{"observed_at":"2026-08-08T20:09:59.983159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.987263Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.987263Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:50fa1b4f097637fdeb60f400e8d0782da2720c8d21b63bf954fd440d4ef048d9","observation_id":"b046e7a5-46fd-4913-94d0-a7bb5b46e68c","resolution":{"observed_at":"2026-08-08T20:09:59.987263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.991661Z","title":"Jaakkola","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.991661Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:935c7896bcd6a46a0c38fc34404147f372f803eb7187d0e75ae89590b1ee403d","observation_id":"ae1393cd-7a74-49ed-aa64-14aa9ca77a73","resolution":{"observed_at":"2026-08-08T20:09:59.991661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:09:59.996184Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T20:09:59.996184Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:7a123c17a839afed26252d5e35665dcaff5ecb873a8f0b660938817ba7e04e5e","observation_id":"fa755637-dd4b-45cf-b249-00e95a41466d","resolution":{"observed_at":"2026-08-08T20:09:59.996184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.000583Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.000583Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e274b1fe9199a17d13af176ed14f64917952eb754e9b38695199f21e3975167e","observation_id":"e127c3d2-b7e0-422d-baf7-7560c9304510","resolution":{"observed_at":"2026-08-08T20:10:00.000583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15210","last_updated":"2025-05-25T04:22:38Z","snapshot_observed_at":"2026-07-06T17:21:10.236126Z","submitted_at":"2024-01-26T21:16:37Z","title":"Robust Plan Evaluation based on Approximate Probabilistic Machine Learning","version":3},"cited_work":{"arxiv_id":"2401.15210","doi":"10.48550/arxiv.2401.15210","metadata_source":"pith","pith_arxiv_id":"2401.15210","snapshot_observed_at":"2026-08-09T00:16:22.132183Z","title":"Robust Plan Evaluation based on Approximate Probabilistic Machine Learning","venue":"cs.DB","work_id":"ff12945d-f117-439a-8c25-b01d2630585d","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.013494Z"},"links":{"cited_paper":"/paper/2401.15210","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:0a636d9868f4115b4d678fbd280d099319dc721bc362f922e7a3b55b534d3561","observation_id":"7f8356ce-2572-46b0-b7b2-a8cac40a823c","resolution":{"observed_at":"2026-08-08T20:10:00.511588Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:02.765695Z","title":null,"venue":null,"work_id":"0c640872-a494-4f71-b456-457c88ef6e11","year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.019074Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:c9abf278de2c80938888c50b6728b6587fb72352e08c54a69faa66e8cd56f823","observation_id":"4020fa13-9f71-469d-9058-b73d0d5ad6b5","resolution":{"observed_at":"2026-08-08T20:10:02.770310Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.024221Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.024221Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:22148bc4df096840c5a58d60f9873754fc4e9f58f15b28a079d189cf5457301b","observation_id":"d18c147e-44f5-48ac-8982-767bf5961f37","resolution":{"observed_at":"2026-08-08T20:10:00.024221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-08T20:10:00.028985Z","title":"Kingma and Max Welling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.028985Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:d8521da035db4249e18386efdf1890ec150ea60717faa9f390d3f8da79be4eba","observation_id":"376b653d-4d03-4c3e-88c7-b8cdc8c95d6d","resolution":{"observed_at":"2026-08-08T20:10:00.028985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.00677","last_updated":"2018-12-18T11:16:34Z","snapshot_observed_at":"2026-07-06T06:58:57.382561Z","submitted_at":"2018-09-03T18:05:12Z","title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.00677","snapshot_observed_at":"2026-08-08T20:10:00.034491Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.034491Z"},"links":{"cited_paper":"/paper/1809.00677","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:acc2df1734ecec64dfabafbd8beb23da39a6b2051f007c5748ac9449f7c1da20","observation_id":"a706307d-7459-44a1-a879-9160b1546856","resolution":{"observed_at":"2026-08-08T20:10:00.034491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13741","last_updated":"2020-03-05T04:30:47Z","snapshot_observed_at":"2026-08-02T09:34:13.516868Z","submitted_at":"2019-05-31T17:51:07Z","title":"Self-Referencing Embedded Strings (SELFIES): A 100% robust molecular string representation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13741","snapshot_observed_at":"2026-08-08T20:10:00.039797Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.039797Z"},"links":{"cited_paper":"/paper/1905.13741","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:6f0e5bdcda02a732dd95fe4f41e7fbb2e869d2a81796ed3673b6c561cf061c35","observation_id":"e185256f-3e5c-4b63-9d3e-cc5de7fe5d55","resolution":{"observed_at":"2026-08-08T20:10:00.039797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.044369Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.044369Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:680650c0c566c6024f46ab35a3495e7f8079678c56ae44b8b0120a11f3aae23f","observation_id":"d95ac68d-8c2d-4f2b-bad7-9acb0f7e3aeb","resolution":{"observed_at":"2026-08-08T20:10:00.044369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.054960Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.054960Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:9e9bc5c10d527dcb5df04e2bcb45c90d07f4a59b4ec574e460454110671654c4","observation_id":"b4924fc8-f9fd-475a-8685-761a4aba1677","resolution":{"observed_at":"2026-08-08T20:10:00.054960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.060965Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.060965Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:fd170a0a61f899ebe4fafcffcd52d8c6a103a979be59077e4c2e6fd418240a19","observation_id":"3b631a8d-6dce-4b3b-af9f-7f940f6f34d6","resolution":{"observed_at":"2026-08-08T20:10:00.060965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.065828Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.065828Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:5ed9a7b2441ac0a6ce8160fcd46ff66c6ccf7935fc6ca31b44960aa94c16495a","observation_id":"15be04e2-f6d4-46df-8a1a-ed1dccb67229","resolution":{"observed_at":"2026-08-08T20:10:00.065828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.070657Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.070657Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:9f071587e31e3fefe0bc30648f737aa5f4c608db081b932e8d253f1f518fbad6","observation_id":"98f74288-a960-43ff-b417-0db91258265e","resolution":{"observed_at":"2026-08-08T20:10:00.070657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.076225Z","title":"Ives, and Boon Thau Loo","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.076225Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:1e3e4d660a9b576e789600feaed107deb921226dd8dc2e2e22233d47ffab2efb","observation_id":"00f2a406-4b82-4361-b915-37549e597d41","resolution":{"observed_at":"2026-08-08T20:10:00.076225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.080737Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.080737Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:5c974cb9ed28247ca1584fb3df42eadb3d0bf1bfa3f458cd28a9afc8c90a5697","observation_id":"f4451a9a-5abd-4d99-8bd8-d1e0a7937621","resolution":{"observed_at":"2026-08-08T20:10:00.080737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.085559Z","title":"Tan, and S","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.085559Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e19a4bd7b080b50c45a13ce5b09e2c2b679bad6e779c5e10302574fcb971c697","observation_id":"512ab7d5-aa1d-4f44-897e-697298a2ad6a","resolution":{"observed_at":"2026-08-08T20:10:00.085559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.090285Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.090285Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:b323b236659dc12b7b3bdc78fc4fa2d971c44866d1ca199228be49d55669f1c2","observation_id":"4bf6180a-e8b0-4c07-87d8-0d6bb17be069","resolution":{"observed_at":"2026-08-08T20:10:00.090285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.094952Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.094952Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:74982d596ee70ea2576ee20ad54ee47a0d36445f681afe506e5a2c4e5a5cd81d","observation_id":"61e8f206-cc1c-4193-a2fb-cde0023df895","resolution":{"observed_at":"2026-08-08T20:10:00.094952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.100762Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.100762Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:069553454d1c14aad7f912bda58fda32535ea4bb4b6a60a2ca744477a9c46742","observation_id":"93cf9a67-1dc5-4c54-ab8b-1967ebb432ba","resolution":{"observed_at":"2026-08-08T20:10:00.100762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.110757Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.110757Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:bf5c32bdbd4103a64c466bc7a51807a0764c5445509e548e4520bb8a2d1bc8b3","observation_id":"4e0921a4-bfc4-4cd7-94c0-ebda2931993b","resolution":{"observed_at":"2026-08-08T20:10:00.110757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.115531Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.115531Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:4d3b5c26c3499211101b57e82943f0b417f7bfb1c36795bb7ce1ccb0c05b8ee8","observation_id":"f1d45c3c-dd65-4c6e-87f9-ba272de880c5","resolution":{"observed_at":"2026-08-08T20:10:00.115531Z","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":"10.1007/s00778-006-0030-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.466717Z","title":"Markl, P","venue":null,"work_id":"850a9047-db74-412c-984b-b4f99e3c01e0","year":2007},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.119787Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:64dafd138b45dd1b6b9facf784194d30f0ec6aef51896eddd748fe9f42bf95c8","observation_id":"f59aa893-0ce5-4c88-ac3a-e72c6e92213d","resolution":{"observed_at":"2026-08-08T20:10:00.471182Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.125104Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.125104Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:0376c64d35b5e78e2619fc1e036242e0df90314b0ac0375e0ef339d36bfea91b","observation_id":"7a13e068-e910-470c-b0c7-179e2f7179ff","resolution":{"observed_at":"2026-08-08T20:10:00.125104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.129675Z","title":"Kusner, John Brad- shaw, and Jacob R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.129675Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e5d957c23f2669f757a6b6f9203509b237767f61a4a005dac3ec6d5ae927eb43","observation_id":"e4ba089c-137c-4f90-ad59-60133c4ae99c","resolution":{"observed_at":"2026-08-08T20:10:00.129675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.134072Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.134072Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:b1fc91b90790d8e7c9ceb085f700bbaf9e7e18075735ffbe6e84872ec90f1dfe","observation_id":"7490d239-5f79-418d-b50d-35a025f08848","resolution":{"observed_at":"2026-08-08T20:10:00.134072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.138844Z","title":"Maus, Haydn T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.138844Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:fa9d1f7034a0537dbd6aa547905b1aa6a6142b60850c9157b0fc3110e867bbe1","observation_id":"8d0893b3-edbe-433d-ab62-362b5187efed","resolution":{"observed_at":"2026-08-08T20:10:00.138844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.143106Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.143106Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:75aa045f77b18c1ef88a4f79299aa45923b604fbd07871569496600f5a771ff4","observation_id":"6b6f1fa3-19b9-4b0d-951d-4b51c5c8fdd9","resolution":{"observed_at":"2026-08-08T20:10:00.143106Z","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":"10.1145/3626734","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.451831Z","title":null,"venue":null,"work_id":"86910734-794f-45a3-8e18-4077c4956beb","year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.147539Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:3e88a74634abaab543b321c34e85ef259986d114c2a498b8a7fa1e008a367008","observation_id":"478cc31b-55a3-4cfa-bb2a-0134329e053a","resolution":{"observed_at":"2026-08-08T20:10:00.456753Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.152225Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.152225Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:5bd85d880696c1d084a7d3f54552edb1b28d9589e81966a62d28376e2675a753","observation_id":"da03db33-3d2b-4202-9f34-9ea9e73c4df3","resolution":{"observed_at":"2026-08-08T20:10:00.152225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.157514Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.157514Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:fd45e356680d28faa12fa9934cdad7aafba339a7c6121b2c34eb3551253ecbd1","observation_id":"ce27c177-e5e0-4402-be04-a6082c685739","resolution":{"observed_at":"2026-08-08T20:10:00.157514Z","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":"5916.67197","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:01.968033Z","title":null,"venue":null,"work_id":"0a73ecf4-3f43-48cf-8c5c-4a7e933ba03f","year":1990},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.162339Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:96c88a96440e5346cd80c6346683c4a5ad9a56312b0fc0fba2c0ab3d8c30b149","observation_id":"a0cb452e-0e19-4f35-92ae-31e9ed51f6b1","resolution":{"observed_at":"2026-08-08T20:10:01.974778Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.166824Z","title":"Sathiya Keerthi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.166824Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:db1b083b66954e2a5bdb16b635939df5392112865c4836985f978c4c767403c1","observation_id":"942a4a1d-718c-4889-bf15-9671a59543f8","resolution":{"observed_at":"2026-08-08T20:10:00.166824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.10568","last_updated":"2020-04-10T20:30:39Z","snapshot_observed_at":"2026-08-05T17:16:22.825982Z","submitted_at":"2018-12-26T23:05:32Z","title":"QuickSel: Quick Selectivity Learning with Mixture Models","version":2},"cited_work":{"arxiv_id":"1812.10568","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.10568","snapshot_observed_at":"2026-08-08T20:10:01.878084Z","title":"QuickSel: Quick Selectivity Learning with Mixture Models","venue":"cs.DB","work_id":"4b13d7b0-deec-4e2a-88b5-38f34c275c78","year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.175945Z"},"links":{"cited_paper":"/paper/1812.10568","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:ed085e0564b5a1b6c4727dfffdc53415edbbdf13349f3ca4b9f0dd81027af502","observation_id":"c02a22a9-37c1-4682-80bd-635aa06c2dfd","resolution":{"observed_at":"2026-08-08T20:10:01.883005Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.00191","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:01.852360Z","title":null,"venue":null,"work_id":"a27a8eea-0f7e-4135-ab45-e0852d6d437e","year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.180646Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2c4fa50f0a8c9ad478d34f0579680dd1eb6f5b9a15ed37c1840cf99866af819e","observation_id":"b9edd2f9-c22a-42f2-bdba-3444e725dabc","resolution":{"observed_at":"2026-08-08T20:10:01.859571Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08604","last_updated":"2018-03-22T22:39:32Z","snapshot_observed_at":"2026-07-06T06:29:48.164531Z","submitted_at":"2018-03-22T22:39:32Z","title":"Learning State Representations for Query Optimization with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1803.08604","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.08604","snapshot_observed_at":"2026-08-08T20:10:01.897385Z","title":"Learning State Representations for Query Optimization with Deep Reinforcement Learning","venue":"cs.DB","work_id":"a402b337-b60c-4cce-9bae-f0ab904f4eeb","year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.171189Z"},"links":{"cited_paper":"/paper/1803.08604","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:71b46ade85cd874d0c90b8a85892dad9c5c158176795741b42a4f90cf74b5549","observation_id":"51f5b556-03bc-43ff-8bc1-34ea96e042f4","resolution":{"observed_at":"2026-08-08T20:10:01.902376Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.190465Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.190465Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:ea6013d35cdb29adaf49b399decc2aa584bfd887313252952f64a84c852e2a8b","observation_id":"24148243-9ad5-4240-a5ca-71189fe8a162","resolution":{"observed_at":"2026-08-08T20:10:00.190465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.195030Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.195030Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:5f60d0de6ad2ea765d809f79df7d9f8debbdf4e21cbeee0ba52e84d93ee7eade","observation_id":"53dbe531-a64f-490a-af18-b9b13a781c43","resolution":{"observed_at":"2026-08-08T20:10:00.195030Z","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-08T20:10:03.815052Z","title":null,"venue":null,"work_id":"48838d03-a787-4259-89e3-c481f8406d33","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.185299Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:40bb8b88c97c6ba514ae29eade4fe9e79f8e624583bd528ef03733b3a348eaf8","observation_id":"c361cee6-7bb6-4413-afca-ffef8d79cb1e","resolution":{"observed_at":"2026-08-08T20:10:03.819632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.208995Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.208995Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:c431ec5244e81ab264532ced0cb9f5c17ddb588cfd5678cbb797537f01149fa7","observation_id":"bcccca29-805d-40b1-8476-1c8571138096","resolution":{"observed_at":"2026-08-08T20:10:00.208995Z","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-08T20:10:03.790076Z","title":null,"venue":null,"work_id":"a88fb9bf-6019-497f-92e9-225644b31874","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.213952Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:535fceff799f75bb5c126358b6d9e808dd62b27cc30f64be1f969a2781bcff6e","observation_id":"ae28b9e2-fbfd-41ee-a132-8c834975b074","resolution":{"observed_at":"2026-08-08T20:10:03.794505Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.219286Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.219286Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:13cae689b9153a91d12780ac521304ef368a4fcad41ad51d353dfbe481cbcd1a","observation_id":"6f54d222-ff81-45c5-9a17-4bb3c5bde843","resolution":{"observed_at":"2026-08-08T20:10:00.219286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.204590Z","title":"Adams, and Nando de Freitas","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.204590Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:950e793e17c66bb4634fae497dee4f2ff676fec4142ed744f006ec4273900d9d","observation_id":"0b19179a-8436-45c3-b527-2874e3ace18e","resolution":{"observed_at":"2026-08-08T20:10:00.204590Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.00075","last_updated":"2015-05-30T06:51:20Z","snapshot_observed_at":"2026-07-06T04:10:33.864180Z","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.00075","snapshot_observed_at":"2026-08-08T20:10:00.228046Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.228046Z"},"links":{"cited_paper":"/paper/1503.00075","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:f30262de4dddfbf283566465c75d815812897ec49f78b59781711e854aafb104","observation_id":"ff0fdd14-e1f5-4a6b-8406-4285b944e02c","resolution":{"observed_at":"2026-08-08T20:10:00.228046Z","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-08T20:10:03.760876Z","title":"Thompson","venue":null,"work_id":"a86486e9-e111-4a4a-ba2a-7efcac983f2d","year":1933},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.232494Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:66ff7db4d85f39c7d8b3dd5ea6926a5761bfcc05f68043f58c8c206d214f05f8","observation_id":"dec49e21-b53b-450d-9760-571cf9380795","resolution":{"observed_at":"2026-08-08T20:10:03.765566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.745471Z","title":null,"venue":null,"work_id":"412eb781-afb1-49d4-ac76-7e7e2bab06d2","year":2009},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.236346Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:da2e4aa40f7b30388ece6383c67eb4e7c6af3e617c9d41918a8d9c4c945d3baf","observation_id":"ff6d14b8-bf88-40bf-a1c6-a0c8c59adf90","resolution":{"observed_at":"2026-08-08T20:10:03.750447Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.775945Z","title":"Sutton and Andrew G","venue":null,"work_id":"550b8edb-1bd9-4cfc-9c1c-0364fcbbbe1f","year":1998},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.223382Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:83dd90470ee0d7c7a66730f8cf506d1305c13f8da3105bd88b31f64c1b167a07","observation_id":"6f5a0f05-9bba-4746-8f0d-3327b0bb6b86","resolution":{"observed_at":"2026-08-08T20:10:03.780394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.244095Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.244095Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:8593d00e2f29a7993e51ce5213d6261f76555cbb7bf2b905170a5ef581b8732a","observation_id":"61237b4e-c39e-4ca3-871a-761d550ffea6","resolution":{"observed_at":"2026-08-08T20:10:00.244095Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.248327Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.248327Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:931add556209b707f52f1a2f2bc07c34911b624adf19c641e885d5d95473387a","observation_id":"a9cc5d88-3711-481b-a4da-3231fe85e5ee","resolution":{"observed_at":"2026-08-08T20:10:00.248327Z","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-08T20:10:03.714400Z","title":null,"venue":null,"work_id":"471e0b75-b8a0-4dde-8c72-1de1cb689507","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.252267Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:56835bfc45c520f0d8d6eb7a59611fd03c9503d57cfe540e05848c110abf0e2d","observation_id":"32c4c15d-5c13-47d7-9f5d-3b2cf044f78e","resolution":{"observed_at":"2026-08-08T20:10:03.719183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.729407Z","title":"Daxberger, and José Miguel Hernández-Lobato","venue":null,"work_id":"36e262f3-802b-42e6-856c-ddf073009624","year":2020},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.240222Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:95de015beeea5861b76ae59ea3f41dc0ef7893995482455d740dc8bff1527a1b","observation_id":"a7d2a099-c255-42d4-950b-bad91ab2f488","resolution":{"observed_at":"2026-08-08T20:10:03.734293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.686287Z","title":"Michael Waas and Arjan Pellenkoft","venue":null,"work_id":"8f1e2e91-481d-486b-b458-6c6e507d2e33","year":2000},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.260446Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:981698b4ea8077440f2b0b0eeabc91744a629b4219735ed3d1381c099d8d4252","observation_id":"84c96181-3910-4b32-b8dc-a43783163fd3","resolution":{"observed_at":"2026-08-08T20:10:03.690895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:03.672027Z","title":null,"venue":null,"work_id":"05226160-554c-4a23-b69a-ee58a4cea54e","year":1988},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.265026Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:691bf29b92852357d8e98051dadb1e908e9b23524eb5aa46117157eb4229d2c5","observation_id":"98f60e2a-4b56-4344-9050-8a436908047b","resolution":{"observed_at":"2026-08-08T20:10:03.676523Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.273675Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.273675Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:3144217d6130ed6956162612e3374baf49be97b34196ddbd7374eb6cc21a3de6","observation_id":"c98279e7-3f6f-445d-8516-9876bd2d5f6f","resolution":{"observed_at":"2026-08-08T20:10:00.273675Z","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-08T20:10:03.700307Z","title":null,"venue":null,"work_id":"b4e54c70-eb2d-4cd2-b1d3-782896394554","year":2017},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.256297Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:e4cd19c774188df00728094d8a0ce07984509ae6818e38289d9785000ae71586","observation_id":"cfe2f397-bdd7-4803-a962-356cbbad1f5c","resolution":{"observed_at":"2026-08-08T20:10:03.704453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.286805Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.286805Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:7ad67706180a9eb8d8b4327d4abc2d47fea570dffef28e2d271fef333b497a3e","observation_id":"786210c2-7297-431b-a774-747f5c7fc0c2","resolution":{"observed_at":"2026-08-08T20:10:00.286805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02286","last_updated":"2024-03-04T18:17:18Z","snapshot_observed_at":"2026-08-08T05:56:03.805361Z","submitted_at":"2024-03-04T18:17:18Z","title":"Stage: Query Execution Time Prediction in Amazon Redshift","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02286","snapshot_observed_at":"2026-08-08T20:10:00.291333Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.291333Z"},"links":{"cited_paper":"/paper/2403.02286","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:89af111a29e28c19293f6edbe22b72fd4d35f921bffb663a83430b2a940813a2","observation_id":"e71d5c09-04ee-4458-ae23-cc6128024a2f","resolution":{"observed_at":"2026-08-08T20:10:00.291333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.269468Z","title":"Journal of Chemical In- formation and Computer Sciences 28, 1 (1988), 31–36","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.269468Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:eae595e3eb7c6af999166b8ba20ced114cf2c7a824dbbbed9fb84818e6133ca9","observation_id":"fed8bf23-b94c-4aab-921e-ba6b00ea93d2","resolution":{"observed_at":"2026-08-08T20:10:00.269468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.300004Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.300004Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:b005d3fe3e3143ae904bb430baee8a49fb9fd500692217b10386e4b88a3857c3","observation_id":"ef02fa42-1f3e-4c26-94fe-5017f688782b","resolution":{"observed_at":"2026-08-08T20:10:00.300004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.282537Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.282537Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:53d6ba1bbee751b255aa2ac26c3bb9525e259408c45406057db55b66dd8bd4e8","observation_id":"5007d2cf-2805-4590-aeba-7e1767597120","resolution":{"observed_at":"2026-08-08T20:10:00.282537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.314768Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.314768Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:8476250380fee70bae9d86f342cf4038bf99627d81d348ceb35e6bdd809f87e3","observation_id":"2a5e0626-67ba-436f-b0f9-0ad388ad5d93","resolution":{"observed_at":"2026-08-08T20:10:00.314768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.318752Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.318752Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:310ef3193a587658c21f75267f0a8a490237f7e7ac1223c5ab0ef282691c6d61","observation_id":"6a3cc805-dca4-4b7e-85d1-fc3ae16ca656","resolution":{"observed_at":"2026-08-08T20:10:00.318752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.295982Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.295982Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:2f5f8d1affc1f49e7701fe2de2bb215d5ca1d78e2c418f43f0bb383af487ff25","observation_id":"87491228-6ad0-4cf9-8e48-71dc3f471cf6","resolution":{"observed_at":"2026-08-08T20:10:00.295982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.326767Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.326767Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:bd1b888dce23d609306c735be938ed34d53fa461969c45969f73a79c8f4ebfcc","observation_id":"774f9a7b-43d5-486d-9fe6-beb94633dd32","resolution":{"observed_at":"2026-08-08T20:10:00.326767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.08109","last_updated":"2020-11-02T19:15:11Z","snapshot_observed_at":"2026-08-09T09:42:46.777261Z","submitted_at":"2020-06-15T03:21:46Z","title":"NeuroCard: One Cardinality Estimator for All Tables","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.08109","snapshot_observed_at":"2026-08-08T20:10:00.305543Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.305543Z"},"links":{"cited_paper":"/paper/2006.08109","citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:b8fcd57c3044f6b7a458fa27c6be9bba1d43fa9e720823b54fb03a369f69f3a3","observation_id":"54851777-a0a4-4f3a-8d42-caddfd26b051","resolution":{"observed_at":"2026-08-08T20:10:00.305543Z","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":"3742.36639","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:01.133844Z","title":"Ives, and Ryan Marcus","venue":null,"work_id":"ea89fb0e-6765-47b2-971d-fbdf62855acf","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.310678Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:c5bd8d4b78a438ff8a925d785f4cdebae41843e20b31b47e21211e2cdfc34404","observation_id":"cf60fe43-cd54-4615-8708-07049d9268a9","resolution":{"observed_at":"2026-08-08T20:10:01.141376Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.339873Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.339873Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:529068ae58f43b6c768e046c8b3a2703e8fa6d2ebb236461a5508607df4fdfda","observation_id":"84c75c34-9a99-4ea9-b7d0-7c6b0a778a40","resolution":{"observed_at":"2026-08-08T20:10:00.339873Z","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-08T20:10:03.645853Z","title":null,"venue":null,"work_id":"fe2bece2-f442-48e4-abae-dfd31f50772c","year":2024},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":105,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.344043Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:6157409e65a04b9305dbbfcdd475b8c4c4618337e0d0e61b37bfb0679c826a24","observation_id":"a8504462-cb87-45ad-b6f4-c25d4d85387a","resolution":{"observed_at":"2026-08-08T20:10:03.651027Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:10:00.322745Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization","version":1},"reference_index":106,"source":"pdf_text","source_observed_at":"2026-08-08T20:10:00.322745Z"},"links":{"citing_paper":"/paper/2502.05256"},"observation_digest":"sha256:4e4be5ab54d66e7d183df96bdbaac6e01e6f8fa22bf9926d117d914c764ad9ed","observation_id":"5b824510-6e98-429b-bed7-b1c0f0c4f2b1","resolution":{"observed_at":"2026-08-08T20:10:00.322745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05256","last_updated":"2025-02-07T18:20:19Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-08T20:02:19.501722Z","submitted_at":"2025-02-07T18:20:19Z","title":"Learned Offline Query Planning via Bayesian Optimization"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":79,"verified_exact":13,"verified_fuzzy":4},"total_outbound_references":106},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 100 of 106 outbound references and 0 inbound Pith citation observations for arXiv:2502.05256."}