{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B4YDU3TEEXUFBUEFXKARTJANH4","short_pith_number":"pith:B4YDU3TE","schema_version":"1.0","canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","source":{"kind":"arxiv","id":"1510.04409","version":1},"attestation_state":"computed","paper":{"title":"Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre Chotard (LRI, Anne Auger (LRI, LRI), Nikolaus Hansen (TAO, TAO)","submitted_at":"2015-10-15T06:06:43Z","abstract_excerpt":"This paper analyzes a (1, $\\lambda$)-Evolution Strategy, a randomized comparison-based adaptive search algorithm, optimizing a linear function with a linear constraint. The algorithm uses resampling to handle the constraint. Two cases are investigated: first the case where the step-size is constant, and second the case where the step-size is adapted using cumulative step-size adaptation. We exhibit for each case a Markov chain describing the behaviour of the algorithm. Stability of the chain implies, by applying a law of large numbers, either convergence or divergence of the algorithm. Diverge"},"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":"1510.04409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-15T06:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"ee9f0a2879ea5ecac6c3e1b1163743365c25042c0e86ac74c5c4467f4cb3af58","abstract_canon_sha256":"0a4db48b76a932223d4017d8217f3f4942031a3e8be4de243fb0e2095e6eb403"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.266262Z","signature_b64":"FLxFCVrkyYrWGF/xk7L7f2R7nxUulli68OzgCWcBFlSn19nUvvAG1XEJIpRq4dj9rzBfS+VCx9ioZFF6qVl3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","last_reissued_at":"2026-05-18T01:30:07.265758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.265758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre Chotard (LRI, Anne Auger (LRI, LRI), Nikolaus Hansen (TAO, TAO)","submitted_at":"2015-10-15T06:06:43Z","abstract_excerpt":"This paper analyzes a (1, $\\lambda$)-Evolution Strategy, a randomized comparison-based adaptive search algorithm, optimizing a linear function with a linear constraint. The algorithm uses resampling to handle the constraint. Two cases are investigated: first the case where the step-size is constant, and second the case where the step-size is adapted using cumulative step-size adaptation. We exhibit for each case a Markov chain describing the behaviour of the algorithm. Stability of the chain implies, by applying a law of large numbers, either convergence or divergence of the algorithm. Diverge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04409","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":"1510.04409","created_at":"2026-05-18T01:30:07.265843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04409v1","created_at":"2026-05-18T01:30:07.265843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04409","created_at":"2026-05-18T01:30:07.265843+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4YDU3TEEXUF","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4YDU3TEEXUFBUEF","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4YDU3TE","created_at":"2026-05-18T12:29:14.074870+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/B4YDU3TEEXUFBUEFXKARTJANH4","json":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4.json","graph_json":"https://pith.science/api/pith-number/B4YDU3TEEXUFBUEFXKARTJANH4/graph.json","events_json":"https://pith.science/api/pith-number/B4YDU3TEEXUFBUEFXKARTJANH4/events.json","paper":"https://pith.science/paper/B4YDU3TE"},"agent_actions":{"view_html":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4","download_json":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4.json","view_paper":"https://pith.science/paper/B4YDU3TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04409&json=true","fetch_graph":"https://pith.science/api/pith-number/B4YDU3TEEXUFBUEFXKARTJANH4/graph.json","fetch_events":"https://pith.science/api/pith-number/B4YDU3TEEXUFBUEFXKARTJANH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/action/storage_attestation","attest_author":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/action/author_attestation","sign_citation":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/action/citation_signature","submit_replication":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/action/replication_record"}},"created_at":"2026-05-18T01:30:07.265843+00:00","updated_at":"2026-05-18T01:30:07.265843+00:00"}