{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HGPHEFZ4JT5IMSPJGYHPNSJVZU","short_pith_number":"pith:HGPHEFZ4","canonical_record":{"source":{"id":"1404.3023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-11T07:38:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"629eecf58027ae286f9dc42096277c68c641c9260aa878835f48684001a8aa17","abstract_canon_sha256":"3d044f618a807df34b00dec7e322700ad3d88b0f14651e69190ae9df8f8ead5f"},"schema_version":"1.0"},"canonical_sha256":"399e72173c4cfa8649e9360ef6c935cd113a4e87d650064918247aef6c64b0df","source":{"kind":"arxiv","id":"1404.3023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3023","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3023v2","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3023","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"HGPHEFZ4JT5I","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HGPHEFZ4JT5IMSPJ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HGPHEFZ4","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HGPHEFZ4JT5IMSPJGYHPNSJVZU","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-11T07:38:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"629eecf58027ae286f9dc42096277c68c641c9260aa878835f48684001a8aa17","abstract_canon_sha256":"3d044f618a807df34b00dec7e322700ad3d88b0f14651e69190ae9df8f8ead5f"},"schema_version":"1.0"},"canonical_sha256":"399e72173c4cfa8649e9360ef6c935cd113a4e87d650064918247aef6c64b0df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:00.059848Z","signature_b64":"j3GQ7AggnRBkzs/GGlDIMHmbv/wnZrP6S29T/7bR0mwpdfWTJTut5LF3iFinjWZvdKIzIWX1HHtpcIoUUzfaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399e72173c4cfa8649e9360ef6c935cd113a4e87d650064918247aef6c64b0df","last_reissued_at":"2026-05-18T02:32:00.059434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:00.059434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3023","source_version":2,"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-18T02:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaQORQE4Fw2lsIlLTXzEZAISqxy54XqzSjWfRxp3kLWrRPdxb8/9UTpvx6Stmhtdp2cgPByLeZ73btlV1+/4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:00:03.553629Z"},"content_sha256":"3efe9a17542c93f0551b1e4382ef01424afd9c7e6c3e29cbcca8035e33e490f6","schema_version":"1.0","event_id":"sha256:3efe9a17542c93f0551b1e4382ef01424afd9c7e6c3e29cbcca8035e33e490f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HGPHEFZ4JT5IMSPJGYHPNSJVZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chain Analysis of Evolution Strategies on a Linear Constraint Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Alexandre Chotard (INRIA Saclay - Ile de France, Anne Auger (INRIA Saclay - Ile de France), LRI), Nikolaus Hansen (INRIA Saclay - Ile de France)","submitted_at":"2014-04-11T07:38:37Z","abstract_excerpt":"This paper analyses a $(1,\\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem. The algorithm uses resampling to handle the constraint and optimizes a linear function with a linear 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 path length control. We exhibit for each case a Markov chain whose stability analysis would allow us to deduce the divergence of the algorithm depending on its internal parameters. We show diverge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3023","kind":"arxiv","version":2},"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-18T02:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojo1kD8031Z1DNfFRBgHqqlB9r2kw4nyXhWGEpllUMmHvlwgybGQ3X51ZSVFynY6MG/AGlph/iq6/oqEPNQtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:00:03.554023Z"},"content_sha256":"78d2a6292f6e2d70db4755b717e59cfe9697b453f0c6b44c2fc72200ddfb021c","schema_version":"1.0","event_id":"sha256:78d2a6292f6e2d70db4755b717e59cfe9697b453f0c6b44c2fc72200ddfb021c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/bundle.json","state_url":"https://pith.science/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/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-05-27T14:00:03Z","links":{"resolver":"https://pith.science/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU","bundle":"https://pith.science/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/bundle.json","state":"https://pith.science/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGPHEFZ4JT5IMSPJGYHPNSJVZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HGPHEFZ4JT5IMSPJGYHPNSJVZU","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":"3d044f618a807df34b00dec7e322700ad3d88b0f14651e69190ae9df8f8ead5f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-11T07:38:37Z","title_canon_sha256":"629eecf58027ae286f9dc42096277c68c641c9260aa878835f48684001a8aa17"},"schema_version":"1.0","source":{"id":"1404.3023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3023","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3023v2","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3023","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"HGPHEFZ4JT5I","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HGPHEFZ4JT5IMSPJ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HGPHEFZ4","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:78d2a6292f6e2d70db4755b717e59cfe9697b453f0c6b44c2fc72200ddfb021c","target":"graph","created_at":"2026-05-18T02:32:00Z","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 analyses a $(1,\\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem. The algorithm uses resampling to handle the constraint and optimizes a linear function with a linear 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 path length control. We exhibit for each case a Markov chain whose stability analysis would allow us to deduce the divergence of the algorithm depending on its internal parameters. We show diverge","authors_text":"Alexandre Chotard (INRIA Saclay - Ile de France, Anne Auger (INRIA Saclay - Ile de France), LRI), Nikolaus Hansen (INRIA Saclay - Ile de France)","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-11T07:38:37Z","title":"Markov Chain Analysis of Evolution Strategies on a Linear Constraint Optimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3023","kind":"arxiv","version":2},"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:3efe9a17542c93f0551b1e4382ef01424afd9c7e6c3e29cbcca8035e33e490f6","target":"record","created_at":"2026-05-18T02:32:00Z","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":"3d044f618a807df34b00dec7e322700ad3d88b0f14651e69190ae9df8f8ead5f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-11T07:38:37Z","title_canon_sha256":"629eecf58027ae286f9dc42096277c68c641c9260aa878835f48684001a8aa17"},"schema_version":"1.0","source":{"id":"1404.3023","kind":"arxiv","version":2}},"canonical_sha256":"399e72173c4cfa8649e9360ef6c935cd113a4e87d650064918247aef6c64b0df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399e72173c4cfa8649e9360ef6c935cd113a4e87d650064918247aef6c64b0df","first_computed_at":"2026-05-18T02:32:00.059434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:00.059434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3GQ7AggnRBkzs/GGlDIMHmbv/wnZrP6S29T/7bR0mwpdfWTJTut5LF3iFinjWZvdKIzIWX1HHtpcIoUUzfaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:00.059848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3efe9a17542c93f0551b1e4382ef01424afd9c7e6c3e29cbcca8035e33e490f6","sha256:78d2a6292f6e2d70db4755b717e59cfe9697b453f0c6b44c2fc72200ddfb021c"],"state_sha256":"00b33af1ca240dc2eb5aa374917fcc62f43feaa9c32e25720a5d449132a1abb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0bhTW375ddMcXcxiyXmdV1M9CBw2uWdN3Hylaiz281WMptfpX7UBrsb/bhO65DFMyBA3aMDKUfVK3K8uPhkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:00:03.556693Z","bundle_sha256":"a9b30a13208fa1922fb57343d74f94067108f4013be896e4692bd37f3b005119"}}