{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2WNZH5Q3PUU7VKYRDKBNM5FOKB","short_pith_number":"pith:2WNZH5Q3","schema_version":"1.0","canonical_sha256":"d59b93f61b7d29faab111a82d674ae505b82346fbfe7cc23f195434b3466d4a3","source":{"kind":"arxiv","id":"1908.08686","version":1},"attestation_state":"computed","paper":{"title":"Runtime Analysis of Fitness-Proportionate Selection on Linear Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Anton Eremeev, Duc-Cuong Dang, Per Kristian Lehre","submitted_at":"2019-08-23T06:39:25Z","abstract_excerpt":"This paper extends the runtime analysis of non-elitist evolutionary algorithms (EAs) with fitness-proportionate selection from the simple OneMax function to the linear functions. Not only does our analysis cover a larger class of fitness functions, it also holds for a wider range of mutation rates. We show that with overwhelmingly high probability, no linear function can be optimised in less than exponential time, assuming bitwise mutation rate $\\Theta(1/n)$ and population size $\\lambda=n^k$ for any constant $k>2$. In contrast to this negative result, we also show that for any linear function "},"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.08686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-08-23T06:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"d6b7350141cca6049ce86c22b82aabeb87585631b9c3e6de84c58aedf79c085e","abstract_canon_sha256":"c88aba6875fae30ef63186dad51b0cb6f8229af81e155792b249e838c152bf8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:16.748802Z","signature_b64":"Bs96hCuDH760qVSq+WX35L1wec2NYSxkYm3j0ZPq7Oz/yF/hdB26i/5OAACUlrUkS75UeZIro9FwANOqUslsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59b93f61b7d29faab111a82d674ae505b82346fbfe7cc23f195434b3466d4a3","last_reissued_at":"2026-07-04T23:59:16.748270Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:16.748270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Analysis of Fitness-Proportionate Selection on Linear Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Anton Eremeev, Duc-Cuong Dang, Per Kristian Lehre","submitted_at":"2019-08-23T06:39:25Z","abstract_excerpt":"This paper extends the runtime analysis of non-elitist evolutionary algorithms (EAs) with fitness-proportionate selection from the simple OneMax function to the linear functions. Not only does our analysis cover a larger class of fitness functions, it also holds for a wider range of mutation rates. We show that with overwhelmingly high probability, no linear function can be optimised in less than exponential time, assuming bitwise mutation rate $\\Theta(1/n)$ and population size $\\lambda=n^k$ for any constant $k>2$. In contrast to this negative result, we also show that for any linear function "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08686","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08686/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.08686","created_at":"2026-07-04T23:59:16.748364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08686v1","created_at":"2026-07-04T23:59:16.748364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08686","created_at":"2026-07-04T23:59:16.748364+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WNZH5Q3PUU7","created_at":"2026-07-04T23:59:16.748364+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WNZH5Q3PUU7VKYR","created_at":"2026-07-04T23:59:16.748364+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WNZH5Q3","created_at":"2026-07-04T23:59:16.748364+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/2WNZH5Q3PUU7VKYRDKBNM5FOKB","json":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB.json","graph_json":"https://pith.science/api/pith-number/2WNZH5Q3PUU7VKYRDKBNM5FOKB/graph.json","events_json":"https://pith.science/api/pith-number/2WNZH5Q3PUU7VKYRDKBNM5FOKB/events.json","paper":"https://pith.science/paper/2WNZH5Q3"},"agent_actions":{"view_html":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB","download_json":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB.json","view_paper":"https://pith.science/paper/2WNZH5Q3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08686&json=true","fetch_graph":"https://pith.science/api/pith-number/2WNZH5Q3PUU7VKYRDKBNM5FOKB/graph.json","fetch_events":"https://pith.science/api/pith-number/2WNZH5Q3PUU7VKYRDKBNM5FOKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB/action/storage_attestation","attest_author":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB/action/author_attestation","sign_citation":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB/action/citation_signature","submit_replication":"https://pith.science/pith/2WNZH5Q3PUU7VKYRDKBNM5FOKB/action/replication_record"}},"created_at":"2026-07-04T23:59:16.748364+00:00","updated_at":"2026-07-04T23:59:16.748364+00:00"}