{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:HLD73632YIM2NFKX6IAXNJB34I","short_pith_number":"pith:HLD73632","schema_version":"1.0","canonical_sha256":"3ac7fdfb7ac219a69557f20176a43be222b1a6a221f6e34ced66287a9a15f5eb","source":{"kind":"arxiv","id":"0804.0581","version":2},"attestation_state":"computed","paper":{"title":"Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.NA","authors_text":"Carlos A. Coello Coello (INRIA Lille - Nord Europe), El-Ghazali Talbi (INRIA Futurs, Emilia Tantar (INRIA Lille - Nord Europe), LGI - IMAG, LIFIA, LIFL), Oliver Schuetze (INRIA Futurs)","submitted_at":"2008-04-03T15:32:17Z","abstract_excerpt":"Recently, a framework for the approximation of the entire set of $\\epsilon$-efficient solutions (denote by $E_\\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such an algorithm produces -- under mild assumptions on the process to generate new candidate solutions --a sequence of archives which converges to $E_{\\epsilon}$ in the limit and in the probabilistic sense. The result, though satisfactory for most discrete MOPs, is at least from the practical viewpoint not sufficient for continuous models: in this case, the set "},"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":"0804.0581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2008-04-03T15:32:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"f3862cadcd15d258fa5ce17ced32545d6fd9cb78092e8e8d061cb9ef6d753797","abstract_canon_sha256":"e37c3e2d3f668d03e615bd8547ed23355d9531a746c00b5c58432ad74898cee3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:05.364685Z","signature_b64":"+zONqg5mvnoqFWax1a95TMeSQqL3egI1be8r9bi7l3r5QQ16ODcHC3qQ9iVNQvAtUNN5mqVCN1phoFTdt+0/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac7fdfb7ac219a69557f20176a43be222b1a6a221f6e34ced66287a9a15f5eb","last_reissued_at":"2026-06-03T22:06:05.364280Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:05.364280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.NA","authors_text":"Carlos A. Coello Coello (INRIA Lille - Nord Europe), El-Ghazali Talbi (INRIA Futurs, Emilia Tantar (INRIA Lille - Nord Europe), LGI - IMAG, LIFIA, LIFL), Oliver Schuetze (INRIA Futurs)","submitted_at":"2008-04-03T15:32:17Z","abstract_excerpt":"Recently, a framework for the approximation of the entire set of $\\epsilon$-efficient solutions (denote by $E_\\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such an algorithm produces -- under mild assumptions on the process to generate new candidate solutions --a sequence of archives which converges to $E_{\\epsilon}$ in the limit and in the probabilistic sense. The result, though satisfactory for most discrete MOPs, is at least from the practical viewpoint not sufficient for continuous models: in this case, the set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0581","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/0804.0581/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":"0804.0581","created_at":"2026-06-03T22:06:05.364342+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0581v2","created_at":"2026-06-03T22:06:05.364342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0581","created_at":"2026-06-03T22:06:05.364342+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLD73632YIM2","created_at":"2026-06-03T22:06:05.364342+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLD73632YIM2NFKX","created_at":"2026-06-03T22:06:05.364342+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLD73632","created_at":"2026-06-03T22:06:05.364342+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/HLD73632YIM2NFKX6IAXNJB34I","json":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I.json","graph_json":"https://pith.science/api/pith-number/HLD73632YIM2NFKX6IAXNJB34I/graph.json","events_json":"https://pith.science/api/pith-number/HLD73632YIM2NFKX6IAXNJB34I/events.json","paper":"https://pith.science/paper/HLD73632"},"agent_actions":{"view_html":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I","download_json":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I.json","view_paper":"https://pith.science/paper/HLD73632","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0581&json=true","fetch_graph":"https://pith.science/api/pith-number/HLD73632YIM2NFKX6IAXNJB34I/graph.json","fetch_events":"https://pith.science/api/pith-number/HLD73632YIM2NFKX6IAXNJB34I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I/action/storage_attestation","attest_author":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I/action/author_attestation","sign_citation":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I/action/citation_signature","submit_replication":"https://pith.science/pith/HLD73632YIM2NFKX6IAXNJB34I/action/replication_record"}},"created_at":"2026-06-03T22:06:05.364342+00:00","updated_at":"2026-06-03T22:06:05.364342+00:00"}