{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KTBXD2GW77FIFMYM6H4G6LITT4","short_pith_number":"pith:KTBXD2GW","canonical_record":{"source":{"id":"1803.09766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-26T18:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"694d83f69efebd5e64efcc97399680e098b3db074bf04e07e1b6a6076fe5a36b","abstract_canon_sha256":"df9c3440287234bc738eaeeb9d8fb3b268df73875364775aa69313a5d6261db6"},"schema_version":"1.0"},"canonical_sha256":"54c371e8d6ffca82b30cf1f86f2d139f294b668346045921c4159a7b74b2f944","source":{"kind":"arxiv","id":"1803.09766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09766","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09766v1","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09766","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"KTBXD2GW77FI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTBXD2GW77FIFMYM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTBXD2GW","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KTBXD2GW77FIFMYM6H4G6LITT4","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-26T18:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"694d83f69efebd5e64efcc97399680e098b3db074bf04e07e1b6a6076fe5a36b","abstract_canon_sha256":"df9c3440287234bc738eaeeb9d8fb3b268df73875364775aa69313a5d6261db6"},"schema_version":"1.0"},"canonical_sha256":"54c371e8d6ffca82b30cf1f86f2d139f294b668346045921c4159a7b74b2f944","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:55.483291Z","signature_b64":"88x/QDyNq28imNQZFp3BYnB2/2HbadDOJKUVCNXfXSlodg0lxfvhIgTwXfXT9WBjDAvAQcZzTMwUKxrE90LnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c371e8d6ffca82b30cf1f86f2d139f294b668346045921c4159a7b74b2f944","last_reissued_at":"2026-05-18T00:16:55.482729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:55.482729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09766","source_version":1,"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-18T00:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfUp+vN9xVBxI7tRj6LAYpgU/WTqMG6O4ADfxWCgVYvWPr0PJ+4n/NiffHEVirrsgQWpSHccvXtxF6TjEToVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:00.121909Z"},"content_sha256":"cef9adb51693efd864c9b3dad6d73ffc7f8ad7d66bfe42960b598ae045bd38e7","schema_version":"1.0","event_id":"sha256:cef9adb51693efd864c9b3dad6d73ffc7f8ad7d66bfe42960b598ae045bd38e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KTBXD2GW77FIFMYM6H4G6LITT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dirk Sudholt, Edgar Covantes Osuna","submitted_at":"2018-03-26T18:00:29Z","abstract_excerpt":"Many real optimisation problems lead to multimodal domains and so require the identification of multiple optima. Niching methods have been developed to maintain the population diversity, to investigate many peaks in parallel and to reduce the effect of genetic drift. Using rigorous runtime analysis, we analyse for the first time two well known niching methods: probabilistic crowding and restricted tournament selection (RTS). We incorporate both methods into a $(\\mu+1)~EA$ on the bimodal function Twomax where the goal is to find two optima at opposite ends of the search space. In probabilistic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09766","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"},"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-18T00:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZkCEXF5olKG/TIduSZadEgn4JGeiTcTqSt/Fo0OccluVkcmix9jz9evNa8zNj/D2AP4yzhX4zh9J1v2z/u4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:48:00.122280Z"},"content_sha256":"6c8c02c1923b5768d6a52ad75e89b7ac261693098626b8eaaa139be6269053d0","schema_version":"1.0","event_id":"sha256:6c8c02c1923b5768d6a52ad75e89b7ac261693098626b8eaaa139be6269053d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTBXD2GW77FIFMYM6H4G6LITT4/bundle.json","state_url":"https://pith.science/pith/KTBXD2GW77FIFMYM6H4G6LITT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTBXD2GW77FIFMYM6H4G6LITT4/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-05-29T14:48:00Z","links":{"resolver":"https://pith.science/pith/KTBXD2GW77FIFMYM6H4G6LITT4","bundle":"https://pith.science/pith/KTBXD2GW77FIFMYM6H4G6LITT4/bundle.json","state":"https://pith.science/pith/KTBXD2GW77FIFMYM6H4G6LITT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTBXD2GW77FIFMYM6H4G6LITT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KTBXD2GW77FIFMYM6H4G6LITT4","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":"df9c3440287234bc738eaeeb9d8fb3b268df73875364775aa69313a5d6261db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-26T18:00:29Z","title_canon_sha256":"694d83f69efebd5e64efcc97399680e098b3db074bf04e07e1b6a6076fe5a36b"},"schema_version":"1.0","source":{"id":"1803.09766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09766","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09766v1","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09766","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"KTBXD2GW77FI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KTBXD2GW77FIFMYM","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KTBXD2GW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:6c8c02c1923b5768d6a52ad75e89b7ac261693098626b8eaaa139be6269053d0","target":"graph","created_at":"2026-05-18T00:16:55Z","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":"Many real optimisation problems lead to multimodal domains and so require the identification of multiple optima. Niching methods have been developed to maintain the population diversity, to investigate many peaks in parallel and to reduce the effect of genetic drift. Using rigorous runtime analysis, we analyse for the first time two well known niching methods: probabilistic crowding and restricted tournament selection (RTS). We incorporate both methods into a $(\\mu+1)~EA$ on the bimodal function Twomax where the goal is to find two optima at opposite ends of the search space. In probabilistic ","authors_text":"Dirk Sudholt, Edgar Covantes Osuna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-26T18:00:29Z","title":"Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09766","kind":"arxiv","version":1},"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:cef9adb51693efd864c9b3dad6d73ffc7f8ad7d66bfe42960b598ae045bd38e7","target":"record","created_at":"2026-05-18T00:16:55Z","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":"df9c3440287234bc738eaeeb9d8fb3b268df73875364775aa69313a5d6261db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-26T18:00:29Z","title_canon_sha256":"694d83f69efebd5e64efcc97399680e098b3db074bf04e07e1b6a6076fe5a36b"},"schema_version":"1.0","source":{"id":"1803.09766","kind":"arxiv","version":1}},"canonical_sha256":"54c371e8d6ffca82b30cf1f86f2d139f294b668346045921c4159a7b74b2f944","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54c371e8d6ffca82b30cf1f86f2d139f294b668346045921c4159a7b74b2f944","first_computed_at":"2026-05-18T00:16:55.482729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:55.482729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88x/QDyNq28imNQZFp3BYnB2/2HbadDOJKUVCNXfXSlodg0lxfvhIgTwXfXT9WBjDAvAQcZzTMwUKxrE90LnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:55.483291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cef9adb51693efd864c9b3dad6d73ffc7f8ad7d66bfe42960b598ae045bd38e7","sha256:6c8c02c1923b5768d6a52ad75e89b7ac261693098626b8eaaa139be6269053d0"],"state_sha256":"de60e6c0eaae5f08f97dba53c06bfdf04678dca0d32226717f4344058a26612e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvH+EO3nyuX1ToIt8pqszA/dGcvtJDYtgqdiielvoiePa0tL0PCFsapHJw3lBs4ojpwfxwC2YGtBmTn5xT3iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:48:00.126009Z","bundle_sha256":"442b5f9fcc94ea5468f692f2ca820fe1dfd56da62de0e733dc2f82b0b153b16f"}}