{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K2XZIC5DIZSCWXIVFBTGQNUOQ6","short_pith_number":"pith:K2XZIC5D","canonical_record":{"source":{"id":"1902.07638","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T16:49:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5021ed344ecda4d058a338497b145e44e21dcb4ed92367abc84fad817731ab7f","abstract_canon_sha256":"1ab766d5b971c9999c86b66cc5afbdd32d7b0b83a993207fbe18a95cc326ca5d"},"schema_version":"1.0"},"canonical_sha256":"56af940ba346642b5d15286668368e87aa6961255396f8f7c97e1c7499bb1f26","source":{"kind":"arxiv","id":"1902.07638","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07638","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07638v3","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07638","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"K2XZIC5DIZSC","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_16","alias_value":"K2XZIC5DIZSCWXIV","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_8","alias_value":"K2XZIC5D","created_at":"2026-07-04T23:50:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K2XZIC5DIZSCWXIVFBTGQNUOQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07638","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T16:49:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5021ed344ecda4d058a338497b145e44e21dcb4ed92367abc84fad817731ab7f","abstract_canon_sha256":"1ab766d5b971c9999c86b66cc5afbdd32d7b0b83a993207fbe18a95cc326ca5d"},"schema_version":"1.0"},"canonical_sha256":"56af940ba346642b5d15286668368e87aa6961255396f8f7c97e1c7499bb1f26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:44.616122Z","signature_b64":"FVnaVLCwT7+1Pa9+saOTH2adOSZRoK9K0FAOpW5rd86mFZv899Rtyerv5hcTg781JLZmTblA/RNQ+mzYyO9EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56af940ba346642b5d15286668368e87aa6961255396f8f7c97e1c7499bb1f26","last_reissued_at":"2026-07-04T23:50:44.615645Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:44.615645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07638","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3452BEpymxI1wJ75EBMeMMWRlk8TY/+jwij+mG583aMfmqJdzuaZnXmbtUTxUS74vzGldC9xJALwjNh7758tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:27:17.660222Z"},"content_sha256":"28ea5b436586e13bb1f735d87854af75b6ebd3007a3d6ef42c21da09c6a56c52","schema_version":"1.0","event_id":"sha256:28ea5b436586e13bb1f735d87854af75b6ebd3007a3d6ef42c21da09c6a56c52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K2XZIC5DIZSCWXIVFBTGQNUOQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Search and Reproducibility for Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameet Talwalkar, Liam Li","submitted_at":"2019-02-20T16:49:07Z","abstract_excerpt":"Neural architecture search (NAS) is a promising research direction that has the potential to replace expert-designed networks with learned, task-specific architectures. In this work, in order to help ground the empirical results in this field, we propose new NAS baselines that build off the following observations: (i) NAS is a specialized hyperparameter optimization problem; and (ii) random search is a competitive baseline for hyperparameter optimization. Leveraging these observations, we evaluate both random search with early-stopping and a novel random search with weight-sharing algorithm on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07638","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/1902.07638/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENp9HJqA+uNxG9jwhL0ik7GsFcPN2vXpHfhb7wmws+SGBrkDScq3XM7udB+CmwYyd0u/rS/sjrna0TgfsQsgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:27:17.660766Z"},"content_sha256":"6ea6b9420f36652440dfe01de5d4a2103e61b88f75ab65617fb632247e93e81a","schema_version":"1.0","event_id":"sha256:6ea6b9420f36652440dfe01de5d4a2103e61b88f75ab65617fb632247e93e81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/bundle.json","state_url":"https://pith.science/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-01T09:27:17Z","links":{"resolver":"https://pith.science/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6","bundle":"https://pith.science/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/bundle.json","state":"https://pith.science/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2XZIC5DIZSCWXIVFBTGQNUOQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K2XZIC5DIZSCWXIVFBTGQNUOQ6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ab766d5b971c9999c86b66cc5afbdd32d7b0b83a993207fbe18a95cc326ca5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T16:49:07Z","title_canon_sha256":"5021ed344ecda4d058a338497b145e44e21dcb4ed92367abc84fad817731ab7f"},"schema_version":"1.0","source":{"id":"1902.07638","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07638","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07638v3","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07638","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"K2XZIC5DIZSC","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_16","alias_value":"K2XZIC5DIZSCWXIV","created_at":"2026-07-04T23:50:44Z"},{"alias_kind":"pith_short_8","alias_value":"K2XZIC5D","created_at":"2026-07-04T23:50:44Z"}],"graph_snapshots":[{"event_id":"sha256:6ea6b9420f36652440dfe01de5d4a2103e61b88f75ab65617fb632247e93e81a","target":"graph","created_at":"2026-07-04T23:50:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.07638/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural architecture search (NAS) is a promising research direction that has the potential to replace expert-designed networks with learned, task-specific architectures. In this work, in order to help ground the empirical results in this field, we propose new NAS baselines that build off the following observations: (i) NAS is a specialized hyperparameter optimization problem; and (ii) random search is a competitive baseline for hyperparameter optimization. Leveraging these observations, we evaluate both random search with early-stopping and a novel random search with weight-sharing algorithm on","authors_text":"Ameet Talwalkar, Liam Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T16:49:07Z","title":"Random Search and Reproducibility for Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07638","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28ea5b436586e13bb1f735d87854af75b6ebd3007a3d6ef42c21da09c6a56c52","target":"record","created_at":"2026-07-04T23:50:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ab766d5b971c9999c86b66cc5afbdd32d7b0b83a993207fbe18a95cc326ca5d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-20T16:49:07Z","title_canon_sha256":"5021ed344ecda4d058a338497b145e44e21dcb4ed92367abc84fad817731ab7f"},"schema_version":"1.0","source":{"id":"1902.07638","kind":"arxiv","version":3}},"canonical_sha256":"56af940ba346642b5d15286668368e87aa6961255396f8f7c97e1c7499bb1f26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56af940ba346642b5d15286668368e87aa6961255396f8f7c97e1c7499bb1f26","first_computed_at":"2026-07-04T23:50:44.615645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:44.615645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FVnaVLCwT7+1Pa9+saOTH2adOSZRoK9K0FAOpW5rd86mFZv899Rtyerv5hcTg781JLZmTblA/RNQ+mzYyO9EDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:44.616122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07638","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28ea5b436586e13bb1f735d87854af75b6ebd3007a3d6ef42c21da09c6a56c52","sha256:6ea6b9420f36652440dfe01de5d4a2103e61b88f75ab65617fb632247e93e81a"],"state_sha256":"3b61519ee3cd8628eecd088a84ae0b416d252ea05432ceda07c36cb88b5620fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIm27NKRgPogaL7nUVTMSj44QO6IgHsvU3y/+0uwQN66S/s/T+8pEXP9lKmWZqam2mN3nfEDeHDUu6ytXmTFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:27:17.665306Z","bundle_sha256":"809c31f2a347af76b0d73e26bfe31f6a4a08e792bfe49f8c3570f121fc5e476d"}}