{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VKQCU7DZR3GEKAJAVYTJ5EMOOA","short_pith_number":"pith:VKQCU7DZ","canonical_record":{"source":{"id":"1606.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5c75c8bd75f45ddbf433d88a434ca552697b57b86caae316c58eb47dc78d2461","abstract_canon_sha256":"f1f0747d2fce0aedb3f1c38bfbf41c8c02666d029606361cd40f591b3f3e8823"},"schema_version":"1.0"},"canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","source":{"kind":"arxiv","id":"1606.03326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03326","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03326v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03326","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"VKQCU7DZR3GE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKQCU7DZR3GEKAJA","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKQCU7DZ","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VKQCU7DZR3GEKAJAVYTJ5EMOOA","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5c75c8bd75f45ddbf433d88a434ca552697b57b86caae316c58eb47dc78d2461","abstract_canon_sha256":"f1f0747d2fce0aedb3f1c38bfbf41c8c02666d029606361cd40f591b3f3e8823"},"schema_version":"1.0"},"canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.129172Z","signature_b64":"x+DpJMrxAKoFQREwKfFSEhhZcWNrFfd3jKVP00qJh/2ZOXXZ4hy2IpQF35XT8exUrt0CAuz3YT8Ze9FrJKnOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","last_reissued_at":"2026-05-18T01:12:37.128803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.128803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03326","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:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3LkFmdtWiryYg10v8I8pv8fIXvs1M8vh+0uE+nOy4/iplk/YcJynyqYcYCBdH5baoU9Gy4Q1fh40tDJhDlfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:12:35.009881Z"},"content_sha256":"d3594eaa724f764dd3f85d4113c89bf15af4230e6cb423c29d614a39919e6670","schema_version":"1.0","event_id":"sha256:d3594eaa724f764dd3f85d4113c89bf15af4230e6cb423c29d614a39919e6670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VKQCU7DZR3GEKAJAVYTJ5EMOOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Chao Qian, Yang Yu, Zhi-Hua Zhou","submitted_at":"2016-06-10T13:59:16Z","abstract_excerpt":"Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, previous theoretical studies often employ EAs with only a parent or offspring population and focus on specific problems. Furthermore, they often only show upper bounds on the running time, while lower bounds are also necessary to get a complete understanding of an algorithm. In this paper, we analyze the running time of the ($\\mu$+$\\lambda$)-EA (a general population-based EA with mutation only) on the class of pseudo-B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03326","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:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiJ7n5gkyg7LeawCT0M5I43WgpybS8eXjfI6c3I75ibAr0FE1GYf4CDTi+FLMiOa42nZ4c6ekJysasSwoVULAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:12:35.010593Z"},"content_sha256":"0cca6a766408e7222b6b2f29edc0785e154c58f64827fefbd5b84e7e56adee0b","schema_version":"1.0","event_id":"sha256:0cca6a766408e7222b6b2f29edc0785e154c58f64827fefbd5b84e7e56adee0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/bundle.json","state_url":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/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-08T20:12:35Z","links":{"resolver":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA","bundle":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/bundle.json","state":"https://pith.science/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKQCU7DZR3GEKAJAVYTJ5EMOOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VKQCU7DZR3GEKAJAVYTJ5EMOOA","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":"f1f0747d2fce0aedb3f1c38bfbf41c8c02666d029606361cd40f591b3f3e8823","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","title_canon_sha256":"5c75c8bd75f45ddbf433d88a434ca552697b57b86caae316c58eb47dc78d2461"},"schema_version":"1.0","source":{"id":"1606.03326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03326","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03326v1","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03326","created_at":"2026-05-18T01:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"VKQCU7DZR3GE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKQCU7DZR3GEKAJA","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKQCU7DZ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0cca6a766408e7222b6b2f29edc0785e154c58f64827fefbd5b84e7e56adee0b","target":"graph","created_at":"2026-05-18T01:12:37Z","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":"Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, previous theoretical studies often employ EAs with only a parent or offspring population and focus on specific problems. Furthermore, they often only show upper bounds on the running time, while lower bounds are also necessary to get a complete understanding of an algorithm. In this paper, we analyze the running time of the ($\\mu$+$\\lambda$)-EA (a general population-based EA with mutation only) on the class of pseudo-B","authors_text":"Chao Qian, Yang Yu, Zhi-Hua Zhou","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","title":"A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03326","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:d3594eaa724f764dd3f85d4113c89bf15af4230e6cb423c29d614a39919e6670","target":"record","created_at":"2026-05-18T01:12:37Z","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":"f1f0747d2fce0aedb3f1c38bfbf41c8c02666d029606361cd40f591b3f3e8823","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T13:59:16Z","title_canon_sha256":"5c75c8bd75f45ddbf433d88a434ca552697b57b86caae316c58eb47dc78d2461"},"schema_version":"1.0","source":{"id":"1606.03326","kind":"arxiv","version":1}},"canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaa02a7c798ecc450120ae269e918e701162ccd60f4e6c70bef55ccf724a1ec3","first_computed_at":"2026-05-18T01:12:37.128803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:37.128803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+DpJMrxAKoFQREwKfFSEhhZcWNrFfd3jKVP00qJh/2ZOXXZ4hy2IpQF35XT8exUrt0CAuz3YT8Ze9FrJKnOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:37.129172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3594eaa724f764dd3f85d4113c89bf15af4230e6cb423c29d614a39919e6670","sha256:0cca6a766408e7222b6b2f29edc0785e154c58f64827fefbd5b84e7e56adee0b"],"state_sha256":"e7aa6311f1c749c6ed1d80e0261289267c178f4dc58022b0656dccd6fbb6566b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aufdfvqRj70PdgBoaQQcoQYBNO7g1d3TJLz5QD1gMque85vEHCuK6NEpvLR/ARxEK/goTmmdMctxT2S+eJfsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:12:35.014702Z","bundle_sha256":"5918a3e44e1d7e0309df559264c29a29f7afe60d73f5fee4fc779f87134675a9"}}