{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H3OI6556QWQ2ISN7TAQK72DEPK","short_pith_number":"pith:H3OI6556","schema_version":"1.0","canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","source":{"kind":"arxiv","id":"1102.0588","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dirk Sudholt, J\\\"org L\\\"assig","submitted_at":"2011-02-02T23:39:57Z","abstract_excerpt":"We present two adaptive schemes for dynamically choosing the number of parallel instances in parallel evolutionary algorithms. This includes the choice of the offspring population size in a (1+$\\lambda$) EA as a special case. Our schemes are parameterless and they work in a black-box setting where no knowledge on the problem is available. Both schemes double the number of instances in case a generation ends without finding an improvement. In a successful generation, the first scheme resets the system to one instance, while the second scheme halves the number of instances. Both schemes provide "},"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":"1102.0588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-02T23:39:57Z","cross_cats_sorted":[],"title_canon_sha256":"a4947e763f2b5fde5485ee53f88a3c2385a8c7668079918a88bc4e6f31cd6098","abstract_canon_sha256":"1fc369cdbe4744657a1b7e53c63a3ab38df50fcae0ceeedc60abc236f5658464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:35.508387Z","signature_b64":"ieu9qlkneNY1sxKNVnFPWxVG69uREPavH/QudyjorMZBfS2xTDd77LxaRyfDh2xv0kztjmoHhbEIW9JT5W4jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","last_reissued_at":"2026-05-18T04:27:35.507736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:35.507736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dirk Sudholt, J\\\"org L\\\"assig","submitted_at":"2011-02-02T23:39:57Z","abstract_excerpt":"We present two adaptive schemes for dynamically choosing the number of parallel instances in parallel evolutionary algorithms. This includes the choice of the offspring population size in a (1+$\\lambda$) EA as a special case. Our schemes are parameterless and they work in a black-box setting where no knowledge on the problem is available. Both schemes double the number of instances in case a generation ends without finding an improvement. In a successful generation, the first scheme resets the system to one instance, while the second scheme halves the number of instances. Both schemes provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0588","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.0588","created_at":"2026-05-18T04:27:35.507828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0588v2","created_at":"2026-05-18T04:27:35.507828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0588","created_at":"2026-05-18T04:27:35.507828+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3OI6556QWQ2","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3OI6556QWQ2ISN7","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3OI6556","created_at":"2026-05-18T12:26:30.835961+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/H3OI6556QWQ2ISN7TAQK72DEPK","json":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK.json","graph_json":"https://pith.science/api/pith-number/H3OI6556QWQ2ISN7TAQK72DEPK/graph.json","events_json":"https://pith.science/api/pith-number/H3OI6556QWQ2ISN7TAQK72DEPK/events.json","paper":"https://pith.science/paper/H3OI6556"},"agent_actions":{"view_html":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK","download_json":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK.json","view_paper":"https://pith.science/paper/H3OI6556","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0588&json=true","fetch_graph":"https://pith.science/api/pith-number/H3OI6556QWQ2ISN7TAQK72DEPK/graph.json","fetch_events":"https://pith.science/api/pith-number/H3OI6556QWQ2ISN7TAQK72DEPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/action/storage_attestation","attest_author":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/action/author_attestation","sign_citation":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/action/citation_signature","submit_replication":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/action/replication_record"}},"created_at":"2026-05-18T04:27:35.507828+00:00","updated_at":"2026-05-18T04:27:35.507828+00:00"}