{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ELUVWA3M25BEUTKAUQLDRZBRH4","short_pith_number":"pith:ELUVWA3M","schema_version":"1.0","canonical_sha256":"22e95b036cd7424a4d40a41638e4313f07670fc7e2844c7c21aef2e0251717fd","source":{"kind":"arxiv","id":"1908.04909","version":1},"attestation_state":"computed","paper":{"title":"Constrained Multi-Objective Optimization for Automated Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brett Wujek, Joshua Griffin, Oleg Golovidov, Patrick Koch, Steven Gardner, Wayne Thompson, Yan Xu","submitted_at":"2019-08-14T01:31:45Z","abstract_excerpt":"Automated machine learning has gained a lot of attention recently. Building and selecting the right machine learning models is often a multi-objective optimization problem. General purpose machine learning software that simultaneously supports multiple objectives and constraints is scant, though the potential benefits are great. In this work, we present a framework called Autotune that effectively handles multiple objectives and constraints that arise in machine learning problems. Autotune is built on a suite of derivative-free optimization methods, and utilizes multi-level parallelism in a di"},"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.04909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-14T01:31:45Z","cross_cats_sorted":["cs.DC","cs.NE","stat.ML"],"title_canon_sha256":"8140a44094d7cbb68303428906d736cd7d6303fffe6ff730608aa66ac1c314d6","abstract_canon_sha256":"7bae6f248851d2db53a535056fdd0b1b9ff54b02be60e46885a19ecac852ad00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:57.907260Z","signature_b64":"KLkngvlWCAKxwO+LHfmlIAHrfcfRxT4H0WHQXuosrtQImuepKPK/gAK4phlXx0OMKuAq5VhDbLK0tJThsHQ3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e95b036cd7424a4d40a41638e4313f07670fc7e2844c7c21aef2e0251717fd","last_reissued_at":"2026-07-04T23:55:57.906842Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:57.906842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Multi-Objective Optimization for Automated Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brett Wujek, Joshua Griffin, Oleg Golovidov, Patrick Koch, Steven Gardner, Wayne Thompson, Yan Xu","submitted_at":"2019-08-14T01:31:45Z","abstract_excerpt":"Automated machine learning has gained a lot of attention recently. Building and selecting the right machine learning models is often a multi-objective optimization problem. General purpose machine learning software that simultaneously supports multiple objectives and constraints is scant, though the potential benefits are great. In this work, we present a framework called Autotune that effectively handles multiple objectives and constraints that arise in machine learning problems. Autotune is built on a suite of derivative-free optimization methods, and utilizes multi-level parallelism in a di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04909","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.04909/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.04909","created_at":"2026-07-04T23:55:57.906899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04909v1","created_at":"2026-07-04T23:55:57.906899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04909","created_at":"2026-07-04T23:55:57.906899+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELUVWA3M25BE","created_at":"2026-07-04T23:55:57.906899+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELUVWA3M25BEUTKA","created_at":"2026-07-04T23:55:57.906899+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELUVWA3M","created_at":"2026-07-04T23:55:57.906899+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/ELUVWA3M25BEUTKAUQLDRZBRH4","json":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4.json","graph_json":"https://pith.science/api/pith-number/ELUVWA3M25BEUTKAUQLDRZBRH4/graph.json","events_json":"https://pith.science/api/pith-number/ELUVWA3M25BEUTKAUQLDRZBRH4/events.json","paper":"https://pith.science/paper/ELUVWA3M"},"agent_actions":{"view_html":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4","download_json":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4.json","view_paper":"https://pith.science/paper/ELUVWA3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04909&json=true","fetch_graph":"https://pith.science/api/pith-number/ELUVWA3M25BEUTKAUQLDRZBRH4/graph.json","fetch_events":"https://pith.science/api/pith-number/ELUVWA3M25BEUTKAUQLDRZBRH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4/action/storage_attestation","attest_author":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4/action/author_attestation","sign_citation":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4/action/citation_signature","submit_replication":"https://pith.science/pith/ELUVWA3M25BEUTKAUQLDRZBRH4/action/replication_record"}},"created_at":"2026-07-04T23:55:57.906899+00:00","updated_at":"2026-07-04T23:55:57.906899+00:00"}