{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AWGFQFONQQSZPBKBVN7VOFLHJF","short_pith_number":"pith:AWGFQFON","schema_version":"1.0","canonical_sha256":"058c5815cd8425978541ab7f571567494ae31df7a515f2d3a21ebf5305a333b4","source":{"kind":"arxiv","id":"2109.06716","version":3},"attestation_state":"computed","paper":{"title":"HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Klein, Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Neeratyoy Mallik, Noor Awad, Philipp M\\\"uller, Ren\\'e Sass","submitted_at":"2021-09-14T14:28:51Z","abstract_excerpt":"To achieve peak predictive performance, hyperparameter optimization (HPO) is a crucial component of machine learning and its applications. Over the last years, the number of efficient algorithms and tools for HPO grew substantially. At the same time, the community is still lacking realistic, diverse, computationally cheap, and standardized benchmarks. This is especially the case for multi-fidelity HPO methods. To close this gap, we propose HPOBench, which includes 7 existing and 5 new benchmark families, with a total of more than 100 multi-fidelity benchmark problems. HPOBench allows to run th"},"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":"2109.06716","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T14:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"f3f7cb4671916270825a3e2eea8ed99aed714850c81023de947a901255ac40b0","abstract_canon_sha256":"a9e4eda791b888a6ad806a6cd886d5517e369d6946f26620469cb608e28101a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:02.430454Z","signature_b64":"I6ag3bv1+nQtgS45CmE0I8J7IVl3bz5W0oypPYPQqCOtNnTMM2HWnq8vrVEDncwFPiLE4+GqPGDUqamJLR+NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058c5815cd8425978541ab7f571567494ae31df7a515f2d3a21ebf5305a333b4","last_reissued_at":"2026-07-05T05:04:02.430056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:02.430056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Klein, Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Neeratyoy Mallik, Noor Awad, Philipp M\\\"uller, Ren\\'e Sass","submitted_at":"2021-09-14T14:28:51Z","abstract_excerpt":"To achieve peak predictive performance, hyperparameter optimization (HPO) is a crucial component of machine learning and its applications. Over the last years, the number of efficient algorithms and tools for HPO grew substantially. At the same time, the community is still lacking realistic, diverse, computationally cheap, and standardized benchmarks. This is especially the case for multi-fidelity HPO methods. To close this gap, we propose HPOBench, which includes 7 existing and 5 new benchmark families, with a total of more than 100 multi-fidelity benchmark problems. HPOBench allows to run th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.06716","kind":"arxiv","version":3},"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/2109.06716/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":"2109.06716","created_at":"2026-07-05T05:04:02.430111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.06716v3","created_at":"2026-07-05T05:04:02.430111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06716","created_at":"2026-07-05T05:04:02.430111+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWGFQFONQQSZ","created_at":"2026-07-05T05:04:02.430111+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWGFQFONQQSZPBKB","created_at":"2026-07-05T05:04:02.430111+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWGFQFON","created_at":"2026-07-05T05:04:02.430111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25207","citing_title":"ASAP: Agent-System Co-Design for Wall-Clock-Centered Auto HPO Research for ML Experiments","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30029","citing_title":"RAISE: RAG Design as an Architecture Search Problem","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12005","citing_title":"BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04895","citing_title":"Regime-Conditioned Evaluation in Multi-Context Bayesian Optimization","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF","json":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF.json","graph_json":"https://pith.science/api/pith-number/AWGFQFONQQSZPBKBVN7VOFLHJF/graph.json","events_json":"https://pith.science/api/pith-number/AWGFQFONQQSZPBKBVN7VOFLHJF/events.json","paper":"https://pith.science/paper/AWGFQFON"},"agent_actions":{"view_html":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF","download_json":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF.json","view_paper":"https://pith.science/paper/AWGFQFON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.06716&json=true","fetch_graph":"https://pith.science/api/pith-number/AWGFQFONQQSZPBKBVN7VOFLHJF/graph.json","fetch_events":"https://pith.science/api/pith-number/AWGFQFONQQSZPBKBVN7VOFLHJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF/action/storage_attestation","attest_author":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF/action/author_attestation","sign_citation":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF/action/citation_signature","submit_replication":"https://pith.science/pith/AWGFQFONQQSZPBKBVN7VOFLHJF/action/replication_record"}},"created_at":"2026-07-05T05:04:02.430111+00:00","updated_at":"2026-07-05T05:04:02.430111+00:00"}