{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KB3SKGMUFMSUIM2N27HK7TTFHN","short_pith_number":"pith:KB3SKGMU","canonical_record":{"source":{"id":"1804.02851","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-09T07:29:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9afab98a5f3848c483089456dbc8a5414400b2cd22c601bc27b54fd8f4fa69e4","abstract_canon_sha256":"6e07cb4f17298cf045082f8fda440609c458173933cb70c6e8e103aa9d5af120"},"schema_version":"1.0"},"canonical_sha256":"50772519942b2544334dd7ceafce653b451431e525f32900882c03987bf3dc2d","source":{"kind":"arxiv","id":"1804.02851","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02851","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02851v3","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02851","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"KB3SKGMUFMSU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KB3SKGMUFMSUIM2N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KB3SKGMU","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KB3SKGMUFMSUIM2N27HK7TTFHN","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02851","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-09T07:29:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9afab98a5f3848c483089456dbc8a5414400b2cd22c601bc27b54fd8f4fa69e4","abstract_canon_sha256":"6e07cb4f17298cf045082f8fda440609c458173933cb70c6e8e103aa9d5af120"},"schema_version":"1.0"},"canonical_sha256":"50772519942b2544334dd7ceafce653b451431e525f32900882c03987bf3dc2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:27.736671Z","signature_b64":"i2OkDzUF3XN0/Ec11KEs41QPUdIKjqbmknmkRH1p47jAFMArlfRKTX1KYNbOHNhf003tyXg3GU8ArIC8TxP0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50772519942b2544334dd7ceafce653b451431e525f32900882c03987bf3dc2d","last_reissued_at":"2026-05-17T23:41:27.735945Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:27.735945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02851","source_version":3,"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-17T23:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eipgAhOzaTbcZh26CJ9dehBEgBPYLxddLV8l1+GV/d9b9+wAUbFP0/S+DzZME6jf4QfSHQAxzCRd/wGD6c8lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:03:14.380138Z"},"content_sha256":"5aedab8268c8163e19792e26c74bc33f7141d44a6e69bd9a98e922a780840c65","schema_version":"1.0","event_id":"sha256:5aedab8268c8163e19792e26c74bc33f7141d44a6e69bd9a98e922a780840c65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KB3SKGMUFMSUIM2N27HK7TTFHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Whale swarm algorithm with the mechanism of identifying and escaping from extreme points for multimodal function optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Bing Zeng, Haozhen Dong, Liang Gao, Xinyu Li, Yuyan Zhang","submitted_at":"2018-04-09T07:29:33Z","abstract_excerpt":"Most real-world optimization problems often come with multiple global optima or local optima. Therefore, increasing niching metaheuristic algorithms, which devote to finding multiple optima in a single run, are developed to solve these multimodal optimization problems. However, there are two difficulties urgently to be solved for most existing niching metaheuristic algorithms: how to set the optimal values of niching parameters for different optimization problems, and how to jump out of the local optima efficiently. These two difficulties limited their practicality largely. Based on Whale Swar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02851","kind":"arxiv","version":3},"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-17T23:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pj0WNp4VPVzK2suYyxsHTYGIgkcxY7d8GqF77kC4DOZ4eLx7jzfxu6WbqONz6aNSiYy9gInBgrXkPgrmkx1DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:03:14.380531Z"},"content_sha256":"b21beac595a4184c7ccfd98772e4dca1857bc08fe620a86adaf0ce004318daf7","schema_version":"1.0","event_id":"sha256:b21beac595a4184c7ccfd98772e4dca1857bc08fe620a86adaf0ce004318daf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/bundle.json","state_url":"https://pith.science/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/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-08T20:03:14Z","links":{"resolver":"https://pith.science/pith/KB3SKGMUFMSUIM2N27HK7TTFHN","bundle":"https://pith.science/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/bundle.json","state":"https://pith.science/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KB3SKGMUFMSUIM2N27HK7TTFHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KB3SKGMUFMSUIM2N27HK7TTFHN","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":"6e07cb4f17298cf045082f8fda440609c458173933cb70c6e8e103aa9d5af120","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-09T07:29:33Z","title_canon_sha256":"9afab98a5f3848c483089456dbc8a5414400b2cd22c601bc27b54fd8f4fa69e4"},"schema_version":"1.0","source":{"id":"1804.02851","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02851","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02851v3","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02851","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"KB3SKGMUFMSU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KB3SKGMUFMSUIM2N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KB3SKGMU","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:b21beac595a4184c7ccfd98772e4dca1857bc08fe620a86adaf0ce004318daf7","target":"graph","created_at":"2026-05-17T23:41:27Z","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":"Most real-world optimization problems often come with multiple global optima or local optima. Therefore, increasing niching metaheuristic algorithms, which devote to finding multiple optima in a single run, are developed to solve these multimodal optimization problems. However, there are two difficulties urgently to be solved for most existing niching metaheuristic algorithms: how to set the optimal values of niching parameters for different optimization problems, and how to jump out of the local optima efficiently. These two difficulties limited their practicality largely. Based on Whale Swar","authors_text":"Bing Zeng, Haozhen Dong, Liang Gao, Xinyu Li, Yuyan Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-09T07:29:33Z","title":"Whale swarm algorithm with the mechanism of identifying and escaping from extreme points for multimodal function optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02851","kind":"arxiv","version":3},"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:5aedab8268c8163e19792e26c74bc33f7141d44a6e69bd9a98e922a780840c65","target":"record","created_at":"2026-05-17T23:41:27Z","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":"6e07cb4f17298cf045082f8fda440609c458173933cb70c6e8e103aa9d5af120","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-09T07:29:33Z","title_canon_sha256":"9afab98a5f3848c483089456dbc8a5414400b2cd22c601bc27b54fd8f4fa69e4"},"schema_version":"1.0","source":{"id":"1804.02851","kind":"arxiv","version":3}},"canonical_sha256":"50772519942b2544334dd7ceafce653b451431e525f32900882c03987bf3dc2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50772519942b2544334dd7ceafce653b451431e525f32900882c03987bf3dc2d","first_computed_at":"2026-05-17T23:41:27.735945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:27.735945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i2OkDzUF3XN0/Ec11KEs41QPUdIKjqbmknmkRH1p47jAFMArlfRKTX1KYNbOHNhf003tyXg3GU8ArIC8TxP0Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:27.736671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02851","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aedab8268c8163e19792e26c74bc33f7141d44a6e69bd9a98e922a780840c65","sha256:b21beac595a4184c7ccfd98772e4dca1857bc08fe620a86adaf0ce004318daf7"],"state_sha256":"18f2b5bea24c164dcea1c062dafe9b0fc2b699a3fab128ffd4a996117d058e03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROsqinPw83+pATJOdH8N7oO6VbAs1LpsPrciCeePckB8WIHLPWEuzjeBUp/0jrEwqpIOHbAU8MKETrT/rLqjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:03:14.382857Z","bundle_sha256":"1d53b4824426d0018c633a15e22c0a0e32331352d8a2bda89c318cd769ac5a14"}}