{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SG6BXNTXCAPD6O4MM45F6LAMMG","short_pith_number":"pith:SG6BXNTX","schema_version":"1.0","canonical_sha256":"91bc1bb677101e3f3b8c673a5f2c0c619bea10909f55964f9ac931ed384250a1","source":{"kind":"arxiv","id":"2405.05721","version":2},"attestation_state":"computed","paper":{"title":"A Newton Method for Hausdorff Approximations of the Pareto Front within Multi-objective Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andr\\'e Deutz, Angel E. Rodriguez-Fernandez, Hao Wang, Lourdes Uribe, Oliver Sch\\\"utze, Oziel Cort\\'es-Pi\\~na","submitted_at":"2024-05-09T12:34:34Z","abstract_excerpt":"A common goal in evolutionary multi-objective optimization is to find suitable finite-size approximations of the Pareto front of a given multi-objective optimization problem. While many multi-objective evolutionary algorithms have proven to be very efficient in finding good Pareto front approximations, they may need quite a few resources or may even fail to obtain optimal or nearly approximations. Hereby, optimality is implicitly defined by the chosen performance indicator. In this work, we propose a set-based Newton method for Hausdorff approximations of the Pareto front to be used within mul"},"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":"2405.05721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-05-09T12:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"35c501481587402c86327b800fde396bfa86f92de3c5a6dbdb1e3516ec821edc","abstract_canon_sha256":"42f87dca5140125cd69223a2d8a732e42d3ef5f1e77f3de71b2ef27608017a6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:26.016663Z","signature_b64":"pjZX2l7ExOp3jBFICqzkgcAUKmesReAlAE1sugSr3LW7vJGZibGjcSKAKh/6OUGRU1Ke7f5yk2bmnTCOGa2eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91bc1bb677101e3f3b8c673a5f2c0c619bea10909f55964f9ac931ed384250a1","last_reissued_at":"2026-07-05T09:11:26.016264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:26.016264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Newton Method for Hausdorff Approximations of the Pareto Front within Multi-objective Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andr\\'e Deutz, Angel E. Rodriguez-Fernandez, Hao Wang, Lourdes Uribe, Oliver Sch\\\"utze, Oziel Cort\\'es-Pi\\~na","submitted_at":"2024-05-09T12:34:34Z","abstract_excerpt":"A common goal in evolutionary multi-objective optimization is to find suitable finite-size approximations of the Pareto front of a given multi-objective optimization problem. While many multi-objective evolutionary algorithms have proven to be very efficient in finding good Pareto front approximations, they may need quite a few resources or may even fail to obtain optimal or nearly approximations. Hereby, optimality is implicitly defined by the chosen performance indicator. In this work, we propose a set-based Newton method for Hausdorff approximations of the Pareto front to be used within mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05721","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/2405.05721/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":"2405.05721","created_at":"2026-07-05T09:11:26.016323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.05721v2","created_at":"2026-07-05T09:11:26.016323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05721","created_at":"2026-07-05T09:11:26.016323+00:00"},{"alias_kind":"pith_short_12","alias_value":"SG6BXNTXCAPD","created_at":"2026-07-05T09:11:26.016323+00:00"},{"alias_kind":"pith_short_16","alias_value":"SG6BXNTXCAPD6O4M","created_at":"2026-07-05T09:11:26.016323+00:00"},{"alias_kind":"pith_short_8","alias_value":"SG6BXNTX","created_at":"2026-07-05T09:11:26.016323+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14610","citing_title":"MMD-Newton Method for Multi-objective Optimization","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG","json":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG.json","graph_json":"https://pith.science/api/pith-number/SG6BXNTXCAPD6O4MM45F6LAMMG/graph.json","events_json":"https://pith.science/api/pith-number/SG6BXNTXCAPD6O4MM45F6LAMMG/events.json","paper":"https://pith.science/paper/SG6BXNTX"},"agent_actions":{"view_html":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG","download_json":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG.json","view_paper":"https://pith.science/paper/SG6BXNTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.05721&json=true","fetch_graph":"https://pith.science/api/pith-number/SG6BXNTXCAPD6O4MM45F6LAMMG/graph.json","fetch_events":"https://pith.science/api/pith-number/SG6BXNTXCAPD6O4MM45F6LAMMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG/action/storage_attestation","attest_author":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG/action/author_attestation","sign_citation":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG/action/citation_signature","submit_replication":"https://pith.science/pith/SG6BXNTXCAPD6O4MM45F6LAMMG/action/replication_record"}},"created_at":"2026-07-05T09:11:26.016323+00:00","updated_at":"2026-07-05T09:11:26.016323+00:00"}