{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E2AZYUHIHZVONCWMJXGJKU5DT4","short_pith_number":"pith:E2AZYUHI","schema_version":"1.0","canonical_sha256":"26819c50e83e6ae68acc4dcc9553a39f30d4e61857782110afd0d19a2e2fa4b8","source":{"kind":"arxiv","id":"1910.04966","version":2},"attestation_state":"computed","paper":{"title":"Evolutionary Multiobjective Optimization Driven by Generative Adversarial Networks (GANs)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Cheng He, Kay Chen Tan, Ran Cheng, Shihua Huang, Yaochu Jin","submitted_at":"2019-10-11T04:28:41Z","abstract_excerpt":"Recently, increasing works have proposed to drive evolutionary algorithms using machine learning models. Usually, the performance of such model based evolutionary algorithms is highly dependent on the training qualities of the adopted models. Since it usually requires a certain amount of data (i.e. the candidate solutions generated by the algorithms) for model training, the performance deteriorates rapidly with the increase of the problem scales, due to the curse of dimensionality. To address this issue, we propose a multi-objective evolutionary algorithm driven by the generative adversarial n"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1910.04966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-10-11T04:28:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7c31a7f2f67246657ee687e8ca512a0efc03dc9dda3fa88c66534a6187bf03d3","abstract_canon_sha256":"b872a17fac313f41c1a57efc492e35d26c06eb6d92b3e52066c2e10b8a057e9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:36.186312Z","signature_b64":"R5hqeSzzSPB4YK0rGIm+zSvOuKrP2V1XR01MeD8Nis82KNC6P4x0dftgbeZOgL+Gu9gvZtFF6j6ds3wHnVC5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26819c50e83e6ae68acc4dcc9553a39f30d4e61857782110afd0d19a2e2fa4b8","last_reissued_at":"2026-07-05T01:01:36.185842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:36.185842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Multiobjective Optimization Driven by Generative Adversarial Networks (GANs)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Cheng He, Kay Chen Tan, Ran Cheng, Shihua Huang, Yaochu Jin","submitted_at":"2019-10-11T04:28:41Z","abstract_excerpt":"Recently, increasing works have proposed to drive evolutionary algorithms using machine learning models. Usually, the performance of such model based evolutionary algorithms is highly dependent on the training qualities of the adopted models. Since it usually requires a certain amount of data (i.e. the candidate solutions generated by the algorithms) for model training, the performance deteriorates rapidly with the increase of the problem scales, due to the curse of dimensionality. To address this issue, we propose a multi-objective evolutionary algorithm driven by the generative adversarial n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04966","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.04966/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.04966","created_at":"2026-07-05T01:01:36.185900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04966v2","created_at":"2026-07-05T01:01:36.185900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04966","created_at":"2026-07-05T01:01:36.185900+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2AZYUHIHZVO","created_at":"2026-07-05T01:01:36.185900+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2AZYUHIHZVONCWM","created_at":"2026-07-05T01:01:36.185900+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2AZYUHI","created_at":"2026-07-05T01:01:36.185900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01566","citing_title":"Multi-objective Deep Learning: Taxonomy and Survey of the State of the Art","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4","json":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4.json","graph_json":"https://pith.science/api/pith-number/E2AZYUHIHZVONCWMJXGJKU5DT4/graph.json","events_json":"https://pith.science/api/pith-number/E2AZYUHIHZVONCWMJXGJKU5DT4/events.json","paper":"https://pith.science/paper/E2AZYUHI"},"agent_actions":{"view_html":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4","download_json":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4.json","view_paper":"https://pith.science/paper/E2AZYUHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04966&json=true","fetch_graph":"https://pith.science/api/pith-number/E2AZYUHIHZVONCWMJXGJKU5DT4/graph.json","fetch_events":"https://pith.science/api/pith-number/E2AZYUHIHZVONCWMJXGJKU5DT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4/action/storage_attestation","attest_author":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4/action/author_attestation","sign_citation":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4/action/citation_signature","submit_replication":"https://pith.science/pith/E2AZYUHIHZVONCWMJXGJKU5DT4/action/replication_record"}},"created_at":"2026-07-05T01:01:36.185900+00:00","updated_at":"2026-07-05T01:01:36.185900+00:00"}