{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZSKRJ4BLGLO7PFJAOIWXVRUTEQ","short_pith_number":"pith:ZSKRJ4BL","schema_version":"1.0","canonical_sha256":"cc9514f02b32ddf79520722d7ac6932428e58b170e8f77e639ee5c29d2f3d820","source":{"kind":"arxiv","id":"1401.3376","version":3},"attestation_state":"computed","paper":{"title":"Across neighbourhood search for numerical optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Guohua Wu","submitted_at":"2014-01-14T22:35:48Z","abstract_excerpt":"Population-based search algorithms (PBSAs), including swarm intelligence algorithms (SIAs) and evolutionary algorithms (EAs), are competitive alternatives for solving complex optimization problems and they have been widely applied to real-world optimization problems in different fields. In this study, a novel population-based across neighbourhood search (ANS) is proposed for numerical optimization. ANS is motivated by two straightforward assumptions and three important issues raised in improving and designing efficient PBSAs. In ANS, a group of individuals collaboratively search the solution s"},"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":"1401.3376","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-14T22:35:48Z","cross_cats_sorted":[],"title_canon_sha256":"57ab77354f99a253eb7e8db97ce2f8b4cefab2d70d3ad40dd7c4bc68eb2532fe","abstract_canon_sha256":"09eb5a21e6bc3085bae94fac28cbcafc01ce9d4b78875f48a517732d0ee8cba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:59.633018Z","signature_b64":"eOEBLZA5aA7I65Karg/AkfBZFnUp6Oxtzm/2U7eXccd000FkqVTqrtqWXJVn93pIz68XFZgwGaGs8rQeQxcBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc9514f02b32ddf79520722d7ac6932428e58b170e8f77e639ee5c29d2f3d820","last_reissued_at":"2026-05-18T01:29:59.632467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:59.632467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Across neighbourhood search for numerical optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Guohua Wu","submitted_at":"2014-01-14T22:35:48Z","abstract_excerpt":"Population-based search algorithms (PBSAs), including swarm intelligence algorithms (SIAs) and evolutionary algorithms (EAs), are competitive alternatives for solving complex optimization problems and they have been widely applied to real-world optimization problems in different fields. In this study, a novel population-based across neighbourhood search (ANS) is proposed for numerical optimization. ANS is motivated by two straightforward assumptions and three important issues raised in improving and designing efficient PBSAs. In ANS, a group of individuals collaboratively search the solution s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3376","created_at":"2026-05-18T01:29:59.632562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3376v3","created_at":"2026-05-18T01:29:59.632562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3376","created_at":"2026-05-18T01:29:59.632562+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSKRJ4BLGLO7","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSKRJ4BLGLO7PFJA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSKRJ4BL","created_at":"2026-05-18T12:28:59.999130+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/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ","json":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ.json","graph_json":"https://pith.science/api/pith-number/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/graph.json","events_json":"https://pith.science/api/pith-number/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/events.json","paper":"https://pith.science/paper/ZSKRJ4BL"},"agent_actions":{"view_html":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ","download_json":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ.json","view_paper":"https://pith.science/paper/ZSKRJ4BL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3376&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZSKRJ4BLGLO7PFJAOIWXVRUTEQ/action/replication_record"}},"created_at":"2026-05-18T01:29:59.632562+00:00","updated_at":"2026-05-18T01:29:59.632562+00:00"}