{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HB4H6U57AKEYQD723E3Z5MXDZY","short_pith_number":"pith:HB4H6U57","schema_version":"1.0","canonical_sha256":"38787f53bf0289880ffad9379eb2e3ce3441a659a11a8855184ac8f171c615b1","source":{"kind":"arxiv","id":"1912.06059","version":1},"attestation_state":"computed","paper":{"title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Pavlo Liashchynskyi, Petro Liashchynskyi","submitted_at":"2019-12-12T16:07:20Z","abstract_excerpt":"In this paper, we compare the three most popular algorithms for hyperparameter optimization (Grid Search, Random Search, and Genetic Algorithm) and attempt to use them for neural architecture search (NAS). We use these algorithms for building a convolutional neural network (search architecture). Experimental results on CIFAR-10 dataset further demonstrate the performance difference between compared algorithms. The comparison results are based on the execution time of the above algorithms and accuracy of the proposed models."},"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":"1912.06059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-12T16:07:20Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"2c3f5266a43a12f9beacfa904928d16952a40e1c166137314bf9b9c766a56f5d","abstract_canon_sha256":"6c256c675d5c9d03f9db62acb10563beb6cda4ced83649a1ab8607f87ad49abf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:51.314469Z","signature_b64":"UMO5Ps7cY3OSHIUWLh5ZLn5ULdCa9Ag2aV2T1K6ilA55op2K36Iv40DYgFQzWDOvPYnz7FUiLXwpHEpKmnyTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38787f53bf0289880ffad9379eb2e3ce3441a659a11a8855184ac8f171c615b1","last_reissued_at":"2026-07-05T00:25:51.313973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:51.313973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Pavlo Liashchynskyi, Petro Liashchynskyi","submitted_at":"2019-12-12T16:07:20Z","abstract_excerpt":"In this paper, we compare the three most popular algorithms for hyperparameter optimization (Grid Search, Random Search, and Genetic Algorithm) and attempt to use them for neural architecture search (NAS). We use these algorithms for building a convolutional neural network (search architecture). Experimental results on CIFAR-10 dataset further demonstrate the performance difference between compared algorithms. The comparison results are based on the execution time of the above algorithms and accuracy of the proposed models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06059","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/1912.06059/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":"1912.06059","created_at":"2026-07-05T00:25:51.314043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06059v1","created_at":"2026-07-05T00:25:51.314043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06059","created_at":"2026-07-05T00:25:51.314043+00:00"},{"alias_kind":"pith_short_12","alias_value":"HB4H6U57AKEY","created_at":"2026-07-05T00:25:51.314043+00:00"},{"alias_kind":"pith_short_16","alias_value":"HB4H6U57AKEYQD72","created_at":"2026-07-05T00:25:51.314043+00:00"},{"alias_kind":"pith_short_8","alias_value":"HB4H6U57","created_at":"2026-07-05T00:25:51.314043+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08311","citing_title":"Curation of a Cardiology Interface Terminology for Highlighting Electronic Health Records using Machine Learning","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2510.14235","citing_title":"Spiking Neural Network Architecture Search: A Survey","ref_index":115,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02043","citing_title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02043","citing_title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY","json":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY.json","graph_json":"https://pith.science/api/pith-number/HB4H6U57AKEYQD723E3Z5MXDZY/graph.json","events_json":"https://pith.science/api/pith-number/HB4H6U57AKEYQD723E3Z5MXDZY/events.json","paper":"https://pith.science/paper/HB4H6U57"},"agent_actions":{"view_html":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY","download_json":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY.json","view_paper":"https://pith.science/paper/HB4H6U57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06059&json=true","fetch_graph":"https://pith.science/api/pith-number/HB4H6U57AKEYQD723E3Z5MXDZY/graph.json","fetch_events":"https://pith.science/api/pith-number/HB4H6U57AKEYQD723E3Z5MXDZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY/action/storage_attestation","attest_author":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY/action/author_attestation","sign_citation":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY/action/citation_signature","submit_replication":"https://pith.science/pith/HB4H6U57AKEYQD723E3Z5MXDZY/action/replication_record"}},"created_at":"2026-07-05T00:25:51.314043+00:00","updated_at":"2026-07-05T00:25:51.314043+00:00"}