{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WBHDFU22YHMHN6JYOUXF2YELUI","short_pith_number":"pith:WBHDFU22","canonical_record":{"source":{"id":"1606.05784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-18T17:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"319d0fb2fe961f26213f77018d6df4a1046ac271b9c6abdebc072297e6e0a518","abstract_canon_sha256":"d9734a429c62af6144f45bf3bbf1c7a920224fdedcd60315ab8924d2957f4c26"},"schema_version":"1.0"},"canonical_sha256":"b04e32d35ac1d876f938752e5d608ba20ae21402a43fdfabe78f657f039fce41","source":{"kind":"arxiv","id":"1606.05784","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05784","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05784v2","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05784","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"WBHDFU22YHMH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBHDFU22YHMHN6JY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBHDFU22","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WBHDFU22YHMHN6JYOUXF2YELUI","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-18T17:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"319d0fb2fe961f26213f77018d6df4a1046ac271b9c6abdebc072297e6e0a518","abstract_canon_sha256":"d9734a429c62af6144f45bf3bbf1c7a920224fdedcd60315ab8924d2957f4c26"},"schema_version":"1.0"},"canonical_sha256":"b04e32d35ac1d876f938752e5d608ba20ae21402a43fdfabe78f657f039fce41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.843756Z","signature_b64":"y+sYl5bcgXPqc/+1M+p6uwGXJtKlwNPK0C9HlU2ZxdBwKUH65+JAIwYsu5nzuYBrNxQ/XABHff0KYnPnT+GaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04e32d35ac1d876f938752e5d608ba20ae21402a43fdfabe78f657f039fce41","last_reissued_at":"2026-05-18T01:11:40.843305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.843305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05784","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3769ZktlQRJ7OT/QGE50mkPUqf852Jsxq3xLTDj0cNJevG91STHv4UDnoB0tJ8QZqTviKoogvyVwI60VIc14AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:12:36.605026Z"},"content_sha256":"d0d8848719f0232ddda9384807337174da437eea36f8164eb1f97ad6130fee41","schema_version":"1.0","event_id":"sha256:d0d8848719f0232ddda9384807337174da437eea36f8164eb1f97ad6130fee41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WBHDFU22YHMHN6JYOUXF2YELUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting times of local and global optima in genetic algorithms with very high selection pressure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Anton Eremeev","submitted_at":"2016-06-18T17:36:28Z","abstract_excerpt":"The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant less than one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05784","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B10EA0O4Lo8yrVQHpyaaQuNZWkuQK+v9dgjbJCFTyNePsvegJb1Dw0fSxVkxP7XHKYF2u2MRR5YkINBNofq9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:12:36.605704Z"},"content_sha256":"8aa0febc4a88aac94e6307e49748b8da10947c634502b3f99c5a826ef64c2169","schema_version":"1.0","event_id":"sha256:8aa0febc4a88aac94e6307e49748b8da10947c634502b3f99c5a826ef64c2169"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBHDFU22YHMHN6JYOUXF2YELUI/bundle.json","state_url":"https://pith.science/pith/WBHDFU22YHMHN6JYOUXF2YELUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBHDFU22YHMHN6JYOUXF2YELUI/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-05T00:12:36Z","links":{"resolver":"https://pith.science/pith/WBHDFU22YHMHN6JYOUXF2YELUI","bundle":"https://pith.science/pith/WBHDFU22YHMHN6JYOUXF2YELUI/bundle.json","state":"https://pith.science/pith/WBHDFU22YHMHN6JYOUXF2YELUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBHDFU22YHMHN6JYOUXF2YELUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WBHDFU22YHMHN6JYOUXF2YELUI","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":"d9734a429c62af6144f45bf3bbf1c7a920224fdedcd60315ab8924d2957f4c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-18T17:36:28Z","title_canon_sha256":"319d0fb2fe961f26213f77018d6df4a1046ac271b9c6abdebc072297e6e0a518"},"schema_version":"1.0","source":{"id":"1606.05784","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05784","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05784v2","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05784","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"WBHDFU22YHMH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBHDFU22YHMHN6JY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBHDFU22","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:8aa0febc4a88aac94e6307e49748b8da10947c634502b3f99c5a826ef64c2169","target":"graph","created_at":"2026-05-18T01:11:40Z","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 paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant less than one.","authors_text":"Anton Eremeev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-18T17:36:28Z","title":"Hitting times of local and global optima in genetic algorithms with very high selection pressure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05784","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:d0d8848719f0232ddda9384807337174da437eea36f8164eb1f97ad6130fee41","target":"record","created_at":"2026-05-18T01:11:40Z","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":"d9734a429c62af6144f45bf3bbf1c7a920224fdedcd60315ab8924d2957f4c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-18T17:36:28Z","title_canon_sha256":"319d0fb2fe961f26213f77018d6df4a1046ac271b9c6abdebc072297e6e0a518"},"schema_version":"1.0","source":{"id":"1606.05784","kind":"arxiv","version":2}},"canonical_sha256":"b04e32d35ac1d876f938752e5d608ba20ae21402a43fdfabe78f657f039fce41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b04e32d35ac1d876f938752e5d608ba20ae21402a43fdfabe78f657f039fce41","first_computed_at":"2026-05-18T01:11:40.843305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:40.843305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+sYl5bcgXPqc/+1M+p6uwGXJtKlwNPK0C9HlU2ZxdBwKUH65+JAIwYsu5nzuYBrNxQ/XABHff0KYnPnT+GaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:40.843756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05784","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0d8848719f0232ddda9384807337174da437eea36f8164eb1f97ad6130fee41","sha256:8aa0febc4a88aac94e6307e49748b8da10947c634502b3f99c5a826ef64c2169"],"state_sha256":"7d45dceeabc6a15ce3ea992321cdbc0473b0d5fa367c4af9ac19e8b461847cad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9VdneApiuvXjbcPra5P5B729afCpf7JIUX2phvcig7cuVHgBbDKUzaz5JJHNcRXiln7j7UIwYD+9LShYSiLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:12:36.609538Z","bundle_sha256":"50a252ac48f695b2be2705db3d3cb7975524a70d4b14e7bab46dcca7046dfe4f"}}