{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WZXJWGFVGLRRPATHBCSFGMAVAQ","short_pith_number":"pith:WZXJWGFV","schema_version":"1.0","canonical_sha256":"b66e9b18b532e317826708a4533015040bff785228ae9adb82c5aa341d460750","source":{"kind":"arxiv","id":"2302.14838","version":3},"attestation_state":"computed","paper":{"title":"EvoPrompting: Language Models for Code-Level Neural Architecture Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Angelica Chen, David M. Dohan, David R. So","submitted_at":"2023-02-28T18:37:25Z","abstract_excerpt":"Given the recent impressive accomplishments of language models (LMs) for code generation, we explore the use of LMs as adaptive mutation and crossover operators for an evolutionary neural architecture search (NAS) algorithm. While NAS still proves too difficult a task for LMs to succeed at solely through prompting, we find that the combination of evolutionary prompt engineering with soft prompt-tuning, a method we term EvoPrompting, consistently finds diverse and high performing models. We first demonstrate that EvoPrompting is effective on the computationally efficient MNIST-1D dataset, where"},"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":"2302.14838","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2023-02-28T18:37:25Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"ffe9a09d006caa1f683e939f7dd34d1d2d6ac8933143942d8c8679ac83638c9c","abstract_canon_sha256":"0e9df730157e9c25b1dde9e4f81b012ecd80970c27bb98850695738ee54b6193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:21.537194Z","signature_b64":"lJf3Nm5yoxrg2mO8MQFjRXIJ5DYBn+0yydM6E/Vjy8K8gtlS6AeAmX++iJFbGpK3sYBi5FqyOW6hgW7FR8eoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66e9b18b532e317826708a4533015040bff785228ae9adb82c5aa341d460750","last_reissued_at":"2026-07-05T07:13:21.536527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:21.536527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EvoPrompting: Language Models for Code-Level Neural Architecture Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Angelica Chen, David M. Dohan, David R. So","submitted_at":"2023-02-28T18:37:25Z","abstract_excerpt":"Given the recent impressive accomplishments of language models (LMs) for code generation, we explore the use of LMs as adaptive mutation and crossover operators for an evolutionary neural architecture search (NAS) algorithm. While NAS still proves too difficult a task for LMs to succeed at solely through prompting, we find that the combination of evolutionary prompt engineering with soft prompt-tuning, a method we term EvoPrompting, consistently finds diverse and high performing models. We first demonstrate that EvoPrompting is effective on the computationally efficient MNIST-1D dataset, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14838","kind":"arxiv","version":3},"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/2302.14838/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":"2302.14838","created_at":"2026-07-05T07:13:21.536608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.14838v3","created_at":"2026-07-05T07:13:21.536608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14838","created_at":"2026-07-05T07:13:21.536608+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZXJWGFVGLRR","created_at":"2026-07-05T07:13:21.536608+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZXJWGFVGLRRPATH","created_at":"2026-07-05T07:13:21.536608+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZXJWGFV","created_at":"2026-07-05T07:13:21.536608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30109","citing_title":"TacEvo: Self-Evolving Architecture Discovery for Robotic Tactile Perception via LLM-Driven Quality-Diversity Search","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27130","citing_title":"DEI: Diversity in Evolutionary Inference for Quality-Diversity Search","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2309.08532","citing_title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","ref_index":171,"is_internal_anchor":false},{"citing_arxiv_id":"2309.03409","citing_title":"Large Language Models as Optimizers","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ","json":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ.json","graph_json":"https://pith.science/api/pith-number/WZXJWGFVGLRRPATHBCSFGMAVAQ/graph.json","events_json":"https://pith.science/api/pith-number/WZXJWGFVGLRRPATHBCSFGMAVAQ/events.json","paper":"https://pith.science/paper/WZXJWGFV"},"agent_actions":{"view_html":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ","download_json":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ.json","view_paper":"https://pith.science/paper/WZXJWGFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.14838&json=true","fetch_graph":"https://pith.science/api/pith-number/WZXJWGFVGLRRPATHBCSFGMAVAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WZXJWGFVGLRRPATHBCSFGMAVAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ/action/storage_attestation","attest_author":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ/action/author_attestation","sign_citation":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ/action/citation_signature","submit_replication":"https://pith.science/pith/WZXJWGFVGLRRPATHBCSFGMAVAQ/action/replication_record"}},"created_at":"2026-07-05T07:13:21.536608+00:00","updated_at":"2026-07-05T07:13:21.536608+00:00"}