{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B5VEEGMKEW6SKAS3ICUBWDGMP2","short_pith_number":"pith:B5VEEGMK","schema_version":"1.0","canonical_sha256":"0f6a42198a25bd25025b40a81b0ccc7ea5eb22b9182546d6cd015896db966141","source":{"kind":"arxiv","id":"1703.10342","version":1},"attestation_state":"computed","paper":{"title":"Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Holger H. Hoos, Katharina Eggensperger, Kevin Leyton-Brown, Marius Lindauer","submitted_at":"2017-03-30T07:50:15Z","abstract_excerpt":"The optimization of algorithm (hyper-)parameters is crucial for achieving peak performance across a wide range of domains, ranging from deep neural networks to solvers for hard combinatorial problems. The resulting algorithm configuration (AC) problem has attracted much attention from the machine learning community. However, the proper evaluation of new AC procedures is hindered by two key hurdles. First, AC benchmarks are hard to set up. Second and even more significantly, they are computationally expensive: a single run of an AC procedure involves many costly runs of the target algorithm who"},"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":"1703.10342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T07:50:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"58dfed2ea397d5ab167cedaae38aeb6d1c80c0d44f0f4cda69218cd815507e4a","abstract_canon_sha256":"7d2277187c060df17adff1849ed9bb3336ef55d2eb14a3f695a3f2dddee85a53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.317511Z","signature_b64":"FPXavdKcEpqBvFP96K07kulY9j5PIa5XugdQFxOzUqILOBo/OW5ats/jpsmIwBiSVQt1uCPmOpS1FFcG+V5TAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f6a42198a25bd25025b40a81b0ccc7ea5eb22b9182546d6cd015896db966141","last_reissued_at":"2026-05-18T00:47:37.316883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.316883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Holger H. Hoos, Katharina Eggensperger, Kevin Leyton-Brown, Marius Lindauer","submitted_at":"2017-03-30T07:50:15Z","abstract_excerpt":"The optimization of algorithm (hyper-)parameters is crucial for achieving peak performance across a wide range of domains, ranging from deep neural networks to solvers for hard combinatorial problems. The resulting algorithm configuration (AC) problem has attracted much attention from the machine learning community. However, the proper evaluation of new AC procedures is hindered by two key hurdles. First, AC benchmarks are hard to set up. Second and even more significantly, they are computationally expensive: a single run of an AC procedure involves many costly runs of the target algorithm who"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10342","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":""},"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":"1703.10342","created_at":"2026-05-18T00:47:37.316978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10342v1","created_at":"2026-05-18T00:47:37.316978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10342","created_at":"2026-05-18T00:47:37.316978+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5VEEGMKEW6S","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5VEEGMKEW6SKAS3","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5VEEGMK","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2","json":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2.json","graph_json":"https://pith.science/api/pith-number/B5VEEGMKEW6SKAS3ICUBWDGMP2/graph.json","events_json":"https://pith.science/api/pith-number/B5VEEGMKEW6SKAS3ICUBWDGMP2/events.json","paper":"https://pith.science/paper/B5VEEGMK"},"agent_actions":{"view_html":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2","download_json":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2.json","view_paper":"https://pith.science/paper/B5VEEGMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10342&json=true","fetch_graph":"https://pith.science/api/pith-number/B5VEEGMKEW6SKAS3ICUBWDGMP2/graph.json","fetch_events":"https://pith.science/api/pith-number/B5VEEGMKEW6SKAS3ICUBWDGMP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2/action/storage_attestation","attest_author":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2/action/author_attestation","sign_citation":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2/action/citation_signature","submit_replication":"https://pith.science/pith/B5VEEGMKEW6SKAS3ICUBWDGMP2/action/replication_record"}},"created_at":"2026-05-18T00:47:37.316978+00:00","updated_at":"2026-05-18T00:47:37.316978+00:00"}