{"as_of":"2026-08-11T17:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56de443a420b4b330f4c624119c2f9ad70371bfb5bd1c359d81d2e0c59e34911","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:48:55.820597Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T15:48:55.924354Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.10041","last_updated":"2020-03-27T04:37:48Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:40:05Z","title":"Efficient Batch Black-box Optimization with Deterministic Regret Bounds","version":3},"cited_work":{"arxiv_id":"1905.10041","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.10041","snapshot_observed_at":"2026-08-08T15:48:55.924354Z","title":"Efficient Batch Black-box Optimization with Deterministic Regret Bounds","venue":"cs.LG","work_id":"067ea6d3-e03b-4dca-a5d7-bf6d0c2f9303","year":2019},"citing_paper":{"arxiv_id":"2502.06363","last_updated":"2025-02-10T11:29:27Z","snapshot_observed_at":"2026-08-08T15:38:31.274358Z","submitted_at":"2025-02-10T11:29:27Z","title":"Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T15:48:55.820597Z"},"links":{"cited_paper":"/paper/1905.10041","citing_paper":"/paper/2502.06363"},"observation_digest":"sha256:8872761a720bef28c624a5d2349608bbfaadda2457f04cb30b9230cff078ba46","observation_id":"75245271-cc95-457c-bca4-052accccd658","resolution":{"observed_at":"2026-08-08T15:48:55.931319Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.10041/citation-record","integrity":"/paper/1905.10041/integrity","json":"/paper/1905.10041/citation-record.json","paper":"/paper/1905.10041"},"outbound":[],"paper":{"arxiv_id":"1905.10041","last_updated":"2020-03-27T04:37:48Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:40:05Z","title":"Efficient Batch Black-box Optimization with Deterministic Regret Bounds"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1905.10041."}