{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:37HJVKG67ZIYR3FRVUYNCCM26A","short_pith_number":"pith:37HJVKG6","schema_version":"1.0","canonical_sha256":"dfce9aa8defe5188ecb1ad30d1099af00e0b370759d186dd5ab2394b853a2d9f","source":{"kind":"arxiv","id":"1908.06756","version":1},"attestation_state":"computed","paper":{"title":"BOAH: A Tool Suite for Multi-Fidelity Bayesian Optimization & Analysis of Hyperparameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Frank Hutter, Joshua Marben, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Philipp M\\\"uller","submitted_at":"2019-08-16T10:01:03Z","abstract_excerpt":"Hyperparameter optimization and neural architecture search can become prohibitively expensive for regular black-box Bayesian optimization because the training and evaluation of a single model can easily take several hours. To overcome this, we introduce a comprehensive tool suite for effective multi-fidelity Bayesian optimization and the analysis of its runs. The suite, written in Python, provides a simple way to specify complex design spaces, a robust and efficient combination of Bayesian optimization and HyperBand, and a comprehensive analysis of the optimization process and its outcomes."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.06756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-16T10:01:03Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"cb28d390d1f9a13fbcaacdcc52ec24a1cd469cf9607c4051a05417dfdd7b33ce","abstract_canon_sha256":"e593e48ec3da80d8ee45a41841effcd72bc77b09ed5c6c6bb5b335045a20cc44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:19.084734Z","signature_b64":"PaZtniCqIW5TIxQegVcLBDfOzDFBoKjxCtxA6dfZPmRo8CJTXRcxHgZB4/mcql5ZiredyhTwdidgWeWuH6lvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfce9aa8defe5188ecb1ad30d1099af00e0b370759d186dd5ab2394b853a2d9f","last_reissued_at":"2026-07-04T23:58:19.084385Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:19.084385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BOAH: A Tool Suite for Multi-Fidelity Bayesian Optimization & Analysis of Hyperparameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Frank Hutter, Joshua Marben, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Philipp M\\\"uller","submitted_at":"2019-08-16T10:01:03Z","abstract_excerpt":"Hyperparameter optimization and neural architecture search can become prohibitively expensive for regular black-box Bayesian optimization because the training and evaluation of a single model can easily take several hours. To overcome this, we introduce a comprehensive tool suite for effective multi-fidelity Bayesian optimization and the analysis of its runs. The suite, written in Python, provides a simple way to specify complex design spaces, a robust and efficient combination of Bayesian optimization and HyperBand, and a comprehensive analysis of the optimization process and its outcomes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06756","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06756/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.06756","created_at":"2026-07-04T23:58:19.084446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06756v1","created_at":"2026-07-04T23:58:19.084446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06756","created_at":"2026-07-04T23:58:19.084446+00:00"},{"alias_kind":"pith_short_12","alias_value":"37HJVKG67ZIY","created_at":"2026-07-04T23:58:19.084446+00:00"},{"alias_kind":"pith_short_16","alias_value":"37HJVKG67ZIYR3FR","created_at":"2026-07-04T23:58:19.084446+00:00"},{"alias_kind":"pith_short_8","alias_value":"37HJVKG6","created_at":"2026-07-04T23:58:19.084446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21467","citing_title":"Efficient and Reuseable Cloud Configuration Search Using Discovery Spaces","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A","json":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A.json","graph_json":"https://pith.science/api/pith-number/37HJVKG67ZIYR3FRVUYNCCM26A/graph.json","events_json":"https://pith.science/api/pith-number/37HJVKG67ZIYR3FRVUYNCCM26A/events.json","paper":"https://pith.science/paper/37HJVKG6"},"agent_actions":{"view_html":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A","download_json":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A.json","view_paper":"https://pith.science/paper/37HJVKG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06756&json=true","fetch_graph":"https://pith.science/api/pith-number/37HJVKG67ZIYR3FRVUYNCCM26A/graph.json","fetch_events":"https://pith.science/api/pith-number/37HJVKG67ZIYR3FRVUYNCCM26A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A/action/storage_attestation","attest_author":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A/action/author_attestation","sign_citation":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A/action/citation_signature","submit_replication":"https://pith.science/pith/37HJVKG67ZIYR3FRVUYNCCM26A/action/replication_record"}},"created_at":"2026-07-04T23:58:19.084446+00:00","updated_at":"2026-07-04T23:58:19.084446+00:00"}