{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UF2WYR7MANUNKAG2HWVPT3CTWU","short_pith_number":"pith:UF2WYR7M","schema_version":"1.0","canonical_sha256":"a1756c47ec0368d500da3daaf9ec53b52cf1de85d5aa0f629562002ae289635f","source":{"kind":"arxiv","id":"1504.04909","version":1},"attestation_state":"computed","paper":{"title":"Illuminating search spaces by mapping elites","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.RO","q-bio.PE"],"primary_cat":"cs.AI","authors_text":"Jean-Baptiste Mouret, Jeff Clune","submitted_at":"2015-04-20T01:17:00Z","abstract_excerpt":"Many fields use search algorithms, which automatically explore a search space to find high-performing solutions: chemists search through the space of molecules to discover new drugs; engineers search for stronger, cheaper, safer designs, scientists search for models that best explain data, etc. The goal of search algorithms has traditionally been to return the single highest-performing solution in a search space. Here we describe a new, fundamentally different type of algorithm that is more useful because it provides a holistic view of how high-performing solutions are distributed throughout a"},"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":"1504.04909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-04-20T01:17:00Z","cross_cats_sorted":["cs.NE","cs.RO","q-bio.PE"],"title_canon_sha256":"21b75bd2fad4362daa6385bac4874b0d1109ec55d6f3f09809bfc233dc68d27b","abstract_canon_sha256":"a90d82cf8ee0f7c479b07a392178e9665a1d252237df4eca088af8a37b04e930"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:24.423300Z","signature_b64":"2E9XWXrfz77IwYMwlMFQ3mjfiAos5tHHXhS/12VYDUDQ6sx04l0HoXzMOZLSY4DLUNgphNzYFravh3rSls6TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1756c47ec0368d500da3daaf9ec53b52cf1de85d5aa0f629562002ae289635f","last_reissued_at":"2026-05-18T02:18:24.422776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:24.422776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Illuminating search spaces by mapping elites","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.RO","q-bio.PE"],"primary_cat":"cs.AI","authors_text":"Jean-Baptiste Mouret, Jeff Clune","submitted_at":"2015-04-20T01:17:00Z","abstract_excerpt":"Many fields use search algorithms, which automatically explore a search space to find high-performing solutions: chemists search through the space of molecules to discover new drugs; engineers search for stronger, cheaper, safer designs, scientists search for models that best explain data, etc. The goal of search algorithms has traditionally been to return the single highest-performing solution in a search space. Here we describe a new, fundamentally different type of algorithm that is more useful because it provides a holistic view of how high-performing solutions are distributed throughout a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04909","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":""},"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":"1504.04909","created_at":"2026-05-18T02:18:24.422852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04909v1","created_at":"2026-05-18T02:18:24.422852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04909","created_at":"2026-05-18T02:18:24.422852+00:00"},{"alias_kind":"pith_short_12","alias_value":"UF2WYR7MANUN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UF2WYR7MANUNKAG2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UF2WYR7M","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":49,"internal_anchor_count":31,"sample":[{"citing_arxiv_id":"1907.01623","citing_title":"Evolving the Hearthstone Meta","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23007","citing_title":"MadEvolve: Evolutionary Optimization of Trading Systems with Large Language Models","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03840","citing_title":"Diverse Agents for Ad-Hoc Cooperation in Hanabi","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06562","citing_title":"The Many AI Challenges of Hearthstone","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"1907.07075","citing_title":"Prediction of neural network performance by phenotypic modeling","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09209","citing_title":"Automatic Calibration of Artificial Neural Networks for Zebrafish Collective Behaviours using a Quality Diversity Algorithm","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2505.06617","citing_title":"Adversarial Coevolutionary Illumination with Generational Adversarial MAP-Elites","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2508.00712","citing_title":"JSON-Bag: A generic game trajectory representation","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2601.19562","citing_title":"Tournament Informed Adversarial Quality Diversity","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17373","citing_title":"FML-bench: A Controlled Study of AI Research Agent Strategies from the Perspective of Search Dynamics","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19633","citing_title":"optimize_anything: A Universal API for Optimizing any Text Parameter","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16727","citing_title":"PopuLoRA: Co-Evolving LLM Populations for Reasoning Self-Play","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16844","citing_title":"Artificial Adaptive Intelligence: The Missing Stage Between Narrow and General Intelligence","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15809","citing_title":"Diversified Residual Symbolic Regression","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15221","citing_title":"Effective Harness Engineering for Algorithm Discovery with Coding Agents","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03335","citing_title":"EvolveSignal: A Large Language Model Powered Coding Agent for Discovering Traffic Signal Control Strategies","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2510.14235","citing_title":"Spiking Neural Network Architecture Search: A Survey","ref_index":127,"is_internal_anchor":true},{"citing_arxiv_id":"2601.17808","citing_title":"Motif Diversity in Human Liver ChIP-seq Data Using MAP-Elites","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2601.20981","citing_title":"Diversifying Toxicity Search in Large Language Models Through Speciation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":239,"is_internal_anchor":true},{"citing_arxiv_id":"2309.08532","citing_title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","ref_index":180,"is_internal_anchor":true},{"citing_arxiv_id":"2602.16044","citing_title":"Multi-Objective Evolutionary Design of Molecules with Enhanced Nonlinear Optical Properties","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2602.22507","citing_title":"Space Syntax-guided Post-training for Residential Floor Plan Generation","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2603.12510","citing_title":"Red-Teaming Vision-Language-Action Models via Quality Diversity Prompt Generation for Robust Robot Policies","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2408.08435","citing_title":"Automated Design of Agentic Systems","ref_index":185,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU","json":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU.json","graph_json":"https://pith.science/api/pith-number/UF2WYR7MANUNKAG2HWVPT3CTWU/graph.json","events_json":"https://pith.science/api/pith-number/UF2WYR7MANUNKAG2HWVPT3CTWU/events.json","paper":"https://pith.science/paper/UF2WYR7M"},"agent_actions":{"view_html":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU","download_json":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU.json","view_paper":"https://pith.science/paper/UF2WYR7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04909&json=true","fetch_graph":"https://pith.science/api/pith-number/UF2WYR7MANUNKAG2HWVPT3CTWU/graph.json","fetch_events":"https://pith.science/api/pith-number/UF2WYR7MANUNKAG2HWVPT3CTWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU/action/storage_attestation","attest_author":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU/action/author_attestation","sign_citation":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU/action/citation_signature","submit_replication":"https://pith.science/pith/UF2WYR7MANUNKAG2HWVPT3CTWU/action/replication_record"}},"created_at":"2026-05-18T02:18:24.422852+00:00","updated_at":"2026-05-18T02:18:24.422852+00:00"}