{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:674MYG5NQ527YTLL44JSUZWFBI","short_pith_number":"pith:674MYG5N","schema_version":"1.0","canonical_sha256":"f7f8cc1bad8775fc4d6be7132a66c50a1d5a4fb8b47aa9e0cd7bb40d676823db","source":{"kind":"arxiv","id":"1908.06527","version":2},"attestation_state":"computed","paper":{"title":"The Runtime of the Compact Genetic Algorithm on Jump Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr","submitted_at":"2019-08-18T22:45:18Z","abstract_excerpt":"In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA) on a multimodal problem, Hasen\\\"ohrl and Sutton (GECCO 2018) showed for any $k = o(n)$ that the compact genetic algorithm (cGA) with any hypothetical population size $\\mu = \\Omega(ne^{4k} + n^{3.5+\\varepsilon})$ with high probability finds the optimum of the $n$-dimensional jump function with jump size $k$ in time $O(\\mu n^{1.5} \\log n)$.\n  We significantly improve this result for small jump sizes $k \\le \\frac 1 {20} \\ln n -1$. In this case, already for $\\mu = \\Omega(\\sqrt n \\log n) \\cap"},"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":"1908.06527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-18T22:45:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f0417c44a56af6dac2f963e57804f298fcca607bd60ee8c233b8f8c536bcedd9","abstract_canon_sha256":"34ff3e23131a76a796908c74f70d6efbcf3f8e831163484e7a730bee3c256dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:04.337927Z","signature_b64":"lWxYppwhgyYBcAdsmmhvSHoMsR+aGk5Hx1BDoN/63jD0fHAxFiDqnsJqekgvpeNxMBTWyyNv3HZBaslGfb8ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f8cc1bad8775fc4d6be7132a66c50a1d5a4fb8b47aa9e0cd7bb40d676823db","last_reissued_at":"2026-07-05T03:21:04.337491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:04.337491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Runtime of the Compact Genetic Algorithm on Jump Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Benjamin Doerr","submitted_at":"2019-08-18T22:45:18Z","abstract_excerpt":"In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA) on a multimodal problem, Hasen\\\"ohrl and Sutton (GECCO 2018) showed for any $k = o(n)$ that the compact genetic algorithm (cGA) with any hypothetical population size $\\mu = \\Omega(ne^{4k} + n^{3.5+\\varepsilon})$ with high probability finds the optimum of the $n$-dimensional jump function with jump size $k$ in time $O(\\mu n^{1.5} \\log n)$.\n  We significantly improve this result for small jump sizes $k \\le \\frac 1 {20} \\ln n -1$. In this case, already for $\\mu = \\Omega(\\sqrt n \\log n) \\cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06527","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06527/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06527","created_at":"2026-07-05T03:21:04.337552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06527v2","created_at":"2026-07-05T03:21:04.337552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06527","created_at":"2026-07-05T03:21:04.337552+00:00"},{"alias_kind":"pith_short_12","alias_value":"674MYG5NQ527","created_at":"2026-07-05T03:21:04.337552+00:00"},{"alias_kind":"pith_short_16","alias_value":"674MYG5NQ527YTLL","created_at":"2026-07-05T03:21:04.337552+00:00"},{"alias_kind":"pith_short_8","alias_value":"674MYG5N","created_at":"2026-07-05T03:21:04.337552+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/674MYG5NQ527YTLL44JSUZWFBI","json":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI.json","graph_json":"https://pith.science/api/pith-number/674MYG5NQ527YTLL44JSUZWFBI/graph.json","events_json":"https://pith.science/api/pith-number/674MYG5NQ527YTLL44JSUZWFBI/events.json","paper":"https://pith.science/paper/674MYG5N"},"agent_actions":{"view_html":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI","download_json":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI.json","view_paper":"https://pith.science/paper/674MYG5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06527&json=true","fetch_graph":"https://pith.science/api/pith-number/674MYG5NQ527YTLL44JSUZWFBI/graph.json","fetch_events":"https://pith.science/api/pith-number/674MYG5NQ527YTLL44JSUZWFBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI/action/storage_attestation","attest_author":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI/action/author_attestation","sign_citation":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI/action/citation_signature","submit_replication":"https://pith.science/pith/674MYG5NQ527YTLL44JSUZWFBI/action/replication_record"}},"created_at":"2026-07-05T03:21:04.337552+00:00","updated_at":"2026-07-05T03:21:04.337552+00:00"}