{"as_of":"2026-08-17T18:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97110525ba410e7c383852abeecb77268fc1a35d5e3a05f02fcd721c566f639b","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:52:23.647215Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2509.17405/citation-record","integrity":"/paper/2509.17405/integrity","json":"/paper/2509.17405/citation-record.json","paper":"/paper/2509.17405"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:52:24.300647Z","title":"E USE OFLARGELANGUAGEMODELS Large language models (LLMs) were used in the preparation of this paper","venue":null,"work_id":"79db993a-65de-488d-8266-e0d392822323","year":2008},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.647215Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:8e2623acf9b4736761cd060814327cc5ee63aaa56280fb6af0577211a44e02e9","observation_id":"c195b2c9-c189-48ef-97f8-59ff2ace131f","resolution":{"observed_at":"2026-08-15T15:52:24.306526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.11667","last_updated":"2022-12-06T15:16:34Z","snapshot_observed_at":"2026-08-16T18:29:29.211201Z","submitted_at":"2021-04-23T15:46:37Z","title":"Deep Learning for Bayesian Optimization of Scientific Problems with High-Dimensional Structure","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.11667","snapshot_observed_at":"2026-08-15T15:52:23.552142Z","title":"Deep learning for bayesian optimization of scientific problems with high-dimensional structure.arXiv preprint arXiv:2104.11667,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.552142Z"},"links":{"cited_paper":"/paper/2104.11667","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:0e46f08a775deee153141170d5400d331c0675a7a81058481f43a924c8e96313","observation_id":"37a0fc3e-480c-4953-afc1-fc615fb1e45a","resolution":{"observed_at":"2026-08-15T15:52:23.552142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.03845","last_updated":"2017-11-10T15:00:54Z","snapshot_observed_at":"2026-08-14T20:14:55.259031Z","submitted_at":"2017-11-10T15:00:54Z","title":"GPflowOpt: A Bayesian Optimization Library using TensorFlow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.03845","snapshot_observed_at":"2026-08-15T15:52:23.557950Z","title":"Gpflowopt: A bayesian optimization library using tensorflow.arXiv preprint arXiv:1711.03845,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.557950Z"},"links":{"cited_paper":"/paper/1711.03845","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:748d0e9d7774c1cfc2e8ed10ea90fa29b467fab54aac33873867a20e94f85038","observation_id":"c752f77d-497a-4090-b7df-65efa5db1ea4","resolution":{"observed_at":"2026-08-15T15:52:23.557950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01493","last_updated":"2024-05-15T09:17:13Z","snapshot_observed_at":"2026-08-16T14:22:06.238301Z","submitted_at":"2024-02-02T15:22:06Z","title":"Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates","version":2},"cited_work":{"arxiv_id":"2402.01493","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.01493","snapshot_observed_at":"2026-08-15T15:52:24.154464Z","title":"Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates","venue":"stat.ML","work_id":"d12e9b51-e163-4018-831d-3b00bae86e1a","year":2024},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.564185Z"},"links":{"cited_paper":"/paper/2402.01493","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:f64fbe768dee90dd309792c5a628d94d895dbbd4dbacc48c357dc085805f2213","observation_id":"9fcdbd44-542c-4e42-9d8e-f922a0eb8633","resolution":{"observed_at":"2026-08-15T15:52:24.161365Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.00402","last_updated":"2024-02-19T00:06:49Z","snapshot_observed_at":"2026-08-17T15:11:16.878138Z","submitted_at":"2023-04-30T06:03:17Z","title":"Sliced Wasserstein Estimation with Control Variates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.00402","snapshot_observed_at":"2026-08-15T15:52:23.572230Z","title":"11 Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization Khai Nguyen, Tongzheng Ren, and Nhat Ho","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.572230Z"},"links":{"cited_paper":"/paper/2305.00402","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:dc647764e0d40ee8921e10e400e448935978286fe6a4ea88bc663e58d45872e9","observation_id":"fe231631-dc75-4f21-a4b4-3d90ccc1cd76","resolution":{"observed_at":"2026-08-15T15:52:23.572230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02275","last_updated":"2025-06-12T14:30:16Z","snapshot_observed_at":"2026-08-09T12:39:46.465603Z","submitted_at":"2025-02-04T12:35:40Z","title":"A User's Guide to Sampling Strategies for Sliced Optimal Transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02275","snapshot_observed_at":"2026-08-15T15:52:23.603159Z","title":"Jasper Snoek, Hugo Larochelle, and Ryan P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.603159Z"},"links":{"cited_paper":"/paper/2502.02275","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:2d5ecb41da5ada5034e261a0c16437f657e3894fc724352707c27a6bd19a9b10","observation_id":"8ce31833-7726-4c45-9e4d-33f5e92b7293","resolution":{"observed_at":"2026-08-15T15:52:23.603159Z","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-15T15:52:24.400211Z","title":"Constrained bayesian optimization for automatic underwater vehicle hull design","venue":null,"work_id":"ec2af8db-97a7-46a6-8457-785d5667db1a","year":2023},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.610462Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:44b5eddcaf51e410bc360baf1635957bdf2e6c3e3ea207f9e9c29c3bf3468ca1","observation_id":"e6a97bea-2389-48ab-b776-3dc749941027","resolution":{"observed_at":"2026-08-15T15:52:24.406976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:23.616754Z","title":"C´edric Villani et al.Optimal transport: old and new, volume","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.616754Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:d8b53d4ca2e72736bfaae380695ca7acef0add571084f71b0a990ade6025ca9a","observation_id":"53e04e7c-2a77-4134-b423-17dadaf4d29b","resolution":{"observed_at":"2026-08-15T15:52:23.616754Z","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-15T15:52:24.379157Z","title":"3d shapenets: A deep representation for volumetric shapes","venue":null,"work_id":"d08a4da2-2c40-411e-9a24-e525a4a5f254","year":1912},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.622649Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:7d4e917fdc6a5ca92d01b56614210ee1e265ad132e601af125bd5cff5d475ab8","observation_id":"cb4ee777-27f8-4601-b312-e39d5db53758","resolution":{"observed_at":"2026-08-15T15:52:24.384986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:24.320599Z","title":"Bounding the performance of BOSW for finiteLis an interesting open question","venue":null,"work_id":"3eda1a4e-7ceb-461b-ae09-600c5b95fce7","year":2021},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.641553Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:fbf42218a64dbaf3ba47fc7e87fadf4362fc976285c07c88c9860058445251ee","observation_id":"3a0f3d3f-978c-4b66-9c83-b4ac79f0e772","resolution":{"observed_at":"2026-08-15T15:52:24.326563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:24.341889Z","title":"Figure 10: Ablation study of different values of the cosine-similarity cutoff threshold used in our method","venue":null,"work_id":"ca337f3f-4635-4b71-ba93-263c512c2198","year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.634869Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:c9630c798518f77ad268460ecdc7e7b75fe2e4078470a11848ca23356f0005cb","observation_id":"df6f08dc-adc3-4b45-8844-3afb09b9eddf","resolution":{"observed_at":"2026-08-15T15:52:24.349113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:23.577788Z","title":"9781611970081","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.577788Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:75b4887bf181ede35d79c50bfac136568610898790b4eee931952ac69944769d","observation_id":"bc0c85af-581b-490d-b7d7-174aaf313e02","resolution":{"observed_at":"2026-08-15T15:52:23.577788Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.03012","last_updated":"2015-12-09T19:42:48Z","snapshot_observed_at":"2026-08-15T22:26:43.274625Z","submitted_at":"2015-12-09T19:42:48Z","title":"ShapeNet: An Information-Rich 3D Model Repository","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03012","snapshot_observed_at":"2026-08-15T15:52:23.525762Z","title":"doi: https://doi.org/10.1016/j.spl","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.525762Z"},"links":{"cited_paper":"/paper/1512.03012","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:07ef27ae453e01d9b2e7e62fef8964e18e40e6025d90a5f45918f5d6b53e94f4","observation_id":"b1368f06-6263-4e57-8bcf-58c5674191b5","resolution":{"observed_at":"2026-08-15T15:52:23.525762Z","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":"10.1017/cbo9780511921571","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:52:23.727488Z","title":"David Duvenaud","venue":null,"work_id":"2890fc9a-01f7-41d0-8c01-cf6f986e9684","year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.532969Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:9f5549681f34fdf1571f1ad136c628ab0b4782517970d00f948d374144bdb06c","observation_id":"801193cb-80b6-4097-9bca-7b359519249a","resolution":{"observed_at":"2026-08-15T15:52:23.735782Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:24.418824Z","title":"David Eriksson and Matthias Poloczek","venue":null,"work_id":"5f5a1f25-f02c-4343-a720-1ff717a07387","year":2025},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.539066Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:3e4d162511539d3f82b5697bfe20a22652f4d196efafab5145b496a354236002","observation_id":"4544e612-2fef-483b-81ff-414b0caeb3e0","resolution":{"observed_at":"2026-08-15T15:52:24.424434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:23.519277Z","title":"Nicolas Bonnotte.Unidimensional and evolution methods for optimal transportation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.519277Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:b0e7084704fb788cfb0f3e49dd463fe43944a5cf74efec006f17716a8b36bbc2","observation_id":"7a9873a3-7906-48d0-bb57-b865460676c8","resolution":{"observed_at":"2026-08-15T15:52:23.519277Z","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-15T15:52:23.597234Z","title":"Yihang Shen and Carl Kingsford","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.597234Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:24ec285a4825a89fdca36c0b0fcdf2cfbeeb0fa6a074c38e550f1f960cb8259f","observation_id":"17d31d1e-22ff-4bc9-a994-341cce020046","resolution":{"observed_at":"2026-08-15T15:52:23.597234Z","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-15T15:52:23.591671Z","title":"Charles R Qi, Hao Su, Kaichun Mo, and Leonidas J Guibas","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.591671Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:531543420b6941c226d2e746ba74b1101c519972cd28f7eb9c9c6549862e1ae5","observation_id":"852191f4-19cb-496a-94ac-e471396a4595","resolution":{"observed_at":"2026-08-15T15:52:23.591671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.11324","last_updated":"2021-08-09T18:31:36Z","snapshot_observed_at":"2026-07-06T09:14:43.720604Z","submitted_at":"2020-04-23T17:18:34Z","title":"Weak independence of events and the converse of the Borel--Cantelli Lemma","version":3},"cited_work":{"arxiv_id":"2004.11324","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.11324","snapshot_observed_at":"2026-08-15T15:52:24.281300Z","title":"Weak independence of events and the converse of the Borel--Cantelli Lemma","venue":"math.PR","work_id":"71afb9fe-bece-4e81-a8b5-49a7e5b7ccb4","year":2020},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.512437Z"},"links":{"cited_paper":"/paper/2004.11324","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:2f21eccccca72916854b61e2c5736aaff6124f568b515774656f8fd28e798466","observation_id":"4148159d-e0fa-49b6-b828-9f93380062db","resolution":{"observed_at":"2026-08-15T15:52:24.287562Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:52:24.361870Z","title":"C ABLATIONSTUDIES Section 3.1 describes several modeling and parameter choices made for our implementation of Bayesian optimization","venue":null,"work_id":"265bc4bb-6542-4dc1-a902-b6c923763d79","year":1933},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.629277Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:ca70dd7ebbf969046615662b1e9d133aa7c9fa947615c8b9fe683e2697d2e64c","observation_id":"049a3297-bcb0-42c8-9834-9769bca0bae5","resolution":{"observed_at":"2026-08-15T15:52:24.367223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02229","last_updated":"2024-12-12T09:53:38Z","snapshot_observed_at":"2026-08-16T14:21:50.435447Z","submitted_at":"2024-02-03T18:19:46Z","title":"Vanilla Bayesian Optimization Performs Great in High Dimensions","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02229","snapshot_observed_at":"2026-08-15T15:52:23.545667Z","title":"No´emie Jaquier and Leonel Rozo","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.545667Z"},"links":{"cited_paper":"/paper/2402.02229","citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:927275c6791ad3dc334d61179560eaa430fff1b0c8274abcf6e188edab2e2f78","observation_id":"216bda21-c021-4e2d-a2ff-c995663cade5","resolution":{"observed_at":"2026-08-15T15:52:23.545667Z","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":"2509.10166","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:52:24.079565Z","title":"Gabriel Peyr´e and Marco Cuturi.Computational Optimal Transport, volume 11 ofFoundations and Trends in Machine Learning","venue":null,"work_id":"410ae362-5215-4831-b240-027076971d6c","year":null},"citing_paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T15:52:23.584605Z"},"links":{"citing_paper":"/paper/2509.17405"},"observation_digest":"sha256:62999f2ae5e28190322411a07a16bb9df236acc9642087f250490162c439ac9e","observation_id":"123ae3b8-8d8d-43cc-9ec6-881618733c1a","resolution":{"observed_at":"2026-08-15T15:52:24.099831Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.17405","last_updated":"2025-09-23T06:27:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T13:51:39.105038Z","submitted_at":"2025-09-22T07:02:19Z","title":"Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":7},"total_outbound_references":22},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2509.17405."}