{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VXRXDKHR4ULVJPECDCXO3PZQSF","short_pith_number":"pith:VXRXDKHR","canonical_record":{"source":{"id":"1612.07603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-12-21T14:36:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4217d397bf6049b89e08f0372aa3bdc4a1c9b9492dc340b3d3eea0e3850f959e","abstract_canon_sha256":"88cf3011994f19894fc2d9aacbe481110945905501ee021c417d53d532d718fb"},"schema_version":"1.0"},"canonical_sha256":"ade371a8f1e51754bc8218aeedbf309164b7bc1b9f1b9ce9968e80d7eba9377a","source":{"kind":"arxiv","id":"1612.07603","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07603","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07603v3","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07603","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"VXRXDKHR4ULV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXRXDKHR4ULVJPEC","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXRXDKHR","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VXRXDKHR4ULVJPECDCXO3PZQSF","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-12-21T14:36:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4217d397bf6049b89e08f0372aa3bdc4a1c9b9492dc340b3d3eea0e3850f959e","abstract_canon_sha256":"88cf3011994f19894fc2d9aacbe481110945905501ee021c417d53d532d718fb"},"schema_version":"1.0"},"canonical_sha256":"ade371a8f1e51754bc8218aeedbf309164b7bc1b9f1b9ce9968e80d7eba9377a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.314001Z","signature_b64":"T5KmwWVO1p6HJxhTVVjiTgPgOXQvoNu4okFhMs9n4qsBVwNoE5WQHgFN5482uR2exTXhbjTR5HNpOrkaRKc4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ade371a8f1e51754bc8218aeedbf309164b7bc1b9f1b9ce9968e80d7eba9377a","last_reissued_at":"2026-05-17T23:45:00.313268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.313268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07603","source_version":3,"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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNgM621zTFld7/mU3HQxtFRtMXx6PIjk2DFe7tP79n7w0gBV7UIYLclKRVeK8ofSXO0nRDxFMKlp0fqgdQccCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:16:07.561858Z"},"content_sha256":"bf918c1215c02f4de927fe36d5050427521bc9d6585ef44937329b069b3333e5","schema_version":"1.0","event_id":"sha256:bf918c1215c02f4de927fe36d5050427521bc9d6585ef44937329b069b3333e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VXRXDKHR4ULVJPECDCXO3PZQSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Difficulty Adjustable and Scalable Constrained Multi-objective Test Problem Toolkit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Caimin Wei, Erik D. Goodman, Hui Li, Kalyanmoy Deb, Qingfu Zhang, Wenji Li, Xinye Cai, Zhun Fan","submitted_at":"2016-12-21T14:36:29Z","abstract_excerpt":"Multi-objective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, but most of them are designed to solve unconstrained multi-objective optimization problems. In fact, many real-world multi-objective problems contain a number of constraints. To promote research on constrained multi-objective optimization, we first propose a problem classification scheme with three primary types of difficulty, which reflect various types of challenges presented by real-world optimization problems, in order to characterize the constraint functions in constrained multi-objective opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07603","kind":"arxiv","version":3},"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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNscaKnH/jGW7CuzIXTcwc+R0e+F31WZvYfa9bZIhMg238Q12DsEp63UCqJAQ4h6jMXddNZ2jsn/2ruYsTM8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:16:07.562564Z"},"content_sha256":"f24892fadd139da780db4086486eac1af0b6577696cf789aa6bc36e911155f1e","schema_version":"1.0","event_id":"sha256:f24892fadd139da780db4086486eac1af0b6577696cf789aa6bc36e911155f1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/bundle.json","state_url":"https://pith.science/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/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-28T21:16:07Z","links":{"resolver":"https://pith.science/pith/VXRXDKHR4ULVJPECDCXO3PZQSF","bundle":"https://pith.science/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/bundle.json","state":"https://pith.science/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXRXDKHR4ULVJPECDCXO3PZQSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VXRXDKHR4ULVJPECDCXO3PZQSF","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":"88cf3011994f19894fc2d9aacbe481110945905501ee021c417d53d532d718fb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-12-21T14:36:29Z","title_canon_sha256":"4217d397bf6049b89e08f0372aa3bdc4a1c9b9492dc340b3d3eea0e3850f959e"},"schema_version":"1.0","source":{"id":"1612.07603","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07603","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07603v3","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07603","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"VXRXDKHR4ULV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXRXDKHR4ULVJPEC","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXRXDKHR","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:f24892fadd139da780db4086486eac1af0b6577696cf789aa6bc36e911155f1e","target":"graph","created_at":"2026-05-17T23:45:00Z","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-objective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, but most of them are designed to solve unconstrained multi-objective optimization problems. In fact, many real-world multi-objective problems contain a number of constraints. To promote research on constrained multi-objective optimization, we first propose a problem classification scheme with three primary types of difficulty, which reflect various types of challenges presented by real-world optimization problems, in order to characterize the constraint functions in constrained multi-objective opti","authors_text":"Caimin Wei, Erik D. Goodman, Hui Li, Kalyanmoy Deb, Qingfu Zhang, Wenji Li, Xinye Cai, Zhun Fan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-12-21T14:36:29Z","title":"Difficulty Adjustable and Scalable Constrained Multi-objective Test Problem Toolkit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07603","kind":"arxiv","version":3},"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:bf918c1215c02f4de927fe36d5050427521bc9d6585ef44937329b069b3333e5","target":"record","created_at":"2026-05-17T23:45:00Z","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":"88cf3011994f19894fc2d9aacbe481110945905501ee021c417d53d532d718fb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-12-21T14:36:29Z","title_canon_sha256":"4217d397bf6049b89e08f0372aa3bdc4a1c9b9492dc340b3d3eea0e3850f959e"},"schema_version":"1.0","source":{"id":"1612.07603","kind":"arxiv","version":3}},"canonical_sha256":"ade371a8f1e51754bc8218aeedbf309164b7bc1b9f1b9ce9968e80d7eba9377a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ade371a8f1e51754bc8218aeedbf309164b7bc1b9f1b9ce9968e80d7eba9377a","first_computed_at":"2026-05-17T23:45:00.313268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:00.313268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5KmwWVO1p6HJxhTVVjiTgPgOXQvoNu4okFhMs9n4qsBVwNoE5WQHgFN5482uR2exTXhbjTR5HNpOrkaRKc4Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:00.314001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07603","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf918c1215c02f4de927fe36d5050427521bc9d6585ef44937329b069b3333e5","sha256:f24892fadd139da780db4086486eac1af0b6577696cf789aa6bc36e911155f1e"],"state_sha256":"c93b92af1ef7116849b973584746986f18209526569e93d362aa95c58333a58e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hoUKzdb8KRLa1Gpq7K7zyMf0X2zNieg4FhP/92IuC4agbcnj+Y0ps37Nt8wM/zmyq4VAkdQQ3RQR4BHvEPaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:16:07.566116Z","bundle_sha256":"4007635e3565a923d28f0760ddb2594c36a2850d85df38e80b50f91d187f2e37"}}