{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3IUKGBJN4DKFRG6VJS23JOREJR","short_pith_number":"pith:3IUKGBJN","canonical_record":{"source":{"id":"1312.2368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-09T10:26:25Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"267a2629bef45665986f6b706be55e6126e4e3643b50c3f8a3d04a644565ac6e","abstract_canon_sha256":"c256f106cd6fb99ef3d229e6d0b5023c99ca8ad42ae288ef6df4ccbc1127708b"},"schema_version":"1.0"},"canonical_sha256":"da28a3052de0d4589bd54cb5b4ba244c67be3ab324eeb12b51a65b24088bf530","source":{"kind":"arxiv","id":"1312.2368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2368","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2368v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2368","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"3IUKGBJN4DKF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IUKGBJN4DKFRG6V","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IUKGBJN","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3IUKGBJN4DKFRG6VJS23JOREJR","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-09T10:26:25Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"267a2629bef45665986f6b706be55e6126e4e3643b50c3f8a3d04a644565ac6e","abstract_canon_sha256":"c256f106cd6fb99ef3d229e6d0b5023c99ca8ad42ae288ef6df4ccbc1127708b"},"schema_version":"1.0"},"canonical_sha256":"da28a3052de0d4589bd54cb5b4ba244c67be3ab324eeb12b51a65b24088bf530","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.414438Z","signature_b64":"Q1enqFLcTeZQ8SEVp7/pEbm/Czg10bsXvSbMQGgahDmCU4JTgb4WO5yzw4Xusq3CGxXa7Jyaq+PhFD1pO9z5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da28a3052de0d4589bd54cb5b4ba244c67be3ab324eeb12b51a65b24088bf530","last_reissued_at":"2026-05-18T03:05:10.414002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.414002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2368","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/uCzVo/BL7bVwIb80ZJBSUurgz3IOWEO7LEAU+FwVibaeuSuwpBMDAOOoq2NOLVmYi8+1EdDccQaamNIcU1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:18:39.204776Z"},"content_sha256":"f2c786421b61f686a86b4b7fcbfb51984b2214f0d15e7465a4f9009e5b555d0c","schema_version":"1.0","event_id":"sha256:f2c786421b61f686a86b4b7fcbfb51984b2214f0d15e7465a4f9009e5b555d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3IUKGBJN4DKFRG6VJS23JOREJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Markov Chain Approach to Analysing Randomised Search Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Feidun He, Jun He, Xin Yao","submitted_at":"2013-12-09T10:26:25Z","abstract_excerpt":"The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain approach to studying them. Using the approach, the sufficient and necessary conditions of convergence in distribution are established. Then the average convergence rate is introduced to randomised search heuristics and its lower and upper bounds are derived. Finally, novel average drift analysis and backward drift analysis are proposed for bounding the expected hitting time. A computational study is also conducted to inve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2368","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-18T03:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQQpee+1KZcg97w4Dy4jgXBupIsl+fqBGIoYW1CYt9w0BIzstAF2fOCHjgh9yzn5rbQIKfk65Z7O3RIalpQPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:18:39.205218Z"},"content_sha256":"14f17ed3f032f4d45005d5aa356361c511fea020d1e3d261fbcc7ad8ddaa2a7b","schema_version":"1.0","event_id":"sha256:14f17ed3f032f4d45005d5aa356361c511fea020d1e3d261fbcc7ad8ddaa2a7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IUKGBJN4DKFRG6VJS23JOREJR/bundle.json","state_url":"https://pith.science/pith/3IUKGBJN4DKFRG6VJS23JOREJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IUKGBJN4DKFRG6VJS23JOREJR/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-25T23:18:39Z","links":{"resolver":"https://pith.science/pith/3IUKGBJN4DKFRG6VJS23JOREJR","bundle":"https://pith.science/pith/3IUKGBJN4DKFRG6VJS23JOREJR/bundle.json","state":"https://pith.science/pith/3IUKGBJN4DKFRG6VJS23JOREJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IUKGBJN4DKFRG6VJS23JOREJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3IUKGBJN4DKFRG6VJS23JOREJR","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":"c256f106cd6fb99ef3d229e6d0b5023c99ca8ad42ae288ef6df4ccbc1127708b","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-09T10:26:25Z","title_canon_sha256":"267a2629bef45665986f6b706be55e6126e4e3643b50c3f8a3d04a644565ac6e"},"schema_version":"1.0","source":{"id":"1312.2368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2368","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2368v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2368","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"3IUKGBJN4DKF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IUKGBJN4DKFRG6V","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IUKGBJN","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:14f17ed3f032f4d45005d5aa356361c511fea020d1e3d261fbcc7ad8ddaa2a7b","target":"graph","created_at":"2026-05-18T03:05:10Z","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":"The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain approach to studying them. Using the approach, the sufficient and necessary conditions of convergence in distribution are established. Then the average convergence rate is introduced to randomised search heuristics and its lower and upper bounds are derived. Finally, novel average drift analysis and backward drift analysis are proposed for bounding the expected hitting time. A computational study is also conducted to inve","authors_text":"Feidun He, Jun He, Xin Yao","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-09T10:26:25Z","title":"A Unified Markov Chain Approach to Analysing Randomised Search Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2368","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:f2c786421b61f686a86b4b7fcbfb51984b2214f0d15e7465a4f9009e5b555d0c","target":"record","created_at":"2026-05-18T03:05:10Z","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":"c256f106cd6fb99ef3d229e6d0b5023c99ca8ad42ae288ef6df4ccbc1127708b","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-09T10:26:25Z","title_canon_sha256":"267a2629bef45665986f6b706be55e6126e4e3643b50c3f8a3d04a644565ac6e"},"schema_version":"1.0","source":{"id":"1312.2368","kind":"arxiv","version":1}},"canonical_sha256":"da28a3052de0d4589bd54cb5b4ba244c67be3ab324eeb12b51a65b24088bf530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da28a3052de0d4589bd54cb5b4ba244c67be3ab324eeb12b51a65b24088bf530","first_computed_at":"2026-05-18T03:05:10.414002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:10.414002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q1enqFLcTeZQ8SEVp7/pEbm/Czg10bsXvSbMQGgahDmCU4JTgb4WO5yzw4Xusq3CGxXa7Jyaq+PhFD1pO9z5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:10.414438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2c786421b61f686a86b4b7fcbfb51984b2214f0d15e7465a4f9009e5b555d0c","sha256:14f17ed3f032f4d45005d5aa356361c511fea020d1e3d261fbcc7ad8ddaa2a7b"],"state_sha256":"2a9fe23241e5ac61bd7e6495318bfcea43dd12c8dba0e313bb82251e19013b02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuoLfZPgtS1sScetlyh2h4rPw+ewx8zCsnj+vMQGEUzbrv3lHdjt+UmosjaciQzJMpc1V37SyHHYlMw6VPbaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:18:39.208053Z","bundle_sha256":"6d7ae3e1af8b1adb564ade19f9420365735f12acc793b56086d1b4bf468edc52"}}