{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:H3OI6556QWQ2ISN7TAQK72DEPK","short_pith_number":"pith:H3OI6556","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"},"canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","source":{"kind":"arxiv","id":"1102.0588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0588","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0588v2","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0588","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"H3OI6556QWQ2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3OI6556QWQ2ISN7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3OI6556","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:H3OI6556QWQ2ISN7TAQK72DEPK","target":"record","payload":{"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"},"canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","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"},"source_kind":"arxiv","source_id":"1102.0588","source_version":2,"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-18T04:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4wIUyUrlC8bHLL/dHUKW44KNcSfJ6jI69GCeWj7RpN3HcH1sU6BDjIznatX3soxPeNNzjePADnP5IxXzqs1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:17:42.771000Z"},"content_sha256":"46bbd64220d5134a53cd6926029d3364bcf02f705cf9ef14df595a87bdbefddf","schema_version":"1.0","event_id":"sha256:46bbd64220d5134a53cd6926029d3364bcf02f705cf9ef14df595a87bdbefddf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:H3OI6556QWQ2ISN7TAQK72DEPK","target":"graph","payload":{"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"},"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-18T04:27:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDd8AiTTxcYofqL2aArFYat2StggaGDFr74buVV0T9IhE7MMoY+GGXVmcGgM8evUWGDiKhy5CncipFSdW2YUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:17:42.771574Z"},"content_sha256":"4797e45a128f551c9154f6f382c79cab973d5410c752ce5050a275edb6e756cc","schema_version":"1.0","event_id":"sha256:4797e45a128f551c9154f6f382c79cab973d5410c752ce5050a275edb6e756cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/bundle.json","state_url":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3OI6556QWQ2ISN7TAQK72DEPK/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-07T08:17:42Z","links":{"resolver":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK","bundle":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/bundle.json","state":"https://pith.science/pith/H3OI6556QWQ2ISN7TAQK72DEPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3OI6556QWQ2ISN7TAQK72DEPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H3OI6556QWQ2ISN7TAQK72DEPK","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":"1fc369cdbe4744657a1b7e53c63a3ab38df50fcae0ceeedc60abc236f5658464","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-02T23:39:57Z","title_canon_sha256":"a4947e763f2b5fde5485ee53f88a3c2385a8c7668079918a88bc4e6f31cd6098"},"schema_version":"1.0","source":{"id":"1102.0588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0588","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0588v2","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0588","created_at":"2026-05-18T04:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"H3OI6556QWQ2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3OI6556QWQ2ISN7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3OI6556","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:4797e45a128f551c9154f6f382c79cab973d5410c752ce5050a275edb6e756cc","target":"graph","created_at":"2026-05-18T04:27:35Z","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":"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 ","authors_text":"Dirk Sudholt, J\\\"org L\\\"assig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-02T23:39:57Z","title":"Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0588","kind":"arxiv","version":2},"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:46bbd64220d5134a53cd6926029d3364bcf02f705cf9ef14df595a87bdbefddf","target":"record","created_at":"2026-05-18T04:27:35Z","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":"1fc369cdbe4744657a1b7e53c63a3ab38df50fcae0ceeedc60abc236f5658464","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-02T23:39:57Z","title_canon_sha256":"a4947e763f2b5fde5485ee53f88a3c2385a8c7668079918a88bc4e6f31cd6098"},"schema_version":"1.0","source":{"id":"1102.0588","kind":"arxiv","version":2}},"canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3edc8f77be85a1a449bf9820afe8647abcdec2f164e52f10bbb3f28471b7dc90","first_computed_at":"2026-05-18T04:27:35.507736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:35.507736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ieu9qlkneNY1sxKNVnFPWxVG69uREPavH/QudyjorMZBfS2xTDd77LxaRyfDh2xv0kztjmoHhbEIW9JT5W4jDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:35.508387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46bbd64220d5134a53cd6926029d3364bcf02f705cf9ef14df595a87bdbefddf","sha256:4797e45a128f551c9154f6f382c79cab973d5410c752ce5050a275edb6e756cc"],"state_sha256":"91b4c4a15fa1da871155f88a3721aa1cb2fca604c631efc1f64bc1970f27875a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92Bc2HvuPXG50fEsyeHSfeZftTAoVWOTPgqB7efbMQv1CGPToOS94/Ys0U8kOv3eamxMZTxPw6Ef0wF07TunCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:17:42.774728Z","bundle_sha256":"1283b5e09fa0a3cd09be8a1006061ceedd8fd9a8afcb6580bf47c29315e38bd2"}}