{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RTBNFM7DSRGLFL4BYANWD76UPG","short_pith_number":"pith:RTBNFM7D","canonical_record":{"source":{"id":"1803.06282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-25T00:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"c139a2911aaa2318a5e1ae7e017e9907157c70a0ec3204c08c4384c054d896c8","abstract_canon_sha256":"e8b5fab5abb6307fab92ad777b495cc9b3dd72f0ff44eb58fd09b0cdf44c9ddd"},"schema_version":"1.0"},"canonical_sha256":"8cc2d2b3e3944cb2af81c01b61ffd47997eff2f65af5cc5813d54bc105215d5f","source":{"kind":"arxiv","id":"1803.06282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06282","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06282v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06282","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"RTBNFM7DSRGL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RTBNFM7DSRGLFL4B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RTBNFM7D","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RTBNFM7DSRGLFL4BYANWD76UPG","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-25T00:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"c139a2911aaa2318a5e1ae7e017e9907157c70a0ec3204c08c4384c054d896c8","abstract_canon_sha256":"e8b5fab5abb6307fab92ad777b495cc9b3dd72f0ff44eb58fd09b0cdf44c9ddd"},"schema_version":"1.0"},"canonical_sha256":"8cc2d2b3e3944cb2af81c01b61ffd47997eff2f65af5cc5813d54bc105215d5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.031139Z","signature_b64":"5pEME7N3c3gGTQobi3msWgzgDWcON/u1woakzQaY9zcT/vbCBI38/wwFf6gAstXtR6zsNr1/JA480NFG66inCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc2d2b3e3944cb2af81c01b61ffd47997eff2f65af5cc5813d54bc105215d5f","last_reissued_at":"2026-05-18T00:20:50.030670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.030670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06282","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Ig4QxZXsYZjWP8hQVcQFlVSCn6e96QbalVSj3g+4Dy4Dn1rPMskC3a6wQFmzvhpEB141N205ML3LUGUok1dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:01.054520Z"},"content_sha256":"1190389e7531e560d861c7b5f14a0439f2989311df17bd63d8492d62a8452e25","schema_version":"1.0","event_id":"sha256:1190389e7531e560d861c7b5f14a0439f2989311df17bd63d8492d62a8452e25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RTBNFM7DSRGLFL4BYANWD76UPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A mullti- or many- objective evolutionary algorithm with global loop update","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Bing Zeng, Junqing Li, Yingyu Zhang, Yuanzhen Li","submitted_at":"2018-01-25T00:14:51Z","abstract_excerpt":"Multi- or many-objective evolutionary algorithm- s(MOEAs), especially the decomposition-based MOEAs have been widely concerned in recent years. The decomposition-based MOEAs emphasize convergence and diversity in a simple model and have made a great success in dealing with theoretical and practical multi- or many-objective optimization problems. In this paper, we focus on update strategies of the decomposition- based MOEAs, and their criteria for comparing solutions. Three disadvantages of the decomposition-based MOEAs with local update strategies and several existing criteria for comparing so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06282","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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wP8hTSzjFB6+YD6Zak0yBl8iASSNo+kX+9D0gjrE5rNFBbA07QOmnIh9AzM3hPne8mYF94GM1iIUB4nWukzNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:01.054856Z"},"content_sha256":"3afb32e9a2c6fd799447ea0e8e4e9007432abcf7d42d37df90370560b31154c3","schema_version":"1.0","event_id":"sha256:3afb32e9a2c6fd799447ea0e8e4e9007432abcf7d42d37df90370560b31154c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTBNFM7DSRGLFL4BYANWD76UPG/bundle.json","state_url":"https://pith.science/pith/RTBNFM7DSRGLFL4BYANWD76UPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTBNFM7DSRGLFL4BYANWD76UPG/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-01T14:29:01Z","links":{"resolver":"https://pith.science/pith/RTBNFM7DSRGLFL4BYANWD76UPG","bundle":"https://pith.science/pith/RTBNFM7DSRGLFL4BYANWD76UPG/bundle.json","state":"https://pith.science/pith/RTBNFM7DSRGLFL4BYANWD76UPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTBNFM7DSRGLFL4BYANWD76UPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RTBNFM7DSRGLFL4BYANWD76UPG","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":"e8b5fab5abb6307fab92ad777b495cc9b3dd72f0ff44eb58fd09b0cdf44c9ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-25T00:14:51Z","title_canon_sha256":"c139a2911aaa2318a5e1ae7e017e9907157c70a0ec3204c08c4384c054d896c8"},"schema_version":"1.0","source":{"id":"1803.06282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06282","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06282v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06282","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"RTBNFM7DSRGL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RTBNFM7DSRGLFL4B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RTBNFM7D","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:3afb32e9a2c6fd799447ea0e8e4e9007432abcf7d42d37df90370560b31154c3","target":"graph","created_at":"2026-05-18T00:20:50Z","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":"Multi- or many-objective evolutionary algorithm- s(MOEAs), especially the decomposition-based MOEAs have been widely concerned in recent years. The decomposition-based MOEAs emphasize convergence and diversity in a simple model and have made a great success in dealing with theoretical and practical multi- or many-objective optimization problems. In this paper, we focus on update strategies of the decomposition- based MOEAs, and their criteria for comparing solutions. Three disadvantages of the decomposition-based MOEAs with local update strategies and several existing criteria for comparing so","authors_text":"Bing Zeng, Junqing Li, Yingyu Zhang, Yuanzhen Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-25T00:14:51Z","title":"A mullti- or many- objective evolutionary algorithm with global loop update"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06282","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:1190389e7531e560d861c7b5f14a0439f2989311df17bd63d8492d62a8452e25","target":"record","created_at":"2026-05-18T00:20:50Z","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":"e8b5fab5abb6307fab92ad777b495cc9b3dd72f0ff44eb58fd09b0cdf44c9ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-25T00:14:51Z","title_canon_sha256":"c139a2911aaa2318a5e1ae7e017e9907157c70a0ec3204c08c4384c054d896c8"},"schema_version":"1.0","source":{"id":"1803.06282","kind":"arxiv","version":1}},"canonical_sha256":"8cc2d2b3e3944cb2af81c01b61ffd47997eff2f65af5cc5813d54bc105215d5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cc2d2b3e3944cb2af81c01b61ffd47997eff2f65af5cc5813d54bc105215d5f","first_computed_at":"2026-05-18T00:20:50.030670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:50.030670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5pEME7N3c3gGTQobi3msWgzgDWcON/u1woakzQaY9zcT/vbCBI38/wwFf6gAstXtR6zsNr1/JA480NFG66inCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:50.031139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1190389e7531e560d861c7b5f14a0439f2989311df17bd63d8492d62a8452e25","sha256:3afb32e9a2c6fd799447ea0e8e4e9007432abcf7d42d37df90370560b31154c3"],"state_sha256":"1ac69285df1285637fe99d99e2f88ea2976755c3db4e08667a995a14b9543f65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"477wtRKUpkI8pC0CagwyiWN81fXz5TT+VLwkbhbnI5K07QWnqyg9ERxEooUibomfMmWXPW3tW9fuShR39MYMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:29:01.056744Z","bundle_sha256":"59b5e8e18f2c9c07e1b26b5ab533b458fc72a052964850b49dafcd948a1177df"}}