{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GH77KB74OE4OVD37NBBEE3F4NT","short_pith_number":"pith:GH77KB74","schema_version":"1.0","canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","source":{"kind":"arxiv","id":"1812.02500","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Peng Yang, Xin Yao","submitted_at":"2018-12-06T12:45:48Z","abstract_excerpt":"Large-scale optimization problems that involve thousands of decision variables have extensively arisen from various industrial areas. As a powerful optimization tool for many real-world applications, evolutionary algorithms (EAs) fail to solve the emerging large-scale problems both effectively and efficiently. In this paper, we propose a novel Divide-and-Conquer (DC) based EA that can not only produce high-quality solution by solving sub-problems separately, but also highly utilizes the power of parallel computing by solving the sub-problems simultaneously. Existing DC-based EAs that were deem"},"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":"1812.02500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-06T12:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"b02323fe688c0ee9cf03be538f4b91772ce107492479cc192e64610d3af01ff2","abstract_canon_sha256":"c0549642a8001bd0f7c81ef96d6bbaaa53ac3a2d960907dd8878eab1e163fd0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:26.990247Z","signature_b64":"XF7XcTaqA7/ppZaw1WH4XvRW/KFkQ+c1FlQ7UWu3tGHIXeAET4EIIGUgTTh0bQSWsApArtjKvQZl0s96PKe/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","last_reissued_at":"2026-07-05T06:53:26.989789Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:26.989789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ke Tang, Peng Yang, Xin Yao","submitted_at":"2018-12-06T12:45:48Z","abstract_excerpt":"Large-scale optimization problems that involve thousands of decision variables have extensively arisen from various industrial areas. As a powerful optimization tool for many real-world applications, evolutionary algorithms (EAs) fail to solve the emerging large-scale problems both effectively and efficiently. In this paper, we propose a novel Divide-and-Conquer (DC) based EA that can not only produce high-quality solution by solving sub-problems separately, but also highly utilizes the power of parallel computing by solving the sub-problems simultaneously. Existing DC-based EAs that were deem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02500","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.02500/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1812.02500","created_at":"2026-07-05T06:53:26.989846+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02500v1","created_at":"2026-07-05T06:53:26.989846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02500","created_at":"2026-07-05T06:53:26.989846+00:00"},{"alias_kind":"pith_short_12","alias_value":"GH77KB74OE4O","created_at":"2026-07-05T06:53:26.989846+00:00"},{"alias_kind":"pith_short_16","alias_value":"GH77KB74OE4OVD37","created_at":"2026-07-05T06:53:26.989846+00:00"},{"alias_kind":"pith_short_8","alias_value":"GH77KB74","created_at":"2026-07-05T06:53:26.989846+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/GH77KB74OE4OVD37NBBEE3F4NT","json":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT.json","graph_json":"https://pith.science/api/pith-number/GH77KB74OE4OVD37NBBEE3F4NT/graph.json","events_json":"https://pith.science/api/pith-number/GH77KB74OE4OVD37NBBEE3F4NT/events.json","paper":"https://pith.science/paper/GH77KB74"},"agent_actions":{"view_html":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT","download_json":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT.json","view_paper":"https://pith.science/paper/GH77KB74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02500&json=true","fetch_graph":"https://pith.science/api/pith-number/GH77KB74OE4OVD37NBBEE3F4NT/graph.json","fetch_events":"https://pith.science/api/pith-number/GH77KB74OE4OVD37NBBEE3F4NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/action/storage_attestation","attest_author":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/action/author_attestation","sign_citation":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/action/citation_signature","submit_replication":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/action/replication_record"}},"created_at":"2026-07-05T06:53:26.989846+00:00","updated_at":"2026-07-05T06:53:26.989846+00:00"}