{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B4YDU3TEEXUFBUEFXKARTJANH4","short_pith_number":"pith:B4YDU3TE","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"},"canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","source":{"kind":"arxiv","id":"1510.04409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04409","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04409v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04409","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"B4YDU3TEEXUF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B4YDU3TEEXUFBUEF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B4YDU3TE","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B4YDU3TEEXUFBUEFXKARTJANH4","target":"record","payload":{"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"},"canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","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"},"source_kind":"arxiv","source_id":"1510.04409","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0/MDt+kW4NhZwEZb4uwYxRU5DGlYh3yGrB3kRgGYnlCCLy8ywwy2LfAowodNpWNR0EDXjhiBHvIw6XPejLbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:15:04.181430Z"},"content_sha256":"e54e7d394d44ccacf40d39b24d4c7d503b079c416762fb3fc8cb0645549e594d","schema_version":"1.0","event_id":"sha256:e54e7d394d44ccacf40d39b24d4c7d503b079c416762fb3fc8cb0645549e594d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B4YDU3TEEXUFBUEFXKARTJANH4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liJsdkFKcsz2jhavhzlApN8qnSOdfxPFaPTpbLZlJUYGsyOBW5DjoIO3UOdxJALTVeBAfDy0egZqfOPtF3KGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:15:04.181778Z"},"content_sha256":"da4262c36cba8b7a93c69270806dfb97c20c4c7edba8fe2fe81dd3e79e74b9d9","schema_version":"1.0","event_id":"sha256:da4262c36cba8b7a93c69270806dfb97c20c4c7edba8fe2fe81dd3e79e74b9d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/bundle.json","state_url":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4YDU3TEEXUFBUEFXKARTJANH4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T15:15:04Z","links":{"resolver":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4","bundle":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/bundle.json","state":"https://pith.science/pith/B4YDU3TEEXUFBUEFXKARTJANH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4YDU3TEEXUFBUEFXKARTJANH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B4YDU3TEEXUFBUEFXKARTJANH4","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":"0a4db48b76a932223d4017d8217f3f4942031a3e8be4de243fb0e2095e6eb403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-15T06:06:43Z","title_canon_sha256":"ee9f0a2879ea5ecac6c3e1b1163743365c25042c0e86ac74c5c4467f4cb3af58"},"schema_version":"1.0","source":{"id":"1510.04409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04409","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04409v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04409","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"B4YDU3TEEXUF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B4YDU3TEEXUFBUEF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B4YDU3TE","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:da4262c36cba8b7a93c69270806dfb97c20c4c7edba8fe2fe81dd3e79e74b9d9","target":"graph","created_at":"2026-05-18T01:30:07Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre Chotard (LRI, Anne Auger (LRI, LRI), Nikolaus Hansen (TAO, TAO)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-15T06:06:43Z","title":"Markov Chain Analysis of Cumulative Step-size Adaptation on a Linear Constrained Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04409","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e54e7d394d44ccacf40d39b24d4c7d503b079c416762fb3fc8cb0645549e594d","target":"record","created_at":"2026-05-18T01:30:07Z","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":"0a4db48b76a932223d4017d8217f3f4942031a3e8be4de243fb0e2095e6eb403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-15T06:06:43Z","title_canon_sha256":"ee9f0a2879ea5ecac6c3e1b1163743365c25042c0e86ac74c5c4467f4cb3af58"},"schema_version":"1.0","source":{"id":"1510.04409","kind":"arxiv","version":1}},"canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f303a6e6425e850d085ba8119a40d3f319dce0015b740836f9f83c21499433d","first_computed_at":"2026-05-18T01:30:07.265758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:07.265758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FLxFCVrkyYrWGF/xk7L7f2R7nxUulli68OzgCWcBFlSn19nUvvAG1XEJIpRq4dj9rzBfS+VCx9ioZFF6qVl3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:07.266262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e54e7d394d44ccacf40d39b24d4c7d503b079c416762fb3fc8cb0645549e594d","sha256:da4262c36cba8b7a93c69270806dfb97c20c4c7edba8fe2fe81dd3e79e74b9d9"],"state_sha256":"8339363f68e53bf4a1985dc12c03487f1958a91696e8ef898b448526f0101c5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGmkc6atpgKzILkSkHCkKV9VBT4Z/Z2hSgrg2VYcSyDxL4WKMz6iHwuh0IG8oLh8Jh4RWrDFT8gYKhk5WFh3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:15:04.183818Z","bundle_sha256":"5e26fc9411c879e9f588dee957f51cd2296ea0d466306be5b9e127a9e5876b1e"}}