{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G7X5ZX7YKNZY2YNRFBDUW5JFZS","short_pith_number":"pith:G7X5ZX7Y","schema_version":"1.0","canonical_sha256":"37efdcdff853738d61b128474b7525cc8d5b9257cb5f5849f11e636105dbb756","source":{"kind":"arxiv","id":"1904.08823","version":1},"attestation_state":"computed","paper":{"title":"Uncrowded Hypervolume Improvement: COMO-CMA-ES and the Sofomore framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Anne Auger, Cheikh Tour\\'e, Dimo Brockhoff, Nikolaus Hansen","submitted_at":"2019-04-18T14:57:15Z","abstract_excerpt":"We present a framework to build a multiobjective algorithm from single-objective ones. This framework addresses the $p \\times n$-dimensional problem of finding p solutions in an n-dimensional search space, maximizing an indicator by dynamic subspace optimization. Each single-objective algorithm optimizes the indicator function given $p - 1$ fixed solutions. Crucially, dominated solutions minimize their distance to the empirical Pareto front defined by these $p - 1$ solutions. We instantiate the framework with CMA-ES as single-objective optimizer. The new algorithm, COMO-CMA-ES, is empirically "},"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.08823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-18T14:57:15Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"dcb15bcddaabd95c11f5f5db418096c77d76f8a996957bab1600eb97062eb624","abstract_canon_sha256":"27faf2b1a4287f32ccf060e5f87e243c0eee96ef7803b3e904be7781d5df02a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:12.859687Z","signature_b64":"kFFFQJYtL24nAukOM18C717dmHkNC/3IlHZ30tNxQLA/YIavjvU4ASUVm+2cJLwwIKq3mSjQwDcmLh6j8ZaWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37efdcdff853738d61b128474b7525cc8d5b9257cb5f5849f11e636105dbb756","last_reissued_at":"2026-05-17T23:48:12.858977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:12.858977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncrowded Hypervolume Improvement: COMO-CMA-ES and the Sofomore framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Anne Auger, Cheikh Tour\\'e, Dimo Brockhoff, Nikolaus Hansen","submitted_at":"2019-04-18T14:57:15Z","abstract_excerpt":"We present a framework to build a multiobjective algorithm from single-objective ones. This framework addresses the $p \\times n$-dimensional problem of finding p solutions in an n-dimensional search space, maximizing an indicator by dynamic subspace optimization. Each single-objective algorithm optimizes the indicator function given $p - 1$ fixed solutions. Crucially, dominated solutions minimize their distance to the empirical Pareto front defined by these $p - 1$ solutions. We instantiate the framework with CMA-ES as single-objective optimizer. The new algorithm, COMO-CMA-ES, is empirically "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08823","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.08823","created_at":"2026-05-17T23:48:12.859082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08823v1","created_at":"2026-05-17T23:48:12.859082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08823","created_at":"2026-05-17T23:48:12.859082+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7X5ZX7YKNZY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7X5ZX7YKNZY2YNR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7X5ZX7Y","created_at":"2026-05-18T12:33:18.533446+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/G7X5ZX7YKNZY2YNRFBDUW5JFZS","json":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS.json","graph_json":"https://pith.science/api/pith-number/G7X5ZX7YKNZY2YNRFBDUW5JFZS/graph.json","events_json":"https://pith.science/api/pith-number/G7X5ZX7YKNZY2YNRFBDUW5JFZS/events.json","paper":"https://pith.science/paper/G7X5ZX7Y"},"agent_actions":{"view_html":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS","download_json":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS.json","view_paper":"https://pith.science/paper/G7X5ZX7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08823&json=true","fetch_graph":"https://pith.science/api/pith-number/G7X5ZX7YKNZY2YNRFBDUW5JFZS/graph.json","fetch_events":"https://pith.science/api/pith-number/G7X5ZX7YKNZY2YNRFBDUW5JFZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS/action/storage_attestation","attest_author":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS/action/author_attestation","sign_citation":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS/action/citation_signature","submit_replication":"https://pith.science/pith/G7X5ZX7YKNZY2YNRFBDUW5JFZS/action/replication_record"}},"created_at":"2026-05-17T23:48:12.859082+00:00","updated_at":"2026-05-17T23:48:12.859082+00:00"}