{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VWUKQVS3PYZQRCNCRYUHFILM6I","short_pith_number":"pith:VWUKQVS3","schema_version":"1.0","canonical_sha256":"ada8a8565b7e330889a28e2872a16cf23601f12198331699ff50213d5c3ad2df","source":{"kind":"arxiv","id":"2401.11712","version":2},"attestation_state":"computed","paper":{"title":"A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chao Qian, Yanan Sun, Zeqiong Lv","submitted_at":"2024-01-22T06:29:22Z","abstract_excerpt":"Evolutionary neural architecture search (ENAS) employs evolutionary algorithms to find high-performing neural architectures automatically, and has achieved great success. However, compared to the empirical success, its rigorous theoretical analysis has yet to be touched. This work goes preliminary steps toward the mathematical runtime analysis of ENAS. In particular, we define a binary classification problem $\\textsc{UNIFORM}$, and formulate an explicit fitness function to represent the relationship between neural architecture and classification accuracy. Furthermore, we consider (1+1)-ENAS al"},"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":"2401.11712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-01-22T06:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"4edf50cb49644fa880cfcb138e620e748d273ca7f5bf62924733b3a454f67f51","abstract_canon_sha256":"decfebae67a4067cc6eb4b2cfefada707ff78dd7ead3b4ad13d2773fc8c584ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:09.543602Z","signature_b64":"8V3evuH5maiGFTmsSufrJJfkGb/JutMEybXu2vADe4hHtEpGf20hv2+5V3/+O0xpbG4f9Cr1lfckJpuBYD9gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada8a8565b7e330889a28e2872a16cf23601f12198331699ff50213d5c3ad2df","last_reissued_at":"2026-07-05T08:05:09.543123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:09.543123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chao Qian, Yanan Sun, Zeqiong Lv","submitted_at":"2024-01-22T06:29:22Z","abstract_excerpt":"Evolutionary neural architecture search (ENAS) employs evolutionary algorithms to find high-performing neural architectures automatically, and has achieved great success. However, compared to the empirical success, its rigorous theoretical analysis has yet to be touched. This work goes preliminary steps toward the mathematical runtime analysis of ENAS. In particular, we define a binary classification problem $\\textsc{UNIFORM}$, and formulate an explicit fitness function to represent the relationship between neural architecture and classification accuracy. Furthermore, we consider (1+1)-ENAS al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11712","kind":"arxiv","version":2},"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/2401.11712/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":"2401.11712","created_at":"2026-07-05T08:05:09.543177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11712v2","created_at":"2026-07-05T08:05:09.543177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11712","created_at":"2026-07-05T08:05:09.543177+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWUKQVS3PYZQ","created_at":"2026-07-05T08:05:09.543177+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWUKQVS3PYZQRCNC","created_at":"2026-07-05T08:05:09.543177+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWUKQVS3","created_at":"2026-07-05T08:05:09.543177+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06019","citing_title":"Runtime Analysis of Evolutionary NAS for Multiclass Classification","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I","json":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I.json","graph_json":"https://pith.science/api/pith-number/VWUKQVS3PYZQRCNCRYUHFILM6I/graph.json","events_json":"https://pith.science/api/pith-number/VWUKQVS3PYZQRCNCRYUHFILM6I/events.json","paper":"https://pith.science/paper/VWUKQVS3"},"agent_actions":{"view_html":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I","download_json":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I.json","view_paper":"https://pith.science/paper/VWUKQVS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11712&json=true","fetch_graph":"https://pith.science/api/pith-number/VWUKQVS3PYZQRCNCRYUHFILM6I/graph.json","fetch_events":"https://pith.science/api/pith-number/VWUKQVS3PYZQRCNCRYUHFILM6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I/action/storage_attestation","attest_author":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I/action/author_attestation","sign_citation":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I/action/citation_signature","submit_replication":"https://pith.science/pith/VWUKQVS3PYZQRCNCRYUHFILM6I/action/replication_record"}},"created_at":"2026-07-05T08:05:09.543177+00:00","updated_at":"2026-07-05T08:05:09.543177+00:00"}