{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BCMC44FCBWJEZWRSSVNPPDKNY3","short_pith_number":"pith:BCMC44FC","schema_version":"1.0","canonical_sha256":"08982e70a20d924cda32955af78d4dc6f83045bf165bff29093b3ee8e5b0055a","source":{"kind":"arxiv","id":"1903.10976","version":1},"attestation_state":"computed","paper":{"title":"On the Benefits of Populations on the Exploitation Speed of Standard Steady-State Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dogan Corus, Pietro S. Oliveto","submitted_at":"2019-03-26T16:04:25Z","abstract_excerpt":"It is generally accepted that populations are useful for the global exploration of multi-modal optimisation problems. Indeed, several theoretical results are available showing such advantages over single-trajectory search heuristics. In this paper we provide evidence that evolving populations via crossover and mutation may also benefit the optimisation time for hillclimbing unimodal functions. In particular, we prove bounds on the expected runtime of the standard ($\\mu$+1)~GA for OneMax that are lower than its unary black box complexity and decrease in the leading constant with the population "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.10976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-26T16:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"de0c13cf3e030d2ed9f54f4311d2fa374c02b92199bd831a8a948ad15127b6ff","abstract_canon_sha256":"c5879cf614fdd46fad4f52ea986e8ffe42198ec31df29b4da0828b4cd57c5faf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.056500Z","signature_b64":"88TNSN2D8057LFE0WAbS7KiDh8FMOU5ZOpBPtthG95HdJPcSP0invpmsE0PhQQfD46dLLR7eS58w7lexo3KoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08982e70a20d924cda32955af78d4dc6f83045bf165bff29093b3ee8e5b0055a","last_reissued_at":"2026-05-17T23:50:17.055792Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.055792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Benefits of Populations on the Exploitation Speed of Standard Steady-State Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dogan Corus, Pietro S. Oliveto","submitted_at":"2019-03-26T16:04:25Z","abstract_excerpt":"It is generally accepted that populations are useful for the global exploration of multi-modal optimisation problems. Indeed, several theoretical results are available showing such advantages over single-trajectory search heuristics. In this paper we provide evidence that evolving populations via crossover and mutation may also benefit the optimisation time for hillclimbing unimodal functions. In particular, we prove bounds on the expected runtime of the standard ($\\mu$+1)~GA for OneMax that are lower than its unary black box complexity and decrease in the leading constant with the population "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10976","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.10976","created_at":"2026-05-17T23:50:17.055899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10976v1","created_at":"2026-05-17T23:50:17.055899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10976","created_at":"2026-05-17T23:50:17.055899+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCMC44FCBWJE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCMC44FCBWJEZWRS","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCMC44FC","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3","json":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3.json","graph_json":"https://pith.science/api/pith-number/BCMC44FCBWJEZWRSSVNPPDKNY3/graph.json","events_json":"https://pith.science/api/pith-number/BCMC44FCBWJEZWRSSVNPPDKNY3/events.json","paper":"https://pith.science/paper/BCMC44FC"},"agent_actions":{"view_html":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3","download_json":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3.json","view_paper":"https://pith.science/paper/BCMC44FC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10976&json=true","fetch_graph":"https://pith.science/api/pith-number/BCMC44FCBWJEZWRSSVNPPDKNY3/graph.json","fetch_events":"https://pith.science/api/pith-number/BCMC44FCBWJEZWRSSVNPPDKNY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3/action/storage_attestation","attest_author":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3/action/author_attestation","sign_citation":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3/action/citation_signature","submit_replication":"https://pith.science/pith/BCMC44FCBWJEZWRSSVNPPDKNY3/action/replication_record"}},"created_at":"2026-05-17T23:50:17.055899+00:00","updated_at":"2026-05-17T23:50:17.055899+00:00"}