{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VDONACX5R7QJSACSSQGQX222E7","short_pith_number":"pith:VDONACX5","schema_version":"1.0","canonical_sha256":"a8dcd00afd8fe0990052940d0beb5a27e69fcda576e1bd156f7d5af7f0cadc16","source":{"kind":"arxiv","id":"1907.10902","version":1},"attestation_state":"computed","paper":{"title":"Optuna: A Next-generation Hyperparameter Optimization Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Masanori Koyama, Shotaro Sano, Takeru Ohta, Takuya Akiba, Toshihiko Yanase","submitted_at":"2019-07-25T08:55:22Z","abstract_excerpt":"The purpose of this study is to introduce new design-criteria for next-generation hyperparameter optimization software. The criteria we propose include (1) define-by-run API that allows users to construct the parameter search space dynamically, (2) efficient implementation of both searching and pruning strategies, and (3) easy-to-setup, versatile architecture that can be deployed for various purposes, ranging from scalable distributed computing to light-weight experiment conducted via interactive interface. In order to prove our point, we will introduce Optuna, an optimization software which i"},"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":"1907.10902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T08:55:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"db97abedf52f104a087fe1ec862c39f024bf89fe0d343f75ef7401f2a045d046","abstract_canon_sha256":"681a5e8d79ee648b04d9591889f8c1a970c41c96012e3690d17869e981831125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:34.107008Z","signature_b64":"ugHUFDtLd4yxtkPL/BGLICtkbKOefh77uiCj3H3og25SVmqSk5saV/R/PQhmyxyjhys9YO9jpP151zk1CbcNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8dcd00afd8fe0990052940d0beb5a27e69fcda576e1bd156f7d5af7f0cadc16","last_reissued_at":"2026-05-17T23:39:34.106398Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:34.106398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optuna: A Next-generation Hyperparameter Optimization Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Masanori Koyama, Shotaro Sano, Takeru Ohta, Takuya Akiba, Toshihiko Yanase","submitted_at":"2019-07-25T08:55:22Z","abstract_excerpt":"The purpose of this study is to introduce new design-criteria for next-generation hyperparameter optimization software. The criteria we propose include (1) define-by-run API that allows users to construct the parameter search space dynamically, (2) efficient implementation of both searching and pruning strategies, and (3) easy-to-setup, versatile architecture that can be deployed for various purposes, ranging from scalable distributed computing to light-weight experiment conducted via interactive interface. In order to prove our point, we will introduce Optuna, an optimization software which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10902","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":"1907.10902","created_at":"2026-05-17T23:39:34.106511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10902v1","created_at":"2026-05-17T23:39:34.106511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10902","created_at":"2026-05-17T23:39:34.106511+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDONACX5R7QJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDONACX5R7QJSACS","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDONACX5","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":22,"internal_anchor_count":10,"sample":[{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2503.01605","citing_title":"A Leaf-Level Dataset for Soybean-Cotton Detection and Segmentation","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19633","citing_title":"optimize_anything: A Universal API for Optimizing any Text Parameter","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2507.18236","citing_title":"Search for the lepton-flavor-violating $\\tau^{-} \\rightarrow e^{\\mp} \\ell^{\\pm} \\ell^{\\mp}$ decays at Belle II","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2509.09505","citing_title":"Combating the Memory Walls: Optimization Pathways for Long-Context Agentic LLM Inference","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2510.13716","citing_title":"Searches for $B^0\\to K^+\\pi^-\\tau^+\\tau^-$ and $B_s^0\\to K^+K^-\\tau^+\\tau^-$ decays","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2511.22277","citing_title":"TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2602.08764","citing_title":"Efficient Brain Extraction of MRI Scans with Mild to Moderate Neuropathology","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2603.10146","citing_title":"Polarized Target Nuclear Magnetic Resonance Measurements with Deep Neural Networks","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14055","citing_title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03203","citing_title":"PR3DICTR: A modular AI framework for medical 3D image-based detection and outcome prediction","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12208","citing_title":"Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09022","citing_title":"Inferring identified hadron production in $pp$ collisions with physics-informed machine learning at the LHC","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24403","citing_title":"An Automatic Ground Collision Avoidance System with Reinforcement Learning","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13687","citing_title":"VIGILant: an automatic classification pipeline for glitches in the Virgo detector","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08396","citing_title":"Search for the lepton-flavour violating decays $B^+ \\to \\pi^+ \\mu^\\pm e^\\mp$","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08427","citing_title":"Multivariate quantum reservoir computing with discrete and continuous variable systems","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06835","citing_title":"On Privacy Leakage in Tabular Diffusion Models: Influential Factors, Attacker Knowledge, and Metrics","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14078","citing_title":"Natural Language Embeddings of Synthesis and Testing conditions Enhance Glass Dissolution Prediction","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17981","citing_title":"Efficiently emulating distribution functions in gigaparsec volumes for varying cosmological parameters","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20555","citing_title":"Improved Chase-Pyndiah Decoding for Product Codes with Scaled Messages","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02723","citing_title":"Euclid preparation. CosmoPostProcess: A simulation calibrated framework for weak lensing selection bias in richness-selected galaxy clusters","ref_index":231,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7","json":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7.json","graph_json":"https://pith.science/api/pith-number/VDONACX5R7QJSACSSQGQX222E7/graph.json","events_json":"https://pith.science/api/pith-number/VDONACX5R7QJSACSSQGQX222E7/events.json","paper":"https://pith.science/paper/VDONACX5"},"agent_actions":{"view_html":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7","download_json":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7.json","view_paper":"https://pith.science/paper/VDONACX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10902&json=true","fetch_graph":"https://pith.science/api/pith-number/VDONACX5R7QJSACSSQGQX222E7/graph.json","fetch_events":"https://pith.science/api/pith-number/VDONACX5R7QJSACSSQGQX222E7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7/action/storage_attestation","attest_author":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7/action/author_attestation","sign_citation":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7/action/citation_signature","submit_replication":"https://pith.science/pith/VDONACX5R7QJSACSSQGQX222E7/action/replication_record"}},"created_at":"2026-05-17T23:39:34.106511+00:00","updated_at":"2026-05-17T23:39:34.106511+00:00"}