{"as_of":"2026-08-21T22:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:beb6980a1d0100b4bf52fb09b936ef93626f2f67c1148716ac5582322c04cb4a","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-21T06:32:19.484+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-06T18:44:32.217486Z","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-06T18:44:33.933656Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.17595","last_updated":"2023-06-29T16:27:23Z","snapshot_observed_at":"2026-08-16T15:28:59.425889Z","submitted_at":"2023-05-27T23:28:54Z","title":"Python Wrapper for Simulating Multi-Fidelity Optimization on HPO Benchmarks without Any Wait","version":2},"cited_work":{"arxiv_id":"2305.17595","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.17595","snapshot_observed_at":"2026-08-06T18:44:33.933656Z","title":"Python Wrapper for Simulating Multi-Fidelity Optimization on HPO Benchmarks without Any Wait","venue":"cs.LG","work_id":"e30d92a5-29d8-4dba-afb0-c32e87129f4c","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-19T20:36:52.239375Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.217486Z"},"links":{"cited_paper":"/paper/2305.17595","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:e855c33d025eae5dba69050d87456c0aa1dc43218871d45abab8835ba0350ec0","observation_id":"574b863e-09f5-4acd-b210-92f421567bf9","resolution":{"observed_at":"2026-08-06T18:44:34.006676Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.17595/citation-record","integrity":"/paper/2305.17595/integrity","json":"/paper/2305.17595/citation-record.json","paper":"/paper/2305.17595"},"outbound":[],"paper":{"arxiv_id":"2305.17595","last_updated":"2023-06-29T16:27:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:28:59.425889Z","submitted_at":"2023-05-27T23:28:54Z","title":"Python Wrapper for Simulating Multi-Fidelity Optimization on HPO Benchmarks without Any Wait"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.17595."}