{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E6WD76AMWVVTG3Z6MUSRWAEW6S","short_pith_number":"pith:E6WD76AM","schema_version":"1.0","canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","source":{"kind":"arxiv","id":"2601.06387","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Evolutionary Algorithm for Few-for-Many Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hisao Ishibuchi, Ke Shang, Qingfu Zhang, Zexuan Zhu","submitted_at":"2026-01-10T02:14:27Z","abstract_excerpt":"Few-for-many (F4M) optimization, recently introduced as a novel paradigm in multi-objective optimization, aims to find a small set of solutions that effectively handle a large number of conflicting objectives. Unlike traditional many-objective optimization methods, which typically attempt comprehensive coverage of the Pareto front, F4M optimization emphasizes finding a small representative solution set to efficiently address high-dimensional objective spaces. Motivated by the computational complexity and practical relevance of F4M optimization, this paper proposes a new evolutionary algorithm "},"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":"2601.06387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-01-10T02:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"64c98fc102d5b2c484bd430f256c5e1baaa94287e8c42e6342f9bfabb0628d30","abstract_canon_sha256":"fbebb102ef6f0f4e229da7c015a36bada75744026705c7e768a3d586eea65ca3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:24.778453Z","signature_b64":"yHC8B82AooC5HnE0wm1IfcmCtloRj8AO5jkY+qq07KYRwaGaB1mJQAwyiORF4eo6SMKZ5NHs14uWWIC675OiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","last_reissued_at":"2026-06-24T01:14:24.777966Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:24.777966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Evolutionary Algorithm for Few-for-Many Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hisao Ishibuchi, Ke Shang, Qingfu Zhang, Zexuan Zhu","submitted_at":"2026-01-10T02:14:27Z","abstract_excerpt":"Few-for-many (F4M) optimization, recently introduced as a novel paradigm in multi-objective optimization, aims to find a small set of solutions that effectively handle a large number of conflicting objectives. Unlike traditional many-objective optimization methods, which typically attempt comprehensive coverage of the Pareto front, F4M optimization emphasizes finding a small representative solution set to efficiently address high-dimensional objective spaces. Motivated by the computational complexity and practical relevance of F4M optimization, this paper proposes a new evolutionary algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.06387","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.06387/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":"2601.06387","created_at":"2026-06-24T01:14:24.778022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.06387v1","created_at":"2026-06-24T01:14:24.778022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.06387","created_at":"2026-06-24T01:14:24.778022+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6WD76AMWVVT","created_at":"2026-06-24T01:14:24.778022+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6WD76AMWVVTG3Z6","created_at":"2026-06-24T01:14:24.778022+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6WD76AM","created_at":"2026-06-24T01:14:24.778022+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/E6WD76AMWVVTG3Z6MUSRWAEW6S","json":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S.json","graph_json":"https://pith.science/api/pith-number/E6WD76AMWVVTG3Z6MUSRWAEW6S/graph.json","events_json":"https://pith.science/api/pith-number/E6WD76AMWVVTG3Z6MUSRWAEW6S/events.json","paper":"https://pith.science/paper/E6WD76AM"},"agent_actions":{"view_html":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S","download_json":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S.json","view_paper":"https://pith.science/paper/E6WD76AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.06387&json=true","fetch_graph":"https://pith.science/api/pith-number/E6WD76AMWVVTG3Z6MUSRWAEW6S/graph.json","fetch_events":"https://pith.science/api/pith-number/E6WD76AMWVVTG3Z6MUSRWAEW6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/action/storage_attestation","attest_author":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/action/author_attestation","sign_citation":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/action/citation_signature","submit_replication":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/action/replication_record"}},"created_at":"2026-06-24T01:14:24.778022+00:00","updated_at":"2026-06-24T01:14:24.778022+00:00"}