{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GH77KB74OE4OVD37NBBEE3F4NT","short_pith_number":"pith:GH77KB74","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"},"canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","source":{"kind":"arxiv","id":"1812.02500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02500","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02500v1","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02500","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"GH77KB74OE4O","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_16","alias_value":"GH77KB74OE4OVD37","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_8","alias_value":"GH77KB74","created_at":"2026-07-05T06:53:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GH77KB74OE4OVD37NBBEE3F4NT","target":"record","payload":{"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"},"canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","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"},"source_kind":"arxiv","source_id":"1812.02500","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-07-05T06:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIxsIx6Nw5Jdo76Z58r95fOjLTT2nISV/E0sG99ERxdZtwW99sAuuPbcRFsNW+NPd7lSL0qLwfYysflWZ+s6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:21:18.008525Z"},"content_sha256":"35af98d176d314993a5beabad435d04bb5b201c6d21012c6c7487f9e343ed21c","schema_version":"1.0","event_id":"sha256:35af98d176d314993a5beabad435d04bb5b201c6d21012c6c7487f9e343ed21c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GH77KB74OE4OVD37NBBEE3F4NT","target":"graph","payload":{"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"},"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-07-05T06:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klYMQVwq3ugSZiyx+AZnWzwr9mm+DN+0bHb7yIBprxY1GOsrGkkCp6oDFBa0L4dxkz1OVhUA2Drg3NHaktv1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:21:18.008901Z"},"content_sha256":"479487d933ee78c431b0c97e11fef8d1d9df20c730f10572544b821ea4422cfc","schema_version":"1.0","event_id":"sha256:479487d933ee78c431b0c97e11fef8d1d9df20c730f10572544b821ea4422cfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/bundle.json","state_url":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GH77KB74OE4OVD37NBBEE3F4NT/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-07-07T10:21:18Z","links":{"resolver":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT","bundle":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/bundle.json","state":"https://pith.science/pith/GH77KB74OE4OVD37NBBEE3F4NT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GH77KB74OE4OVD37NBBEE3F4NT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GH77KB74OE4OVD37NBBEE3F4NT","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":"c0549642a8001bd0f7c81ef96d6bbaaa53ac3a2d960907dd8878eab1e163fd0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-06T12:45:48Z","title_canon_sha256":"b02323fe688c0ee9cf03be538f4b91772ce107492479cc192e64610d3af01ff2"},"schema_version":"1.0","source":{"id":"1812.02500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02500","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02500v1","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02500","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"GH77KB74OE4O","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_16","alias_value":"GH77KB74OE4OVD37","created_at":"2026-07-05T06:53:26Z"},{"alias_kind":"pith_short_8","alias_value":"GH77KB74","created_at":"2026-07-05T06:53:26Z"}],"graph_snapshots":[{"event_id":"sha256:479487d933ee78c431b0c97e11fef8d1d9df20c730f10572544b821ea4422cfc","target":"graph","created_at":"2026-07-05T06:53:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.02500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ke Tang, Peng Yang, Xin Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-06T12:45:48Z","title":"A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02500","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:35af98d176d314993a5beabad435d04bb5b201c6d21012c6c7487f9e343ed21c","target":"record","created_at":"2026-07-05T06:53:26Z","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":"c0549642a8001bd0f7c81ef96d6bbaaa53ac3a2d960907dd8878eab1e163fd0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-12-06T12:45:48Z","title_canon_sha256":"b02323fe688c0ee9cf03be538f4b91772ce107492479cc192e64610d3af01ff2"},"schema_version":"1.0","source":{"id":"1812.02500","kind":"arxiv","version":1}},"canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31fff507fc7138ea8f7f6842426cbc6ced5b55dfe6865d944406ce780347861c","first_computed_at":"2026-07-05T06:53:26.989789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:53:26.989789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XF7XcTaqA7/ppZaw1WH4XvRW/KFkQ+c1FlQ7UWu3tGHIXeAET4EIIGUgTTh0bQSWsApArtjKvQZl0s96PKe/Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:53:26.990247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35af98d176d314993a5beabad435d04bb5b201c6d21012c6c7487f9e343ed21c","sha256:479487d933ee78c431b0c97e11fef8d1d9df20c730f10572544b821ea4422cfc"],"state_sha256":"f09b3d0d39c2eea37446dac860839c642bb26b5e3f10e7bdced617b30eb5dd84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbwKyQl0laTpxuD/gmNlj176m8X1VqePx0BWd2K+BZlUYLL3u849nGElccFrVQ5j2bea7hxM/t1kxLt41jpxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:21:18.010878Z","bundle_sha256":"a708a8f45d4968aad62c3c7cbe15b09890f245f30a14fae11e000e264d7412ec"}}