{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MJWBA35DMNVCONGCRMXBH6PBJ5","short_pith_number":"pith:MJWBA35D","schema_version":"1.0","canonical_sha256":"626c106fa3636a2734c28b2e13f9e14f5fe5855222a7f7703d636a7299d9c7e4","source":{"kind":"arxiv","id":"1904.07801","version":1},"attestation_state":"computed","paper":{"title":"Online Selection of CMA-ES Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Diederick Vermetten, Sander van Rijn, Thomas B\\\"ack","submitted_at":"2019-04-16T16:32:44Z","abstract_excerpt":"In the field of evolutionary computation, one of the most challenging topics is algorithm selection. Knowing which heuristics to use for which optimization problem is key to obtaining high-quality solutions. We aim to extend this research topic by taking a first step towards a selection method for adaptive CMA-ES algorithms. We build upon the theoretical work done by van Rijn \\textit{et al.} [PPSN'18], in which the potential of switching between different CMA-ES variants was quantified in the context of a modular CMA-ES framework.\n  We demonstrate in this work that their proposed approach is n"},"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":"1904.07801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-16T16:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"debba7fe3d2343363ef8988a38ee120ddbf11ab3497cc29355beac6263eb4aa3","abstract_canon_sha256":"f8d00b7ef7e1cb3abaa460d46d7eadcef950fbb6cfc631008d373c1f1c9db0d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:24.190826Z","signature_b64":"Opxqco1scGhbKzr9z5QAnj8n4m/QuTKe8cnALtl4uhYv3BSLN0EGLIiGh4XExxokljvookK+AU5/sNKHQkNzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"626c106fa3636a2734c28b2e13f9e14f5fe5855222a7f7703d636a7299d9c7e4","last_reissued_at":"2026-05-17T23:48:24.190256Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:24.190256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Selection of CMA-ES Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Diederick Vermetten, Sander van Rijn, Thomas B\\\"ack","submitted_at":"2019-04-16T16:32:44Z","abstract_excerpt":"In the field of evolutionary computation, one of the most challenging topics is algorithm selection. Knowing which heuristics to use for which optimization problem is key to obtaining high-quality solutions. We aim to extend this research topic by taking a first step towards a selection method for adaptive CMA-ES algorithms. We build upon the theoretical work done by van Rijn \\textit{et al.} [PPSN'18], in which the potential of switching between different CMA-ES variants was quantified in the context of a modular CMA-ES framework.\n  We demonstrate in this work that their proposed approach is n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07801","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":"1904.07801","created_at":"2026-05-17T23:48:24.190369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07801v1","created_at":"2026-05-17T23:48:24.190369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07801","created_at":"2026-05-17T23:48:24.190369+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJWBA35DMNVC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJWBA35DMNVCONGC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJWBA35D","created_at":"2026-05-18T12:33:21.387695+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/MJWBA35DMNVCONGCRMXBH6PBJ5","json":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5.json","graph_json":"https://pith.science/api/pith-number/MJWBA35DMNVCONGCRMXBH6PBJ5/graph.json","events_json":"https://pith.science/api/pith-number/MJWBA35DMNVCONGCRMXBH6PBJ5/events.json","paper":"https://pith.science/paper/MJWBA35D"},"agent_actions":{"view_html":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5","download_json":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5.json","view_paper":"https://pith.science/paper/MJWBA35D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07801&json=true","fetch_graph":"https://pith.science/api/pith-number/MJWBA35DMNVCONGCRMXBH6PBJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/MJWBA35DMNVCONGCRMXBH6PBJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5/action/storage_attestation","attest_author":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5/action/author_attestation","sign_citation":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5/action/citation_signature","submit_replication":"https://pith.science/pith/MJWBA35DMNVCONGCRMXBH6PBJ5/action/replication_record"}},"created_at":"2026-05-17T23:48:24.190369+00:00","updated_at":"2026-05-17T23:48:24.190369+00:00"}