{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PM2ETUWQ6ZIKKOKYVJMV2OLONN","short_pith_number":"pith:PM2ETUWQ","schema_version":"1.0","canonical_sha256":"7b3449d2d0f650a53958aa595d396e6b645ed53ed9f0fbcf468d879e559ed3da","source":{"kind":"arxiv","id":"1203.6286","version":5},"attestation_state":"computed","paper":{"title":"On the Easiest and Hardest Fitness Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Tianshi Chen, Xin Yao","submitted_at":"2012-03-28T15:01:53Z","abstract_excerpt":"The hardness of fitness functions is an important research topic in the field of evolutionary computation. In theory, the study can help understanding the ability of evolutionary algorithms. In practice, the study may provide a guideline to the design of benchmarks. The aim of this paper is to answer the following research questions: Given a fitness function class, which functions are the easiest with respect to an evolutionary algorithm? Which are the hardest? How are these functions constructed? The paper provides theoretical answers to these questions. The easiest and hardest fitness functi"},"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":"1203.6286","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-03-28T15:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"87fae1465a5e49aed893526cdae1c3b760aeba0b2584503608e456ae41f03756","abstract_canon_sha256":"c5d22e7b5471b452d67857892a5349a87b1da1b73f9a54d9085e36ac68e8360b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.844526Z","signature_b64":"hdnYkv3amlKtaLM6izf0wVlDIr6sOlOe1VZtWTyDMulH7Ez+NshE9bwBUfWpK7OlerS6zH37FNjE45z96JonCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3449d2d0f650a53958aa595d396e6b645ed53ed9f0fbcf468d879e559ed3da","last_reissued_at":"2026-05-18T00:17:13.843914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.843914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Easiest and Hardest Fitness Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jun He, Tianshi Chen, Xin Yao","submitted_at":"2012-03-28T15:01:53Z","abstract_excerpt":"The hardness of fitness functions is an important research topic in the field of evolutionary computation. In theory, the study can help understanding the ability of evolutionary algorithms. In practice, the study may provide a guideline to the design of benchmarks. The aim of this paper is to answer the following research questions: Given a fitness function class, which functions are the easiest with respect to an evolutionary algorithm? Which are the hardest? How are these functions constructed? The paper provides theoretical answers to these questions. The easiest and hardest fitness functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6286","kind":"arxiv","version":5},"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":"1203.6286","created_at":"2026-05-18T00:17:13.843985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6286v5","created_at":"2026-05-18T00:17:13.843985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6286","created_at":"2026-05-18T00:17:13.843985+00:00"},{"alias_kind":"pith_short_12","alias_value":"PM2ETUWQ6ZIK","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PM2ETUWQ6ZIKKOKY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PM2ETUWQ","created_at":"2026-05-18T12:27:18.751474+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/PM2ETUWQ6ZIKKOKYVJMV2OLONN","json":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN.json","graph_json":"https://pith.science/api/pith-number/PM2ETUWQ6ZIKKOKYVJMV2OLONN/graph.json","events_json":"https://pith.science/api/pith-number/PM2ETUWQ6ZIKKOKYVJMV2OLONN/events.json","paper":"https://pith.science/paper/PM2ETUWQ"},"agent_actions":{"view_html":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN","download_json":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN.json","view_paper":"https://pith.science/paper/PM2ETUWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6286&json=true","fetch_graph":"https://pith.science/api/pith-number/PM2ETUWQ6ZIKKOKYVJMV2OLONN/graph.json","fetch_events":"https://pith.science/api/pith-number/PM2ETUWQ6ZIKKOKYVJMV2OLONN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN/action/storage_attestation","attest_author":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN/action/author_attestation","sign_citation":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN/action/citation_signature","submit_replication":"https://pith.science/pith/PM2ETUWQ6ZIKKOKYVJMV2OLONN/action/replication_record"}},"created_at":"2026-05-18T00:17:13.843985+00:00","updated_at":"2026-05-18T00:17:13.843985+00:00"}