{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A4WFUTPG72BBKOTR55N3AOFU74","short_pith_number":"pith:A4WFUTPG","canonical_record":{"source":{"id":"1407.7663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"1b1ea9aab739bb35ab3b120b8f69111cdf088b1c0ab22fd17477fe1b96a0d3dc","abstract_canon_sha256":"fce5eb4365279491ccbc96042c08d92e5469e14bd792ecd17a12e4e6feccc724"},"schema_version":"1.0"},"canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","source":{"kind":"arxiv","id":"1407.7663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7663","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7663v2","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7663","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"A4WFUTPG72BB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4WFUTPG72BBKOTR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4WFUTPG","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A4WFUTPG72BBKOTR55N3AOFU74","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"1b1ea9aab739bb35ab3b120b8f69111cdf088b1c0ab22fd17477fe1b96a0d3dc","abstract_canon_sha256":"fce5eb4365279491ccbc96042c08d92e5469e14bd792ecd17a12e4e6feccc724"},"schema_version":"1.0"},"canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.012332Z","signature_b64":"k1LFM2MjtPCMq4K4Yhju+rKBVHr79xcnXcEVYvE/6kKwrHma3YMwe2ns3r+/aZZ0KlkoG3cWftCh1gEyvw72Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","last_reissued_at":"2026-05-18T01:01:09.011663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.011663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7663","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:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieGokloD6NaKRCdVKuM5x+phDveqLpLSy7QAfmG9kMiGbEhSMdCOEyPHjki3J7e+0tuchhdxFzhzzp742YttCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:55.577031Z"},"content_sha256":"f52dcaa178fe90e675fde7d81a2eeb851c33a2d4dc238952f7c091859b7ceeda","schema_version":"1.0","event_id":"sha256:f52dcaa178fe90e675fde7d81a2eeb851c33a2d4dc238952f7c091859b7ceeda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A4WFUTPG72BBKOTR55N3AOFU74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Level-based Analysis of Genetic Algorithms and other Search Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"cs.NE","authors_text":"Anton V. Eremeev, Dogan Corus, Duc-Cuong Dang, Per Kristian Lehre","submitted_at":"2014-07-29T08:42:04Z","abstract_excerpt":"Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived using a handful of key analytic techniques, including drift analysis. However, since few of these techniques apply effortlessly to population-based EAs, most time-complexity results concern simplified EAs, such as the (1+1) EA.\n  This paper describes the level-based theorem, a new technique tailored to population-based processes. It applies to any non-elitist p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7663","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:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zb7WQc2fnCxWOw7lDXbL9zf/wmfM3VAbfyzpAP7sw0j94J1geSN78Tsv2BwKwiH5yghwL+SAmDcEMf9iaFU0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:55.577393Z"},"content_sha256":"34cad8eb9d5fd735b7b5cd5d8920cbfadf2fd4b2c1e7bc02e7cb0503a0562dee","schema_version":"1.0","event_id":"sha256:34cad8eb9d5fd735b7b5cd5d8920cbfadf2fd4b2c1e7bc02e7cb0503a0562dee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/bundle.json","state_url":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4WFUTPG72BBKOTR55N3AOFU74/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-28T16:49:55Z","links":{"resolver":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74","bundle":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/bundle.json","state":"https://pith.science/pith/A4WFUTPG72BBKOTR55N3AOFU74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4WFUTPG72BBKOTR55N3AOFU74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A4WFUTPG72BBKOTR55N3AOFU74","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":"fce5eb4365279491ccbc96042c08d92e5469e14bd792ecd17a12e4e6feccc724","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","title_canon_sha256":"1b1ea9aab739bb35ab3b120b8f69111cdf088b1c0ab22fd17477fe1b96a0d3dc"},"schema_version":"1.0","source":{"id":"1407.7663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7663","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7663v2","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7663","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"A4WFUTPG72BB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4WFUTPG72BBKOTR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4WFUTPG","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:34cad8eb9d5fd735b7b5cd5d8920cbfadf2fd4b2c1e7bc02e7cb0503a0562dee","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation. Most rigorous results were derived using a handful of key analytic techniques, including drift analysis. However, since few of these techniques apply effortlessly to population-based EAs, most time-complexity results concern simplified EAs, such as the (1+1) EA.\n  This paper describes the level-based theorem, a new technique tailored to population-based processes. It applies to any non-elitist p","authors_text":"Anton V. Eremeev, Dogan Corus, Duc-Cuong Dang, Per Kristian Lehre","cross_cats":["q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","title":"Level-based Analysis of Genetic Algorithms and other Search Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7663","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:f52dcaa178fe90e675fde7d81a2eeb851c33a2d4dc238952f7c091859b7ceeda","target":"record","created_at":"2026-05-18T01:01:09Z","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":"fce5eb4365279491ccbc96042c08d92e5469e14bd792ecd17a12e4e6feccc724","cross_cats_sorted":["q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-07-29T08:42:04Z","title_canon_sha256":"1b1ea9aab739bb35ab3b120b8f69111cdf088b1c0ab22fd17477fe1b96a0d3dc"},"schema_version":"1.0","source":{"id":"1407.7663","kind":"arxiv","version":2}},"canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"072c5a4de6fe82153a71ef5bb038b4ff2a3445bc5e77772c04d88564f2cfa83f","first_computed_at":"2026-05-18T01:01:09.011663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.011663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1LFM2MjtPCMq4K4Yhju+rKBVHr79xcnXcEVYvE/6kKwrHma3YMwe2ns3r+/aZZ0KlkoG3cWftCh1gEyvw72Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.012332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f52dcaa178fe90e675fde7d81a2eeb851c33a2d4dc238952f7c091859b7ceeda","sha256:34cad8eb9d5fd735b7b5cd5d8920cbfadf2fd4b2c1e7bc02e7cb0503a0562dee"],"state_sha256":"e6e383dc41dd66adeac10ef04fcc8cfb024057404869362038981748ab428377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwjEx7JkmxIhFziToGXSX2RTo/Ef29CE4zLvv8ln6P2k49Y0STPkIWM0tyVqclJzTCU0JuKoC0VKiHmitJ7ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:49:55.579259Z","bundle_sha256":"addbc99136f749028ff5ed69cccce74cf5e64d3cc6273b6d67b8b88bbe9f2f01"}}