{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DHAVNGLMU2MYEMEUQCEUZ2JFIL","short_pith_number":"pith:DHAVNGLM","schema_version":"1.0","canonical_sha256":"19c156996ca69982309480894ce92542c7ce22ed59618faf3ec7303f03f8b16a","source":{"kind":"arxiv","id":"1804.07179","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Analysis of Pareto Set Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Keisuke Goto, Naoki Hamada","submitted_at":"2018-04-19T14:03:00Z","abstract_excerpt":"When and why can evolutionary multi-objective optimization (EMO) algorithms cover the entire Pareto set? That is a major concern for EMO researchers and practitioners. A recent theoretical study revealed that (roughly speaking) if the Pareto set forms a topological simplex (a curved line, a curved triangle, a curved tetrahedron, etc.), then decomposition-based EMO algorithms can cover the entire Pareto set. Usually, we cannot know the true Pareto set and have to estimate its topology by using the population of EMO algorithms during or after the runtime. This paper presents a data-driven approa"},"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":"1804.07179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-19T14:03:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4f642ce5d6edbd361a0868df907350a8e6ff5288820275f846d25d4bf1e3e0e0","abstract_canon_sha256":"fdf028dfba61e1320de84dff705c41d261fc34617aab9994b41be0e4cd9dae8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:01.165282Z","signature_b64":"iG73Ck5KbND6A2sXrptp8/tzIabl/QNMG9w9PDTRvxToOOtSDYSscInab1ie+aXpz+43mP9B0DMytfZHae3VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c156996ca69982309480894ce92542c7ce22ed59618faf3ec7303f03f8b16a","last_reissued_at":"2026-05-18T00:18:01.164635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:01.164635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Analysis of Pareto Set Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Keisuke Goto, Naoki Hamada","submitted_at":"2018-04-19T14:03:00Z","abstract_excerpt":"When and why can evolutionary multi-objective optimization (EMO) algorithms cover the entire Pareto set? That is a major concern for EMO researchers and practitioners. A recent theoretical study revealed that (roughly speaking) if the Pareto set forms a topological simplex (a curved line, a curved triangle, a curved tetrahedron, etc.), then decomposition-based EMO algorithms can cover the entire Pareto set. Usually, we cannot know the true Pareto set and have to estimate its topology by using the population of EMO algorithms during or after the runtime. This paper presents a data-driven approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07179","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.07179","created_at":"2026-05-18T00:18:01.164728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07179v1","created_at":"2026-05-18T00:18:01.164728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07179","created_at":"2026-05-18T00:18:01.164728+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHAVNGLMU2MY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHAVNGLMU2MYEMEU","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHAVNGLM","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL","json":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL.json","graph_json":"https://pith.science/api/pith-number/DHAVNGLMU2MYEMEUQCEUZ2JFIL/graph.json","events_json":"https://pith.science/api/pith-number/DHAVNGLMU2MYEMEUQCEUZ2JFIL/events.json","paper":"https://pith.science/paper/DHAVNGLM"},"agent_actions":{"view_html":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL","download_json":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL.json","view_paper":"https://pith.science/paper/DHAVNGLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07179&json=true","fetch_graph":"https://pith.science/api/pith-number/DHAVNGLMU2MYEMEUQCEUZ2JFIL/graph.json","fetch_events":"https://pith.science/api/pith-number/DHAVNGLMU2MYEMEUQCEUZ2JFIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL/action/storage_attestation","attest_author":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL/action/author_attestation","sign_citation":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL/action/citation_signature","submit_replication":"https://pith.science/pith/DHAVNGLMU2MYEMEUQCEUZ2JFIL/action/replication_record"}},"created_at":"2026-05-18T00:18:01.164728+00:00","updated_at":"2026-05-18T00:18:01.164728+00:00"}