{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JFVDCH6WQDURZ44L3NZJMGU3ZB","short_pith_number":"pith:JFVDCH6W","canonical_record":{"source":{"id":"1709.05915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T13:18:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7a2a20086bbbb9d21759080ffb9cdfc7cb723901f0935890b2622ed8dc3aa68b","abstract_canon_sha256":"b89bd112a78b23803840458f3d300852f7f0ff3d05e207c7037c0d248cf9c15f"},"schema_version":"1.0"},"canonical_sha256":"496a311fd680e91cf38bdb72961a9bc86cff58ea3b2845c8bc51f3353e6cd8b3","source":{"kind":"arxiv","id":"1709.05915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05915","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05915v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05915","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"JFVDCH6WQDUR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JFVDCH6WQDURZ44L","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JFVDCH6W","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JFVDCH6WQDURZ44L3NZJMGU3ZB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T13:18:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7a2a20086bbbb9d21759080ffb9cdfc7cb723901f0935890b2622ed8dc3aa68b","abstract_canon_sha256":"b89bd112a78b23803840458f3d300852f7f0ff3d05e207c7037c0d248cf9c15f"},"schema_version":"1.0"},"canonical_sha256":"496a311fd680e91cf38bdb72961a9bc86cff58ea3b2845c8bc51f3353e6cd8b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.908789Z","signature_b64":"CSkUM417unbcDTfN9f+8E7zVO1zxY4utBiQsMVxf2LpqL2LUA0A32xiytdaCmv9GOZLVr415qLueb3p1dp58Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496a311fd680e91cf38bdb72961a9bc86cff58ea3b2845c8bc51f3353e6cd8b3","last_reissued_at":"2026-05-18T00:34:58.908106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.908106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05915","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:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UF6JfjlZwjO6Sa609NYaKo56Tnp/3Qp28YEnVpFmEXhZLUdpkkjM87vgSEtt6iVk4nuliVpnV9XMaIh+xdUSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:14:32.490675Z"},"content_sha256":"863efaaa2030b7b1aa48ca433bdfd50ea5c605d59fd1bbefbf6011dfd47eb926","schema_version":"1.0","event_id":"sha256:863efaaa2030b7b1aa48ca433bdfd50ea5c605d59fd1bbefbf6011dfd47eb926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JFVDCH6WQDURZ44L3NZJMGU3ZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Push and Pull Search for Solving Constrained Multi-objective Optimization Problems","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":"2017-09-15T13:18:55Z","abstract_excerpt":"This paper proposes a push and pull search (PPS) framework for solving constrained multi-objective optimization problems (CMOPs). To be more specific, the proposed PPS divides the search process into two different stages, including the push and pull search stages. In the push stage, a multi-objective evolutionary algorithm (MOEA) is adopted to explore the search space without considering any constraints, which can help to get across infeasible regions very fast and approach the unconstrained Pareto front. Furthermore, the landscape of CMOPs with constraints can be probed and estimated in the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05915","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:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydvi6IH0OptFhBizP4SppPwcSkrFYB9mLw9FhqUdwWImExVSqSiGinq/kT75xT1Rv3N9KuexXG6zegJzugVBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:14:32.491341Z"},"content_sha256":"080a867d9707ca4921f370b9d2c438a3ed2cb7eb6ae4f02cede09855d394474d","schema_version":"1.0","event_id":"sha256:080a867d9707ca4921f370b9d2c438a3ed2cb7eb6ae4f02cede09855d394474d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/bundle.json","state_url":"https://pith.science/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/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-11T01:14:32Z","links":{"resolver":"https://pith.science/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB","bundle":"https://pith.science/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/bundle.json","state":"https://pith.science/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFVDCH6WQDURZ44L3NZJMGU3ZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JFVDCH6WQDURZ44L3NZJMGU3ZB","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":"b89bd112a78b23803840458f3d300852f7f0ff3d05e207c7037c0d248cf9c15f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T13:18:55Z","title_canon_sha256":"7a2a20086bbbb9d21759080ffb9cdfc7cb723901f0935890b2622ed8dc3aa68b"},"schema_version":"1.0","source":{"id":"1709.05915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05915","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05915v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05915","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"JFVDCH6WQDUR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JFVDCH6WQDURZ44L","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JFVDCH6W","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:080a867d9707ca4921f370b9d2c438a3ed2cb7eb6ae4f02cede09855d394474d","target":"graph","created_at":"2026-05-18T00:34:58Z","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 a push and pull search (PPS) framework for solving constrained multi-objective optimization problems (CMOPs). To be more specific, the proposed PPS divides the search process into two different stages, including the push and pull search stages. In the push stage, a multi-objective evolutionary algorithm (MOEA) is adopted to explore the search space without considering any constraints, which can help to get across infeasible regions very fast and approach the unconstrained Pareto front. Furthermore, the landscape of CMOPs with constraints can be probed and estimated in the p","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":"2017-09-15T13:18:55Z","title":"Push and Pull Search for Solving Constrained Multi-objective Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05915","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:863efaaa2030b7b1aa48ca433bdfd50ea5c605d59fd1bbefbf6011dfd47eb926","target":"record","created_at":"2026-05-18T00:34:58Z","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":"b89bd112a78b23803840458f3d300852f7f0ff3d05e207c7037c0d248cf9c15f","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-09-15T13:18:55Z","title_canon_sha256":"7a2a20086bbbb9d21759080ffb9cdfc7cb723901f0935890b2622ed8dc3aa68b"},"schema_version":"1.0","source":{"id":"1709.05915","kind":"arxiv","version":1}},"canonical_sha256":"496a311fd680e91cf38bdb72961a9bc86cff58ea3b2845c8bc51f3353e6cd8b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"496a311fd680e91cf38bdb72961a9bc86cff58ea3b2845c8bc51f3353e6cd8b3","first_computed_at":"2026-05-18T00:34:58.908106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:58.908106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSkUM417unbcDTfN9f+8E7zVO1zxY4utBiQsMVxf2LpqL2LUA0A32xiytdaCmv9GOZLVr415qLueb3p1dp58Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:58.908789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:863efaaa2030b7b1aa48ca433bdfd50ea5c605d59fd1bbefbf6011dfd47eb926","sha256:080a867d9707ca4921f370b9d2c438a3ed2cb7eb6ae4f02cede09855d394474d"],"state_sha256":"e79b299b939f09208a380321ac6b99def40a1f839a9c72ddbfc5b4831b4941ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klu7C4u6nJMi9nyEg/+BQNKs2wpcAK1MAlfBsY3pnc2DESpTlAuDr1VvFD70secI8WHz/cHmgTfj5HZDEE8bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:14:32.494930Z","bundle_sha256":"6c209e11560e78b89a26fa7123f4b58cac5202dbbb35c553c2f36422cb01a126"}}