{"as_of":"2026-08-09T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a35ab62a50d8287d578ad772221ea605ade252242e420238aa8a3e2643ebf6b","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:44:33.007174Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"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/2507.08053/citation-record","integrity":"/paper/2507.08053/integrity","json":"/paper/2507.08053/citation-record.json","paper":"/paper/2507.08053"},"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-06T18:44:38.076815Z","title":"and Aitken, C","venue":null,"work_id":"40c1a1fd-087b-45e4-8cc6-6f4c232ce3f3","year":1976},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.198719Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:2e82af2f942cd0cab5830588db48235ccce81cb6e72ae49fa56210ce8c5e3a0e","observation_id":"9061f843-c293-4764-8607-b900f829b43c","resolution":{"observed_at":"2026-08-06T18:44:38.159674Z","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-06T18:44:37.926125Z","title":null,"venue":null,"work_id":"c4cbed68-f8c9-4504-8064-c33ac3728582","year":2019},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.268988Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:607a6867777da9fbe86a664e7e4075506593176c939fed6e942a1a1a9904c1fc","observation_id":"0d57ca21-6bc9-4936-b50e-cabe63fbd3e0","resolution":{"observed_at":"2026-08-06T18:44:37.982667Z","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-06T18:44:37.746316Z","title":"and Poloczek, M","venue":null,"work_id":"3e70ea12-5667-4096-85b6-bcd8b055d7db","year":2018},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.407983Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:4448c5f1565ccb45f15980ab1f2eaf58b08d73631666df9e5fd530482aa95025","observation_id":"c964158a-cfcf-4d8e-a7ea-371203f061ad","resolution":{"observed_at":"2026-08-06T18:44:37.813863Z","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-06T18:44:37.643777Z","title":null,"venue":null,"work_id":"9c90e4ec-35ff-460f-a584-8e6d1dd88d91","year":2011},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.510291Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:dc53c2e285f36a303023e586cf4211e92cbfdb2ef0d334c2c4d8ff34044c8518","observation_id":"ef1385c5-e136-442f-9fa4-678eb194425b","resolution":{"observed_at":"2026-08-06T18:44:37.689545Z","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-06T18:44:37.514895Z","title":null,"venue":null,"work_id":"23aa23d8-c4b0-43a6-84d5-9cfe1b1e2487","year":2015},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.543539Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:032e038a8736974f7167243be82ab687e3e29bc211b723604035473cc3a8079b","observation_id":"eb6bda72-2aeb-4d8a-b612-c2ab579648f7","resolution":{"observed_at":"2026-08-06T18:44:37.577574Z","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-06T18:44:37.372267Z","title":null,"venue":null,"work_id":"4a89525d-f8af-4818-80b7-cbe1ee679d37","year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.613018Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:2a8c3e40c113ae222f91847a102f5a4525a4da1910cbc03eb1d5c9ea30231bc6","observation_id":"67b7ed86-0cda-4d2f-833a-18dc1dd11c5e","resolution":{"observed_at":"2026-08-06T18:44:37.433363Z","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-06T18:44:37.230818Z","title":null,"venue":null,"work_id":"97e69abb-3bb6-4597-b949-a9f96b551374","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.667421Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:20b4992f2da7bd5ac5a4841f4ee0e1124b6392c025f7b497d28a258425937a24","observation_id":"edb17292-ecfc-46a3-9d77-5fd80e177f15","resolution":{"observed_at":"2026-08-06T18:44:37.290742Z","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-06T18:44:37.077979Z","title":null,"venue":null,"work_id":"eb8a1bdd-66a1-4860-9a4e-e754ce7f4dc0","year":2024},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.778391Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:da6c020aa5246c61e5c19c339ddec86a5aeaa41b33a901fbbbc791df7f51668a","observation_id":"a5771c8d-94c3-4454-a732-c3b25cc84561","resolution":{"observed_at":"2026-08-06T18:44:37.148063Z","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-06T18:44:36.932745Z","title":null,"venue":null,"work_id":"9c3ec310-3066-49fb-827d-37fa8fd626c9","year":2018},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.841605Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:b8f585bb0f7faaa19fc8551f8bff1cda77a7242fd90e810d43c33653b9e62e90","observation_id":"b05e40d1-2ce5-4656-b7b3-bce649ffb234","resolution":{"observed_at":"2026-08-06T18:44:36.995148Z","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-06T18:44:30.931073Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:30.931073Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:bd7c65f3cc6e65f25970d77d70a11c0e94a0eb09735261b67c1ed0ba2cdfae45","observation_id":"991508e9-6f80-4dbe-b7e0-c05e3f1c4660","resolution":{"observed_at":"2026-08-06T18:44:30.931073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00772","last_updated":"2023-03-10T09:45:23Z","snapshot_observed_at":"2026-07-06T04:51:38.670553Z","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00772","snapshot_observed_at":"2026-08-06T18:44:31.030518Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.030518Z"},"links":{"cited_paper":"/paper/1604.00772","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:233b8a2bc2d09b14b7bd2dd59086cd252af53fbe922d6abbaccc3778e7c1b08b","observation_id":"9f3564db-1510-432d-a08f-72625a89423b","resolution":{"observed_at":"2026-08-06T18:44:31.030518Z","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-06T18:44:36.785994Z","title":null,"venue":null,"work_id":"93d8a67c-27a5-47f8-88ab-73be776ace45","year":2018},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.120443Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:ff57073d0a09d2efc888392866c89ef581ae294f874b2a8de07676200f2855f0","observation_id":"6cdf9129-6eed-4202-9ee2-e74f126612ff","resolution":{"observed_at":"2026-08-06T18:44:36.837193Z","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-06T18:44:36.676168Z","title":null,"venue":null,"work_id":"d73fc48f-c3c5-4e98-a242-ab3ed26589a3","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.162019Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:b2d104bd8e609e9ddd8382a051c359bbb89ddf3f2fe849bb90f59100a0d8ffd8","observation_id":"92b43d0e-8271-4e7a-b14b-eab94f32a9db","resolution":{"observed_at":"2026-08-06T18:44:36.724349Z","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":{"arxiv_id":"2402.09638","last_updated":"2024-02-15T00:52:34Z","snapshot_observed_at":"2026-07-06T17:30:21.100876Z","submitted_at":"2024-02-15T00:52:34Z","title":"Multi-Fidelity Methods for Optimization: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09638","snapshot_observed_at":"2026-08-06T18:44:31.249791Z","title":"and Li, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.249791Z"},"links":{"cited_paper":"/paper/2402.09638","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:34eba8bb1d69001c314cb898f94e3a5a743102a12af10d1457b24e4020bf2766","observation_id":"8c129dd6-f08b-4ce0-acd3-6cf7b99d6085","resolution":{"observed_at":"2026-08-06T18:44:31.249791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05118","last_updated":"2018-07-13T15:00:17Z","snapshot_observed_at":"2026-07-06T06:50:03.471843Z","submitted_at":"2018-07-13T15:00:17Z","title":"Tune: A Research Platform for Distributed Model Selection and Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.05118","snapshot_observed_at":"2026-08-06T18:44:31.314660Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.314660Z"},"links":{"cited_paper":"/paper/1807.05118","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:6a81b19517b4d5e9f1d41e22946d63b513bad76893d2aa7de3dea9a658b9bf2e","observation_id":"c98301c5-dac9-4ccd-a836-f30c347e6260","resolution":{"observed_at":"2026-08-06T18:44:31.314660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.07269","last_updated":"2016-04-25T14:17:08Z","snapshot_observed_at":"2026-07-06T04:53:59.754200Z","submitted_at":"2016-04-25T14:17:08Z","title":"CMA-ES for Hyperparameter Optimization of Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.07269","snapshot_observed_at":"2026-08-06T18:44:31.377505Z","title":"and Hutter, F","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.377505Z"},"links":{"cited_paper":"/paper/1604.07269","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:af94bde05bb7e5cb02d768298f6b047ada9d8945e5727e43de089d594b6a3a70","observation_id":"1e010314-666a-4d57-b3ac-142492960955","resolution":{"observed_at":"2026-08-06T18:44:31.377505Z","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-06T18:44:36.590337Z","title":null,"venue":null,"work_id":"6727939d-f31b-4821-9d75-3d66aca52379","year":2019},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.456515Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:4a6d8ae368478e66deebded091e092ea6be629c3eae706ef89391facd5be0b06","observation_id":"95463461-8991-460a-9038-5c8b341a64a1","resolution":{"observed_at":"2026-08-06T18:44:36.620626Z","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-06T18:44:36.472417Z","title":null,"venue":null,"work_id":"847f25cd-fd6c-409a-b4d0-049993c21701","year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.538511Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:d7726751a13dfd270ee345ca350de226564acc6ba4fc395c71ec71217187d322","observation_id":"541bea2e-9ca7-4928-8730-7fe1802a5cad","resolution":{"observed_at":"2026-08-06T18:44:36.514458Z","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-06T18:44:36.340006Z","title":null,"venue":null,"work_id":"c9abd456-02c0-436e-bb2d-583ed4bf9644","year":2020},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.603174Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:64c8a8020dd63c4261a31d33836351c303eba305dd15aa95904f2082e02028ab","observation_id":"88a72ce2-1ec4-4671-a018-dcd8516b6b28","resolution":{"observed_at":"2026-08-06T18:44:36.398056Z","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-06T18:44:36.147090Z","title":null,"venue":null,"work_id":"d7075d64-2b3b-4d40-b372-2c6086fa0b89","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.688584Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:8d06f67bc1506be0d824d2e522987650f7ca2556e1c7084ab395a9e62ad4c950","observation_id":"c6dbec41-1a9f-4d4c-b1b4-265d589823c9","resolution":{"observed_at":"2026-08-06T18:44:36.243421Z","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-06T18:44:35.965261Z","title":null,"venue":null,"work_id":"d8134174-5d42-4af3-9e14-d0af0c827c3a","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.754235Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:7ad1bdfc395f10b7afbe0b820bff485a6727e4a066a23ba2d17e03db0640cab8","observation_id":"08a495f5-4b3f-4975-ab1e-28d7c3cb337f","resolution":{"observed_at":"2026-08-06T18:44:36.037810Z","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-06T18:44:35.748539Z","title":null,"venue":null,"work_id":"ca5e530c-972e-42b0-810e-e58c148d55d2","year":2015},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.817664Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:b6eb1da76607bec2d3a19d9a27009869e81d5c5fac931136e4daf87973315805","observation_id":"5980e8e1-ea9d-43db-ba9b-24dede0a51aa","resolution":{"observed_at":"2026-08-06T18:44:35.855895Z","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-06T18:44:35.550527Z","title":null,"venue":null,"work_id":"1e124258-4a65-42cf-bde6-35829eed2c6b","year":2012},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.907154Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:3c7bb835d763251058ead307ce1ef953cd33337c3f2a82bef917382f3faff592","observation_id":"aaa81802-d45d-4a9b-9796-2cdb79ad929d","resolution":{"observed_at":"2026-08-06T18:44:35.620708Z","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":{"arxiv_id":"2210.09943","last_updated":"2023-12-06T19:51:43Z","snapshot_observed_at":"2026-07-06T14:07:15.678393Z","submitted_at":"2022-10-18T15:46:05Z","title":"Rethinking Bias Mitigation: Fairer Architectures Make for Fairer Face Recognition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09943","snapshot_observed_at":"2026-08-06T18:44:31.984512Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:31.984512Z"},"links":{"cited_paper":"/paper/2210.09943","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:ed7529eac644d29f94fcce139a2449ad9052429a616952cc12326596b0802f0a","observation_id":"7c2bceea-a177-4833-99da-41c049e47a0e","resolution":{"observed_at":"2026-08-06T18:44:31.984512Z","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-06T18:44:35.306303Z","title":null,"venue":null,"work_id":"ea9f6edb-5583-49a2-a2ab-f3edd79b4ea2","year":2021},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.064726Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:5d9595e9486c67e1a333c2889589eb7af464fff326289d1321139bf6124ac1a5","observation_id":"63696969-bd82-40aa-a965-f48264858bee","resolution":{"observed_at":"2026-08-06T18:44:35.438551Z","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":{"arxiv_id":"2207.07875","last_updated":"2022-07-16T08:31:11Z","snapshot_observed_at":"2026-07-06T13:32:01.087734Z","submitted_at":"2022-07-16T08:31:11Z","title":"On the Importance of Hyperparameters and Data Augmentation for Self-Supervised Learning","version":1},"cited_work":{"arxiv_id":"2207.07875","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.07875","snapshot_observed_at":"2026-08-06T18:44:34.140587Z","title":"On the Importance of Hyperparameters and Data Augmentation for Self-Supervised Learning","venue":"cs.LG","work_id":"cd6767bb-b5c9-443a-afb0-1e117a56cbea","year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.153937Z"},"links":{"cited_paper":"/paper/2207.07875","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:c3c66f5e39d6cc22ad4df0b8f36c3a2b7e61d068f7bcaea1455c3e94e6cbdb83","observation_id":"788f6d3d-aabc-4fe1-b8a4-4758e006b375","resolution":{"observed_at":"2026-08-06T18:44:34.205853Z","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":{"arxiv_id":"2305.17595","last_updated":"2023-06-29T16:27:23Z","snapshot_observed_at":"2026-07-06T15:34:25.833524Z","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-06T18:36:12.941806Z","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:8464b6d5e523065469859d5106a32e5099163df8f7831d3cedd0cbc09f2c9465","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-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":"2304.11127","last_updated":"2026-05-31T18:23:52Z","snapshot_observed_at":"2026-07-06T15:18:30.127408Z","submitted_at":"2023-04-21T17:02:38Z","title":"Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11127","snapshot_observed_at":"2026-08-06T18:44:32.269576Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.269576Z"},"links":{"cited_paper":"/paper/2304.11127","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:bb4e5ee044e2029c2dc653ae6c64085d1e3e6423b9f730386204197034aad2f0","observation_id":"55efff61-1938-4fe4-bad5-b85881fff1dd","resolution":{"observed_at":"2026-08-06T18:44:32.269576Z","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-06T18:44:35.120415Z","title":null,"venue":null,"work_id":"3abb37ef-ed4f-4a92-979c-9ba5c3464b28","year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.345884Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:71bb58655df88a65a0e42b47dea8304cb456d4fe1ccd9d33bd27649675904138","observation_id":"61e5f866-9ed2-488c-8a2c-0dc64624ba05","resolution":{"observed_at":"2026-08-06T18:44:35.219577Z","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-06T18:44:34.950693Z","title":null,"venue":null,"work_id":"f8288882-fa9f-46a6-9fc2-a3ed8475bd13","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.398860Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:cc09440dfedabded553b9df1e46f46ab13abf6fb4d642e87a658fda144bef281","observation_id":"5203a43e-fcbb-4476-b14c-dfbcb130ae89","resolution":{"observed_at":"2026-08-06T18:44:35.045862Z","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":{"arxiv_id":"2211.14411","last_updated":"2026-06-01T14:15:17Z","snapshot_observed_at":"2026-08-06T14:40:31.750675Z","submitted_at":"2022-11-26T00:25:11Z","title":"c-TPE: Tree-structured Parzen Estimator with Inequality Constraints for Expensive Hyperparameter Optimization","version":5},"cited_work":{"arxiv_id":"2211.14411","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.14411","snapshot_observed_at":"2026-08-06T18:44:33.694440Z","title":"c-TPE: Tree-structured Parzen Estimator with Inequality Constraints for Expensive Hyperparameter Optimization","venue":"cs.LG","work_id":"949e692c-0630-45ab-856c-5877508281a5","year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.466972Z"},"links":{"cited_paper":"/paper/2211.14411","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:2bd2bcbd1a0c97a297912c9393333d0663caf0ba3c165cf25e2673fab463c1be","observation_id":"160f72f9-f841-4494-9e1a-b125e83b4697","resolution":{"observed_at":"2026-08-06T18:44:33.752080Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:44:34.766336Z","title":"and Hutter, F","venue":null,"work_id":"ea81bf54-3aba-4695-bc42-9ca4b8d0baec","year":2023},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.512927Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:dbb6a0bcc10886f78b7e2f430a53d4040dde82ddf3751a66f5c72fb05871fd61","observation_id":"129aaa02-5e14-4e63-9e0a-5f8d821b2e6b","resolution":{"observed_at":"2026-08-06T18:44:34.856875Z","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":{"arxiv_id":"2403.01888","last_updated":"2024-08-19T08:07:38Z","snapshot_observed_at":"2026-07-06T17:39:03.755444Z","submitted_at":"2024-03-04T09:49:35Z","title":"Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on Zero-Cost Benchmarks","version":3},"cited_work":{"arxiv_id":"2403.01888","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.01888","snapshot_observed_at":"2026-08-06T18:44:33.452428Z","title":"Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on Zero-Cost Benchmarks","venue":"cs.AI","work_id":"edf6b185-a55f-4a23-beaa-c96d68634b5c","year":2024},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.575478Z"},"links":{"cited_paper":"/paper/2403.01888","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:7f56ad1dc1ce148733564e6b6be9d169efb1b3ff96c6a5b69ad42d6c94e94e19","observation_id":"bd0b5f05-3402-4520-9cf4-d2bd9c0077a5","resolution":{"observed_at":"2026-08-06T18:44:33.550208Z","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":{"arxiv_id":"2011.02004","last_updated":"2020-11-03T20:56:13Z","snapshot_observed_at":"2026-08-08T00:44:42.814769Z","submitted_at":"2020-11-03T20:56:13Z","title":"Bayesian Variational Optimization for Combinatorial Spaces","version":1},"cited_work":{"arxiv_id":"2011.02004","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.02004","snapshot_observed_at":"2026-08-06T18:44:33.209672Z","title":"Bayesian Variational Optimization for Combinatorial Spaces","venue":"cs.LG","work_id":"484b9863-2026-4d2d-b0cf-c88d9c603857","year":2020},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.672080Z"},"links":{"cited_paper":"/paper/2011.02004","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:6f027db9f06ca06ef44cb5324b709bfc93eb726b0b9be593ae8a001a36dff157","observation_id":"d01d59e3-5542-421b-98c7-53373b4b3b5e","resolution":{"observed_at":"2026-08-06T18:44:33.329306Z","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":{"arxiv_id":"2203.03466","last_updated":"2022-03-28T08:12:14Z","snapshot_observed_at":"2026-08-07T09:04:57.100575Z","submitted_at":"2022-03-07T15:37:35Z","title":"Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.03466","snapshot_observed_at":"2026-08-06T18:44:32.764549Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:32.764549Z"},"links":{"cited_paper":"/paper/2203.03466","citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:1ab371e410ee6d344e6fa0710da1702fc261817d95ba600896dd6133ce615a7d","observation_id":"3427ea84-fa32-4cde-859f-82d61e64520b","resolution":{"observed_at":"2026-08-06T18:44:32.764549Z","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-06T18:44:34.583633Z","title":null,"venue":null,"work_id":"54f73668-dc61-499a-94d6-ab1c0b446c95","year":2021},"citing_paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T18:44:33.007174Z"},"links":{"citing_paper":"/paper/2507.08053"},"observation_digest":"sha256:76c4be7a16bf7041edd9e356756665323d8034d4cfa3420ba771fc9b43d2eaae","observation_id":"59003350-25f7-4805-823b-4c029347f509","resolution":{"observed_at":"2026-08-06T18:44:34.646812Z","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"}}],"paper":{"arxiv_id":"2507.08053","last_updated":"2025-07-15T08:40:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T18:36:12.941806Z","submitted_at":"2025-07-10T08:26:49Z","title":"Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":5,"verified_fuzzy":3},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2507.08053."}