{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G6L2S7QEPYMSHHKKTGBMYNTV5S","short_pith_number":"pith:G6L2S7QE","canonical_record":{"source":{"id":"1508.05342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-10T15:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"38f7662117041e34c52f878bb63d643164ab3992c2df322b0d132ff53755b46b","abstract_canon_sha256":"c54d61fa88cd4ab2b368e40d4bab6af193dd3c13537b74302651ac0c5a1cf6db"},"schema_version":"1.0"},"canonical_sha256":"3797a97e047e19239d4a9982cc3675ecb630592e0dc4f48d50f6862abc23ec84","source":{"kind":"arxiv","id":"1508.05342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05342","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05342v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05342","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"G6L2S7QEPYMS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G6L2S7QEPYMSHHKK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G6L2S7QE","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G6L2S7QEPYMSHHKKTGBMYNTV5S","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-10T15:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"38f7662117041e34c52f878bb63d643164ab3992c2df322b0d132ff53755b46b","abstract_canon_sha256":"c54d61fa88cd4ab2b368e40d4bab6af193dd3c13537b74302651ac0c5a1cf6db"},"schema_version":"1.0"},"canonical_sha256":"3797a97e047e19239d4a9982cc3675ecb630592e0dc4f48d50f6862abc23ec84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:56.090739Z","signature_b64":"llYf7tLJZrq5ga4+r0CQw+h8Aw00703nzYUNkBpuyNyo0rcaMF1yfaGkOLpdKpBLNupTHgLBLLoWURvco8YGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3797a97e047e19239d4a9982cc3675ecb630592e0dc4f48d50f6862abc23ec84","last_reissued_at":"2026-05-18T01:34:56.090189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:56.090189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05342","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-18T01:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJFL1EmQi/5ElfFolGyquCbOmaOKaJoLDnBv183OutG/GVlxjUAFTommULLurwqO/twnR4h03f66GNSSgceECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:18:44.239708Z"},"content_sha256":"d332d9f73f809544f951b70933b796a0edc6df3c88ba1f9e4076422d2ef705c1","schema_version":"1.0","event_id":"sha256:d332d9f73f809544f951b70933b796a0edc6df3c88ba1f9e4076422d2ef705c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G6L2S7QEPYMSHHKKTGBMYNTV5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Genetic Algorithms for multimodal optimization: a review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Noe Casas","submitted_at":"2015-06-10T15:29:25Z","abstract_excerpt":"In this article we provide a comprehensive review of the different evolutionary algorithm techniques used to address multimodal optimization problems, classifying them according to the nature of their approach. On the one hand there are algorithms that address the issue of the early convergence to a local optimum by differentiating the individuals of the population into groups and limiting their interaction, hence having each group evolve with a high degree of independence. On the other hand other approaches are based on directly addressing the lack of genetic diversity of the population by in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05342","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-18T01:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phrmEyNxNbCk+J53W/Mg3RF/GJzQK4q0uZecdzAefVOheWbS5I2V3TSbPqtMYP0J0IxIwA6VAZBpEzAjrsmbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:18:44.240356Z"},"content_sha256":"a0dfd8961da9641ffc4eb066142bd1ad3c95cd25475fd2a5649aeff127613dcd","schema_version":"1.0","event_id":"sha256:a0dfd8961da9641ffc4eb066142bd1ad3c95cd25475fd2a5649aeff127613dcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/bundle.json","state_url":"https://pith.science/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/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-07T09:18:44Z","links":{"resolver":"https://pith.science/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S","bundle":"https://pith.science/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/bundle.json","state":"https://pith.science/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6L2S7QEPYMSHHKKTGBMYNTV5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G6L2S7QEPYMSHHKKTGBMYNTV5S","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":"c54d61fa88cd4ab2b368e40d4bab6af193dd3c13537b74302651ac0c5a1cf6db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-10T15:29:25Z","title_canon_sha256":"38f7662117041e34c52f878bb63d643164ab3992c2df322b0d132ff53755b46b"},"schema_version":"1.0","source":{"id":"1508.05342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05342","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05342v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05342","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"G6L2S7QEPYMS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G6L2S7QEPYMSHHKK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G6L2S7QE","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:a0dfd8961da9641ffc4eb066142bd1ad3c95cd25475fd2a5649aeff127613dcd","target":"graph","created_at":"2026-05-18T01:34:56Z","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":"In this article we provide a comprehensive review of the different evolutionary algorithm techniques used to address multimodal optimization problems, classifying them according to the nature of their approach. On the one hand there are algorithms that address the issue of the early convergence to a local optimum by differentiating the individuals of the population into groups and limiting their interaction, hence having each group evolve with a high degree of independence. On the other hand other approaches are based on directly addressing the lack of genetic diversity of the population by in","authors_text":"Noe Casas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-10T15:29:25Z","title":"Genetic Algorithms for multimodal optimization: a review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05342","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:d332d9f73f809544f951b70933b796a0edc6df3c88ba1f9e4076422d2ef705c1","target":"record","created_at":"2026-05-18T01:34:56Z","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":"c54d61fa88cd4ab2b368e40d4bab6af193dd3c13537b74302651ac0c5a1cf6db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-10T15:29:25Z","title_canon_sha256":"38f7662117041e34c52f878bb63d643164ab3992c2df322b0d132ff53755b46b"},"schema_version":"1.0","source":{"id":"1508.05342","kind":"arxiv","version":1}},"canonical_sha256":"3797a97e047e19239d4a9982cc3675ecb630592e0dc4f48d50f6862abc23ec84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3797a97e047e19239d4a9982cc3675ecb630592e0dc4f48d50f6862abc23ec84","first_computed_at":"2026-05-18T01:34:56.090189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:56.090189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"llYf7tLJZrq5ga4+r0CQw+h8Aw00703nzYUNkBpuyNyo0rcaMF1yfaGkOLpdKpBLNupTHgLBLLoWURvco8YGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:56.090739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d332d9f73f809544f951b70933b796a0edc6df3c88ba1f9e4076422d2ef705c1","sha256:a0dfd8961da9641ffc4eb066142bd1ad3c95cd25475fd2a5649aeff127613dcd"],"state_sha256":"8ba84d2efe96cb11e5a317816bd9387ac21932719640bc0a2bdff619b5af5098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVn0AJflJUevoiO5hwoCK2gJ1t8jfn3WJ8T2mrMPJS2CK8GKKdFRy6eiL8Dxuk4e6Ug8yUo2C7h1laq7SMNQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:18:44.243467Z","bundle_sha256":"846b86b72c0564ed9fa4a6c518524a19312e8f691e4a0a7aaf41292f3816bf10"}}