{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4AOP2YWLIKJEM3PWMXMVSYXPTI","short_pith_number":"pith:4AOP2YWL","schema_version":"1.0","canonical_sha256":"e01cfd62cb4292466df665d95962ef9a1002112db8997619022e4e37d9e86958","source":{"kind":"arxiv","id":"2109.09831","version":2},"attestation_state":"computed","paper":{"title":"SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Carolin Benjamins, Difan Deng, Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Ren\\'e Sass, Tim Ruhopf","submitted_at":"2021-09-20T20:33:25Z","abstract_excerpt":"Algorithm parameters, in particular hyperparameters of machine learning algorithms, can substantially impact their performance. To support users in determining well-performing hyperparameter configurations for their algorithms, datasets and applications at hand, SMAC3 offers a robust and flexible framework for Bayesian Optimization, which can improve performance within a few evaluations. It offers several facades and pre-sets for typical use cases, such as optimizing hyperparameters, solving low dimensional continuous (artificial) global optimization problems and configuring algorithms to perf"},"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.09831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-20T20:33:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5dc8f31ab836f67785da56817edbdff1fb52140ad1c59e15f398e2f12ceaf2a7","abstract_canon_sha256":"2d1e48c1c86d4f90aae0ea293fe3d2c9d45d867d7096916fb2e71f12c9b37bca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:01.976307Z","signature_b64":"38qljakpnSa1Xcorwz0h3vNJaEj5zsO+73MJdiV/kDMhKOfoO/LQQtdc49g5soO7v09FymQLo4xqlq8yFphXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01cfd62cb4292466df665d95962ef9a1002112db8997619022e4e37d9e86958","last_reissued_at":"2026-07-05T03:55:01.975774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:01.975774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'e Biedenkapp, Carolin Benjamins, Difan Deng, Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Ren\\'e Sass, Tim Ruhopf","submitted_at":"2021-09-20T20:33:25Z","abstract_excerpt":"Algorithm parameters, in particular hyperparameters of machine learning algorithms, can substantially impact their performance. To support users in determining well-performing hyperparameter configurations for their algorithms, datasets and applications at hand, SMAC3 offers a robust and flexible framework for Bayesian Optimization, which can improve performance within a few evaluations. It offers several facades and pre-sets for typical use cases, such as optimizing hyperparameters, solving low dimensional continuous (artificial) global optimization problems and configuring algorithms to perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09831","kind":"arxiv","version":2},"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.09831/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.09831","created_at":"2026-07-05T03:55:01.975835+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09831v2","created_at":"2026-07-05T03:55:01.975835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09831","created_at":"2026-07-05T03:55:01.975835+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AOP2YWLIKJE","created_at":"2026-07-05T03:55:01.975835+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AOP2YWLIKJEM3PW","created_at":"2026-07-05T03:55:01.975835+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AOP2YWL","created_at":"2026-07-05T03:55:01.975835+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"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":19,"is_internal_anchor":false},{"citing_arxiv_id":"2310.02540","citing_title":"Auto-FP: An Experimental Study of Automated Feature Preprocessing for Tabular Data","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17842","citing_title":"QuickScope: Certifying Hard Questions in Dynamic LLM Benchmarks","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI","json":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI.json","graph_json":"https://pith.science/api/pith-number/4AOP2YWLIKJEM3PWMXMVSYXPTI/graph.json","events_json":"https://pith.science/api/pith-number/4AOP2YWLIKJEM3PWMXMVSYXPTI/events.json","paper":"https://pith.science/paper/4AOP2YWL"},"agent_actions":{"view_html":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI","download_json":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI.json","view_paper":"https://pith.science/paper/4AOP2YWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09831&json=true","fetch_graph":"https://pith.science/api/pith-number/4AOP2YWLIKJEM3PWMXMVSYXPTI/graph.json","fetch_events":"https://pith.science/api/pith-number/4AOP2YWLIKJEM3PWMXMVSYXPTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI/action/storage_attestation","attest_author":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI/action/author_attestation","sign_citation":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI/action/citation_signature","submit_replication":"https://pith.science/pith/4AOP2YWLIKJEM3PWMXMVSYXPTI/action/replication_record"}},"created_at":"2026-07-05T03:55:01.975835+00:00","updated_at":"2026-07-05T03:55:01.975835+00:00"}