{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4DB4CNBWIUOHN6BPZ2TKKDRZNZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8fd74fa2d437d2abc834913f233d5816d118bba2eba6be08ceb71eb2d826c705","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-04T08:16:12Z","title_canon_sha256":"42e7bb62c1016578583756e6c386b030a1c99428f346813bf9dae2d385dabd61"},"schema_version":"1.0","source":{"id":"1604.00772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00772","created_at":"2026-05-17T23:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00772v2","created_at":"2026-05-17T23:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00772","created_at":"2026-05-17T23:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"4DB4CNBWIUOH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4DB4CNBWIUOHN6BP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4DB4CNBW","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:1147e367a487e552a6b094c409b3f3d86e3f8b1ef766ba35841151418ad60b06","target":"graph","created_at":"2026-05-17T23:38:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The CMA-ES is a stochastic method for real-parameter optimization of non-linear, non-convex functions, motivated and derived from intuitive concepts and requirements of non-linear non-convex search in continuous domain."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reader possesses sufficient background in basic probability, linear algebra, and optimization to follow the intuitive derivation of the covariance adaptation rules."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The CMA-ES is a stochastic optimizer for continuous non-linear non-convex problems that adapts a multivariate normal search distribution using covariance matrix updates derived from intuitive requirements."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space."}],"snapshot_sha256":"10dde5b5d707cc142ac3734513459c8b4cc4d1a8153e4a58cb3ec42fc4cc270f"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"ef629d0c198d8421d6496899e84fc961d8d4d6d9c51f5885483ecce24d3354c4"},"paper":{"abstract_excerpt":"This tutorial introduces the CMA Evolution Strategy (ES), where CMA stands for Covariance Matrix Adaptation. The CMA-ES is a stochastic, or randomized, method for real-parameter (continuous domain) optimization of non-linear, non-convex functions. We try to motivate and derive the algorithm from intuitive concepts and from requirements of non-linear, non-convex search in continuous domain.","authors_text":"Nikolaus Hansen (TAO)","cross_cats":["stat.ML"],"headline":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial"},"references":{"count":37,"internal_anchors":1,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions","work_id":"5504e6eb-107f-4dce-b8d4-d7de66e41a05","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Diagonal acceleration for covariance matrix adaptation evolution strategies","work_id":"01b4c5ef-72d2-43b7-ae97-226946381ae4","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A restart CMA evolution strategy with increasing population size","work_id":"bd06d30d-492a-4b76-acb9-6121cfaffe3c","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Weighted multirecombination evolution strategies","work_id":"d389d83a-1029-45ab-b0d4-7f09748f0ec2","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Performance analysis of evolutionary optimization with cumu- lative step length adaptation","work_id":"812a94cd-a8b9-4f58-a375-34e27afc2874","year":2004}],"snapshot_sha256":"82f86b7d9949e5301b1de07b013555cded0741126b9e97c9cc29b627b031aa01"},"source":{"id":"1604.00772","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T21:06:33.599420Z","id":"e468d608-345b-44aa-98b0-7d7a1d6be5df","model_set":{"reader":"grok-4.3"},"one_line_summary":"The CMA-ES is a stochastic optimizer for continuous non-linear non-convex problems that adapts a multivariate normal search distribution using covariance matrix updates derived from intuitive requirements.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space.","strongest_claim":"The CMA-ES is a stochastic method for real-parameter optimization of non-linear, non-convex functions, motivated and derived from intuitive concepts and requirements of non-linear non-convex search in continuous domain.","weakest_assumption":"The reader possesses sufficient background in basic probability, linear algebra, and optimization to follow the intuitive derivation of the covariance adaptation rules."}},"verdict_id":"e468d608-345b-44aa-98b0-7d7a1d6be5df"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4169afb678f42c3acce596ae5f0667d65ea68a5e6178815239ffa0c824320bb","target":"record","created_at":"2026-05-17T23:38:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8fd74fa2d437d2abc834913f233d5816d118bba2eba6be08ceb71eb2d826c705","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-04T08:16:12Z","title_canon_sha256":"42e7bb62c1016578583756e6c386b030a1c99428f346813bf9dae2d385dabd61"},"schema_version":"1.0","source":{"id":"1604.00772","kind":"arxiv","version":2}},"canonical_sha256":"e0c3c13436451c76f82fcea6a50e396e65a5347a11d9502be333933e9a8919b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0c3c13436451c76f82fcea6a50e396e65a5347a11d9502be333933e9a8919b9","first_computed_at":"2026-05-17T23:38:50.157997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:50.157997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N4bkfa+xpfou1nstFk3FFf2xVjUF9nBwReg34YcCBXhDiDuUgCtETOyOCgsbmq+f09MAU3FAzYZ0ZPwtCnBeDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:50.158563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4169afb678f42c3acce596ae5f0667d65ea68a5e6178815239ffa0c824320bb","sha256:1147e367a487e552a6b094c409b3f3d86e3f8b1ef766ba35841151418ad60b06"],"state_sha256":"d933bdf1587c1bf1a71ee0d0a195ba174503fa8031111d22e318b13ae3943f26"}