{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UVE6MMZW5IVLZFE7X4BF5CILWN","short_pith_number":"pith:UVE6MMZW","schema_version":"1.0","canonical_sha256":"a549e63336ea2abc949fbf025e890bb36e9ddf11f38f8f173304bc79064ef2b9","source":{"kind":"arxiv","id":"2001.01233","version":2},"attestation_state":"computed","paper":{"title":"EcoNAS: Finding Proxies for Economical Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Dongzhan Zhou, Shuai Yi, Wanli Ouyang, Wenwei Zhang, Xinchi Zhou, Xuesen Zhang","submitted_at":"2020-01-05T13:29:02Z","abstract_excerpt":"Neural Architecture Search (NAS) achieves significant progress in many computer vision tasks. While many methods have been proposed to improve the efficiency of NAS, the search progress is still laborious because training and evaluating plausible architectures over large search space is time-consuming. Assessing network candidates under a proxy (i.e., computationally reduced setting) thus becomes inevitable. In this paper, we observe that most existing proxies exhibit different behaviors in maintaining the rank consistency among network candidates. In particular, some proxies can be more relia"},"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":"2001.01233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-01-05T13:29:02Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"826d9126aaf2fbcf33bb2934a1402821d41e6ded5fc44c948b935ad26fc5f276","abstract_canon_sha256":"070ebf94f25c66928594b1fcac8d2f5a07ea24d0b32fff572d918c98e2cdd9f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:07.541938Z","signature_b64":"6nSWEN7A4PaciJiySdw/9ge1fINNmJXCx/9LZpXDwukDYb1BExhGjOezb7ultcTadlrijR9jzWKW+xUL1RBYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a549e63336ea2abc949fbf025e890bb36e9ddf11f38f8f173304bc79064ef2b9","last_reissued_at":"2026-07-05T00:44:07.541460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:07.541460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EcoNAS: Finding Proxies for Economical Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Dongzhan Zhou, Shuai Yi, Wanli Ouyang, Wenwei Zhang, Xinchi Zhou, Xuesen Zhang","submitted_at":"2020-01-05T13:29:02Z","abstract_excerpt":"Neural Architecture Search (NAS) achieves significant progress in many computer vision tasks. While many methods have been proposed to improve the efficiency of NAS, the search progress is still laborious because training and evaluating plausible architectures over large search space is time-consuming. Assessing network candidates under a proxy (i.e., computationally reduced setting) thus becomes inevitable. In this paper, we observe that most existing proxies exhibit different behaviors in maintaining the rank consistency among network candidates. In particular, some proxies can be more relia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01233","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/2001.01233/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":"2001.01233","created_at":"2026-07-05T00:44:07.541520+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.01233v2","created_at":"2026-07-05T00:44:07.541520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01233","created_at":"2026-07-05T00:44:07.541520+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVE6MMZW5IVL","created_at":"2026-07-05T00:44:07.541520+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVE6MMZW5IVLZFE7","created_at":"2026-07-05T00:44:07.541520+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVE6MMZW","created_at":"2026-07-05T00:44:07.541520+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/UVE6MMZW5IVLZFE7X4BF5CILWN","json":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN.json","graph_json":"https://pith.science/api/pith-number/UVE6MMZW5IVLZFE7X4BF5CILWN/graph.json","events_json":"https://pith.science/api/pith-number/UVE6MMZW5IVLZFE7X4BF5CILWN/events.json","paper":"https://pith.science/paper/UVE6MMZW"},"agent_actions":{"view_html":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN","download_json":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN.json","view_paper":"https://pith.science/paper/UVE6MMZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.01233&json=true","fetch_graph":"https://pith.science/api/pith-number/UVE6MMZW5IVLZFE7X4BF5CILWN/graph.json","fetch_events":"https://pith.science/api/pith-number/UVE6MMZW5IVLZFE7X4BF5CILWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN/action/storage_attestation","attest_author":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN/action/author_attestation","sign_citation":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN/action/citation_signature","submit_replication":"https://pith.science/pith/UVE6MMZW5IVLZFE7X4BF5CILWN/action/replication_record"}},"created_at":"2026-07-05T00:44:07.541520+00:00","updated_at":"2026-07-05T00:44:07.541520+00:00"}