{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E6WD76AMWVVTG3Z6MUSRWAEW6S","short_pith_number":"pith:E6WD76AM","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"},"canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","source":{"kind":"arxiv","id":"2601.06387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.06387","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2601.06387v1","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.06387","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"E6WD76AMWVVT","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"E6WD76AMWVVTG3Z6","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"E6WD76AM","created_at":"2026-06-24T01:14:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E6WD76AMWVVTG3Z6MUSRWAEW6S","target":"record","payload":{"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"},"canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","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"},"source_kind":"arxiv","source_id":"2601.06387","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YiyABakml9NMpn/wEcwgd44A2FiK5Iz06fa3INvDqfB03DdXsaJplqIiSkqK/L6putyPMS6rXkc6FY62awZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:14:22.918498Z"},"content_sha256":"08c576bbafffd2730b5c27b3d79e19cee82cedfb19fb83b9fc1406c57f4eb370","schema_version":"1.0","event_id":"sha256:08c576bbafffd2730b5c27b3d79e19cee82cedfb19fb83b9fc1406c57f4eb370"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E6WD76AMWVVTG3Z6MUSRWAEW6S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2q1wCXY4WugpumVUwM6hykepKissIWMzXv3v7sFhxFC28xkz8TI+Xg+xlBdgyr45L9KckmcjEKIKCbD/To4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:14:22.918862Z"},"content_sha256":"387bd73649657ce83b4385cd0d4457c0f4aeb657f64d19a511ff7fad555f113a","schema_version":"1.0","event_id":"sha256:387bd73649657ce83b4385cd0d4457c0f4aeb657f64d19a511ff7fad555f113a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/bundle.json","state_url":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T02:14:22Z","links":{"resolver":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S","bundle":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/bundle.json","state":"https://pith.science/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6WD76AMWVVTG3Z6MUSRWAEW6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E6WD76AMWVVTG3Z6MUSRWAEW6S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbebb102ef6f0f4e229da7c015a36bada75744026705c7e768a3d586eea65ca3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-01-10T02:14:27Z","title_canon_sha256":"64c98fc102d5b2c484bd430f256c5e1baaa94287e8c42e6342f9bfabb0628d30"},"schema_version":"1.0","source":{"id":"2601.06387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.06387","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2601.06387v1","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.06387","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"E6WD76AMWVVT","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"E6WD76AMWVVTG3Z6","created_at":"2026-06-24T01:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"E6WD76AM","created_at":"2026-06-24T01:14:24Z"}],"graph_snapshots":[{"event_id":"sha256:387bd73649657ce83b4385cd0d4457c0f4aeb657f64d19a511ff7fad555f113a","target":"graph","created_at":"2026-06-24T01:14:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.06387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Hisao Ishibuchi, Ke Shang, Qingfu Zhang, Zexuan Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-01-10T02:14:27Z","title":"An Efficient Evolutionary Algorithm for Few-for-Many Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.06387","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08c576bbafffd2730b5c27b3d79e19cee82cedfb19fb83b9fc1406c57f4eb370","target":"record","created_at":"2026-06-24T01:14:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbebb102ef6f0f4e229da7c015a36bada75744026705c7e768a3d586eea65ca3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2026-01-10T02:14:27Z","title_canon_sha256":"64c98fc102d5b2c484bd430f256c5e1baaa94287e8c42e6342f9bfabb0628d30"},"schema_version":"1.0","source":{"id":"2601.06387","kind":"arxiv","version":1}},"canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ac3ff80cb56b336f3e65251b0096f48ebbae505690b8209f57f8eef527178e","first_computed_at":"2026-06-24T01:14:24.777966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:24.777966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHC8B82AooC5HnE0wm1IfcmCtloRj8AO5jkY+qq07KYRwaGaB1mJQAwyiORF4eo6SMKZ5NHs14uWWIC675OiAw==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:24.778453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.06387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c576bbafffd2730b5c27b3d79e19cee82cedfb19fb83b9fc1406c57f4eb370","sha256:387bd73649657ce83b4385cd0d4457c0f4aeb657f64d19a511ff7fad555f113a"],"state_sha256":"411626c3f62f1bb07a0d9ca4542819876e3cb00e6a9ff4bba72e8113aab72a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EypdyMlr8mR5YcdIiL+jUIyOsAgi/Qg3kbndTLNxIOuz/aJTMzQ3Cr1K7FLbqq9891ktACcPPfPYTxmehByAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:14:22.920782Z","bundle_sha256":"06de6d259708a35e49a24d43e55ec40fc74fba37854642c8a8b07ddf2276b07c"}}