{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QLQKZD7CEY4NQPLKGTTMHROYHV","short_pith_number":"pith:QLQKZD7C","schema_version":"1.0","canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","source":{"kind":"arxiv","id":"1904.02877","version":1},"attestation_state":"computed","paper":{"title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bodhi Priyantha, Diana Marculescu, Dimitrios Lymberopoulos, Dimitrios Stamoulis, Di Wang, Jie Liu, Ruizhou Ding","submitted_at":"2019-04-05T05:49:41Z","abstract_excerpt":"Can we automatically design a Convolutional Network (ConvNet) with the highest image classification accuracy under the runtime constraint of a mobile device? Neural architecture search (NAS) has revolutionized the design of hardware-efficient ConvNets by automating this process. However, the NAS problem remains challenging due to the combinatorially large design space, causing a significant searching time (at least 200 GPU-hours). To alleviate this complexity, we propose Single-Path NAS, a novel differentiable NAS method for designing hardware-efficient ConvNets in less than 4 hours. Our contr"},"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":"1904.02877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-05T05:49:41Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"63995f2fb06e178ff69a6e0468609d12018c653c02bf30990a3989c46743a0a0","abstract_canon_sha256":"ddea13917a70c7f93ccf6615941a30bd27e1e9cf043aa23039d028a58aef4705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.363884Z","signature_b64":"pSSIuuc7O/D4QJzf4ZQ2fNiTSFyKKqQrssiQv8qeR+zF99KAXwe+mfaidrIY4gaDkf0cM4nDi9LM783Xy3bCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","last_reissued_at":"2026-05-17T23:49:19.363255Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.363255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bodhi Priyantha, Diana Marculescu, Dimitrios Lymberopoulos, Dimitrios Stamoulis, Di Wang, Jie Liu, Ruizhou Ding","submitted_at":"2019-04-05T05:49:41Z","abstract_excerpt":"Can we automatically design a Convolutional Network (ConvNet) with the highest image classification accuracy under the runtime constraint of a mobile device? Neural architecture search (NAS) has revolutionized the design of hardware-efficient ConvNets by automating this process. However, the NAS problem remains challenging due to the combinatorially large design space, causing a significant searching time (at least 200 GPU-hours). To alleviate this complexity, we propose Single-Path NAS, a novel differentiable NAS method for designing hardware-efficient ConvNets in less than 4 hours. Our contr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02877","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":""},"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":"1904.02877","created_at":"2026-05-17T23:49:19.363359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02877v1","created_at":"2026-05-17T23:49:19.363359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02877","created_at":"2026-05-17T23:49:19.363359+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLQKZD7CEY4N","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLQKZD7CEY4NQPLK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLQKZD7C","created_at":"2026-05-18T12:33:27.125529+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/QLQKZD7CEY4NQPLKGTTMHROYHV","json":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV.json","graph_json":"https://pith.science/api/pith-number/QLQKZD7CEY4NQPLKGTTMHROYHV/graph.json","events_json":"https://pith.science/api/pith-number/QLQKZD7CEY4NQPLKGTTMHROYHV/events.json","paper":"https://pith.science/paper/1904.02877"},"agent_actions":{"view_html":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV","download_json":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV.json","view_paper":"https://pith.science/paper/1904.02877","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02877&json=true","fetch_graph":"https://pith.science/api/pith-number/QLQKZD7CEY4NQPLKGTTMHROYHV/graph.json","fetch_events":"https://pith.science/api/pith-number/QLQKZD7CEY4NQPLKGTTMHROYHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/action/storage_attestation","attest_author":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/action/author_attestation","sign_citation":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/action/citation_signature","submit_replication":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/action/replication_record"}},"created_at":"2026-05-17T23:49:19.363359+00:00","updated_at":"2026-05-17T23:49:19.363359+00:00"}