{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:W3VX5F2ATQCVVMD32SONLZT6VO","short_pith_number":"pith:W3VX5F2A","schema_version":"1.0","canonical_sha256":"b6eb7e97409c055ab07bd49cd5e67eab9c1d0e5329f1175fce9f90e6d90c103c","source":{"kind":"arxiv","id":"2007.03331","version":1},"attestation_state":"computed","paper":{"title":"GOLD-NAS: Gradual, One-Level, Differentiable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Kaifeng Bi, Lingxi Xie, Longhui Wei, Qi Tian, Xin Chen","submitted_at":"2020-07-07T10:37:49Z","abstract_excerpt":"There has been a large literature of neural architecture search, but most existing work made use of heuristic rules that largely constrained the search flexibility. In this paper, we first relax these manually designed constraints and enlarge the search space to contain more than $10^{160}$ candidates. In the new space, most existing differentiable search methods can fail dramatically. We then propose a novel algorithm named Gradual One-Level Differentiable Neural Architecture Search (GOLD-NAS) which introduces a variable resource constraint to one-level optimization so that the weak operators"},"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":"2007.03331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-07-07T10:37:49Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"f256fbd2f72fdf8ba6f102ca6c090fc6102b6c7f5843edd1deee63f52c0c6c18","abstract_canon_sha256":"c5263c8045ccc06ca0225bd9a6c926083cf7a8d5f085f443ccfac61e66bb0b9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:01.964438Z","signature_b64":"GONf3Jx2t+pMx6Z6LEJsaPZC6vZGZ6uMf0bI0D4YISAW+7wUjyxVJBQaeeE8P/CjgTqBHkMEHaPmNLCwK28bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6eb7e97409c055ab07bd49cd5e67eab9c1d0e5329f1175fce9f90e6d90c103c","last_reissued_at":"2026-07-05T01:17:01.964004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:01.964004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GOLD-NAS: Gradual, One-Level, Differentiable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Kaifeng Bi, Lingxi Xie, Longhui Wei, Qi Tian, Xin Chen","submitted_at":"2020-07-07T10:37:49Z","abstract_excerpt":"There has been a large literature of neural architecture search, but most existing work made use of heuristic rules that largely constrained the search flexibility. In this paper, we first relax these manually designed constraints and enlarge the search space to contain more than $10^{160}$ candidates. In the new space, most existing differentiable search methods can fail dramatically. We then propose a novel algorithm named Gradual One-Level Differentiable Neural Architecture Search (GOLD-NAS) which introduces a variable resource constraint to one-level optimization so that the weak operators"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03331","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/2007.03331/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":"2007.03331","created_at":"2026-07-05T01:17:01.964080+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03331v1","created_at":"2026-07-05T01:17:01.964080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03331","created_at":"2026-07-05T01:17:01.964080+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3VX5F2ATQCV","created_at":"2026-07-05T01:17:01.964080+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3VX5F2ATQCVVMD3","created_at":"2026-07-05T01:17:01.964080+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3VX5F2A","created_at":"2026-07-05T01:17:01.964080+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO","json":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO.json","graph_json":"https://pith.science/api/pith-number/W3VX5F2ATQCVVMD32SONLZT6VO/graph.json","events_json":"https://pith.science/api/pith-number/W3VX5F2ATQCVVMD32SONLZT6VO/events.json","paper":"https://pith.science/paper/W3VX5F2A"},"agent_actions":{"view_html":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO","download_json":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO.json","view_paper":"https://pith.science/paper/W3VX5F2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03331&json=true","fetch_graph":"https://pith.science/api/pith-number/W3VX5F2ATQCVVMD32SONLZT6VO/graph.json","fetch_events":"https://pith.science/api/pith-number/W3VX5F2ATQCVVMD32SONLZT6VO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO/action/storage_attestation","attest_author":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO/action/author_attestation","sign_citation":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO/action/citation_signature","submit_replication":"https://pith.science/pith/W3VX5F2ATQCVVMD32SONLZT6VO/action/replication_record"}},"created_at":"2026-07-05T01:17:01.964080+00:00","updated_at":"2026-07-05T01:17:01.964080+00:00"}