{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NLGG2OQLHYDH7NFATVXMK5YGMH","short_pith_number":"pith:NLGG2OQL","canonical_record":{"source":{"id":"1707.08767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T07:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"80d2e98cb87cf4b77047a8779be1cded463fbbd4d9f72f77dda6a4646267494f","abstract_canon_sha256":"2ae1cb1f7690d11e12faf5b4474b0803668bf0f43b7c0639e22e4bd1734e4309"},"schema_version":"1.0"},"canonical_sha256":"6acc6d3a0b3e067fb4a09d6ec5770661f7e2766dbf789c7036d7b6f08aadcb84","source":{"kind":"arxiv","id":"1707.08767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08767","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08767v1","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08767","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"pith_short_12","alias_value":"NLGG2OQLHYDH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLGG2OQLHYDH7NFA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLGG2OQL","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NLGG2OQLHYDH7NFATVXMK5YGMH","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T07:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"80d2e98cb87cf4b77047a8779be1cded463fbbd4d9f72f77dda6a4646267494f","abstract_canon_sha256":"2ae1cb1f7690d11e12faf5b4474b0803668bf0f43b7c0639e22e4bd1734e4309"},"schema_version":"1.0"},"canonical_sha256":"6acc6d3a0b3e067fb4a09d6ec5770661f7e2766dbf789c7036d7b6f08aadcb84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:03.721751Z","signature_b64":"W18zRFFLi34ZxjnMjOvQXJ7YwETf6s2RY2nnWhQNaibWDbh1oRYehdVzW5WPp7fKsGSA/+MuPt8oqnazwgMbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6acc6d3a0b3e067fb4a09d6ec5770661f7e2766dbf789c7036d7b6f08aadcb84","last_reissued_at":"2026-05-18T00:35:03.721015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:03.721015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08767","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:35:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvu84v3/350oi+xiZvJIUQUFIr7AN44MA6b2UbG3ifpBiq6zCSdO/VfU/Gy0Lv7pfOM+zqqO5HkUcs27xjVpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:58:45.772461Z"},"content_sha256":"27b50d0a40266c8bc78eb690ce538c30c90ceec9a33ef259471a2e371c5c7ecd","schema_version":"1.0","event_id":"sha256:27b50d0a40266c8bc78eb690ce538c30c90ceec9a33ef259471a2e371c5c7ecd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NLGG2OQLHYDH7NFATVXMK5YGMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Epsilon Constraint-handling Method in MOEA/D for CMOPs with Large Infeasible Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Caimin Wei, Erik Goodman, Han Huang, Jiajie Mo, Wenji Li, Xinye Cai, Yi Fang, Yugen You, Zhun Fan","submitted_at":"2017-07-27T07:59:31Z","abstract_excerpt":"This paper proposes an improved epsilon constraint-handling mechanism, and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of feasible to total solutions (RFS) in the current population. In order to evaluate the performance of MOEA/D-IEpsilon, a new set of CMOPs with two and three objectives is designed, having large infeasible r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08767","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:35:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2Gkpymdq3/5H4m0E+cCW+8G8MTTfifXv29uq8eZXzuXWvToenEyG1Pbl8kxN6gFwTXJDnLGo3PDTMtk39p6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:58:45.772825Z"},"content_sha256":"0dd32fb7bd8af8db16a084d340318ab940a98a9a1ca6e29fcd1662ed903ccb6b","schema_version":"1.0","event_id":"sha256:0dd32fb7bd8af8db16a084d340318ab940a98a9a1ca6e29fcd1662ed903ccb6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/bundle.json","state_url":"https://pith.science/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/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-05-28T07:58:45Z","links":{"resolver":"https://pith.science/pith/NLGG2OQLHYDH7NFATVXMK5YGMH","bundle":"https://pith.science/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/bundle.json","state":"https://pith.science/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLGG2OQLHYDH7NFATVXMK5YGMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NLGG2OQLHYDH7NFATVXMK5YGMH","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":"2ae1cb1f7690d11e12faf5b4474b0803668bf0f43b7c0639e22e4bd1734e4309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T07:59:31Z","title_canon_sha256":"80d2e98cb87cf4b77047a8779be1cded463fbbd4d9f72f77dda6a4646267494f"},"schema_version":"1.0","source":{"id":"1707.08767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08767","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08767v1","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08767","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"pith_short_12","alias_value":"NLGG2OQLHYDH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLGG2OQLHYDH7NFA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLGG2OQL","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:0dd32fb7bd8af8db16a084d340318ab940a98a9a1ca6e29fcd1662ed903ccb6b","target":"graph","created_at":"2026-05-18T00:35:03Z","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":"This paper proposes an improved epsilon constraint-handling mechanism, and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of feasible to total solutions (RFS) in the current population. In order to evaluate the performance of MOEA/D-IEpsilon, a new set of CMOPs with two and three objectives is designed, having large infeasible r","authors_text":"Caimin Wei, Erik Goodman, Han Huang, Jiajie Mo, Wenji Li, Xinye Cai, Yi Fang, Yugen You, Zhun Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T07:59:31Z","title":"An Improved Epsilon Constraint-handling Method in MOEA/D for CMOPs with Large Infeasible Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08767","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:27b50d0a40266c8bc78eb690ce538c30c90ceec9a33ef259471a2e371c5c7ecd","target":"record","created_at":"2026-05-18T00:35:03Z","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":"2ae1cb1f7690d11e12faf5b4474b0803668bf0f43b7c0639e22e4bd1734e4309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-27T07:59:31Z","title_canon_sha256":"80d2e98cb87cf4b77047a8779be1cded463fbbd4d9f72f77dda6a4646267494f"},"schema_version":"1.0","source":{"id":"1707.08767","kind":"arxiv","version":1}},"canonical_sha256":"6acc6d3a0b3e067fb4a09d6ec5770661f7e2766dbf789c7036d7b6f08aadcb84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6acc6d3a0b3e067fb4a09d6ec5770661f7e2766dbf789c7036d7b6f08aadcb84","first_computed_at":"2026-05-18T00:35:03.721015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:03.721015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W18zRFFLi34ZxjnMjOvQXJ7YwETf6s2RY2nnWhQNaibWDbh1oRYehdVzW5WPp7fKsGSA/+MuPt8oqnazwgMbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:03.721751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b50d0a40266c8bc78eb690ce538c30c90ceec9a33ef259471a2e371c5c7ecd","sha256:0dd32fb7bd8af8db16a084d340318ab940a98a9a1ca6e29fcd1662ed903ccb6b"],"state_sha256":"a52099e4879b85587f2be31425ee2423ea7d12602f5cef5b0b3e475cea60b2ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivhSLJvVxuYIKI+7RNVk2LpJfREZNlJmtrWI572dMRFIl3N01BCigHHCIKgbfMW9zl8KgIN5UnOYaXTXKbf9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:58:45.774961Z","bundle_sha256":"503e70b4cbdba52da0adad95f83902bd965a06fa7df5cbb7d6d243abf63fd7cb"}}