{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BPXFZKL5W65N4NVEXOMXRV4GHB","short_pith_number":"pith:BPXFZKL5","canonical_record":{"source":{"id":"1806.10950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-27T01:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"8a0d2f2199c1565bca9becb2aff61ae17b9d10dc15c4d6824921ac00bfbbfd75","abstract_canon_sha256":"e962f4cd41b735c74fdd8d2304a738427518daef47922094bfbcaa88e1a2612c"},"schema_version":"1.0"},"canonical_sha256":"0bee5ca97db7bade36a4bb9978d786385e13859be3c04a31acccc51b3353663e","source":{"kind":"arxiv","id":"1806.10950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10950","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10950v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10950","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"BPXFZKL5W65N","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BPXFZKL5W65N4NVE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BPXFZKL5","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BPXFZKL5W65N4NVEXOMXRV4GHB","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-27T01:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"8a0d2f2199c1565bca9becb2aff61ae17b9d10dc15c4d6824921ac00bfbbfd75","abstract_canon_sha256":"e962f4cd41b735c74fdd8d2304a738427518daef47922094bfbcaa88e1a2612c"},"schema_version":"1.0"},"canonical_sha256":"0bee5ca97db7bade36a4bb9978d786385e13859be3c04a31acccc51b3353663e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.444302Z","signature_b64":"7Lok997zY9W6gJKeGofr+LZ4NwOsED+ZuLwUZFRZp6wa3TLBvFkvVUaEj4jwFHxbq0H7Fz2mxu/Gf41h+dvlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bee5ca97db7bade36a4bb9978d786385e13859be3c04a31acccc51b3353663e","last_reissued_at":"2026-05-18T00:12:07.443799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.443799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10950","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LycjxPZVybEXQ5xiu6zO/6nNHL5uY4S5P8ei4zFYmrp/H784DDIo+03o3/WbIoKh3VIvfwHLcpU7puoC2VTOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:48:00.077993Z"},"content_sha256":"bd93caea9691e857c3f8d066b012b3f9afa711ccda9bd9055053ccc45d69f596","schema_version":"1.0","event_id":"sha256:bd93caea9691e857c3f8d066b012b3f9afa711ccda9bd9055053ccc45d69f596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BPXFZKL5W65N4NVEXOMXRV4GHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Decomposition-Based Many-Objective Evolutionary Algorithm with Local Iterative Update","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Bing Zeng, Yingyu Zhang","submitted_at":"2018-06-27T01:27:12Z","abstract_excerpt":"Existing studies have shown that the conventional multi-objective evolutionary algorithms (MOEAs) based on decomposition may lose the population diversity when solving some many-objective optimization problems. In this paper, a simple decomposition-based MOEA with local iterative update (LIU) is proposed. The LIU strategy has two features that are expected to drive the population to approximate the Pareto Front with good distribution. One is that only the worst solution in the current neighborhood is swapped out by the newly generated offspring, preventing the population from being occupied by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10950","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgEzKN56dgWvzOgtZQAYykTcMphGSptagqczx5a+sbyLU7EykFhdgoTPOCUbi/Ru0D0DJOXQZakYENVMhnRdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:48:00.078352Z"},"content_sha256":"7e833d00d3fbc68034bccb563dbe892d66cdb51495692ca08e6b815568b2c40b","schema_version":"1.0","event_id":"sha256:7e833d00d3fbc68034bccb563dbe892d66cdb51495692ca08e6b815568b2c40b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/bundle.json","state_url":"https://pith.science/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/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-01T16:48:00Z","links":{"resolver":"https://pith.science/pith/BPXFZKL5W65N4NVEXOMXRV4GHB","bundle":"https://pith.science/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/bundle.json","state":"https://pith.science/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPXFZKL5W65N4NVEXOMXRV4GHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BPXFZKL5W65N4NVEXOMXRV4GHB","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":"e962f4cd41b735c74fdd8d2304a738427518daef47922094bfbcaa88e1a2612c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-27T01:27:12Z","title_canon_sha256":"8a0d2f2199c1565bca9becb2aff61ae17b9d10dc15c4d6824921ac00bfbbfd75"},"schema_version":"1.0","source":{"id":"1806.10950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10950","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10950v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10950","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"BPXFZKL5W65N","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BPXFZKL5W65N4NVE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BPXFZKL5","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7e833d00d3fbc68034bccb563dbe892d66cdb51495692ca08e6b815568b2c40b","target":"graph","created_at":"2026-05-18T00:12:07Z","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":"Existing studies have shown that the conventional multi-objective evolutionary algorithms (MOEAs) based on decomposition may lose the population diversity when solving some many-objective optimization problems. In this paper, a simple decomposition-based MOEA with local iterative update (LIU) is proposed. The LIU strategy has two features that are expected to drive the population to approximate the Pareto Front with good distribution. One is that only the worst solution in the current neighborhood is swapped out by the newly generated offspring, preventing the population from being occupied by","authors_text":"Bing Zeng, Yingyu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-27T01:27:12Z","title":"A Decomposition-Based Many-Objective Evolutionary Algorithm with Local Iterative Update"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10950","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:bd93caea9691e857c3f8d066b012b3f9afa711ccda9bd9055053ccc45d69f596","target":"record","created_at":"2026-05-18T00:12:07Z","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":"e962f4cd41b735c74fdd8d2304a738427518daef47922094bfbcaa88e1a2612c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-27T01:27:12Z","title_canon_sha256":"8a0d2f2199c1565bca9becb2aff61ae17b9d10dc15c4d6824921ac00bfbbfd75"},"schema_version":"1.0","source":{"id":"1806.10950","kind":"arxiv","version":1}},"canonical_sha256":"0bee5ca97db7bade36a4bb9978d786385e13859be3c04a31acccc51b3353663e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bee5ca97db7bade36a4bb9978d786385e13859be3c04a31acccc51b3353663e","first_computed_at":"2026-05-18T00:12:07.443799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.443799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Lok997zY9W6gJKeGofr+LZ4NwOsED+ZuLwUZFRZp6wa3TLBvFkvVUaEj4jwFHxbq0H7Fz2mxu/Gf41h+dvlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.444302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd93caea9691e857c3f8d066b012b3f9afa711ccda9bd9055053ccc45d69f596","sha256:7e833d00d3fbc68034bccb563dbe892d66cdb51495692ca08e6b815568b2c40b"],"state_sha256":"c5739725a53e9f077dbfcbeb72c3b2425aa60bceff4731cfb7067ad5b480bff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3ej5OgMn5yu3+moWTfvFGDLyt25jKuubs3kgu1eZKf4DuMU1AA2fqHJn89FqYsrbO8d6fG7gxBXAXXFUhJcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:48:00.080283Z","bundle_sha256":"a178700675e5e770621616157fbd3a6f4c7cec1e52d470313c5954af1bb895eb"}}