{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:77AIW4VPVKKQ6BHXUN6X6DQQFF","short_pith_number":"pith:77AIW4VP","schema_version":"1.0","canonical_sha256":"ffc08b72afaa950f04f7a37d7f0e10294bbf31dc50e6c7e20798f8cc7df7bdb5","source":{"kind":"arxiv","id":"1907.00959","version":1},"attestation_state":"computed","paper":{"title":"Single-Path Mobile AutoML: Efficient ConvNet Design and NAS Hyperparameter Optimization","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-07-01T17:52:55Z","abstract_excerpt":"Can we reduce the search cost of Neural Architecture Search (NAS) from days down to only few hours? NAS methods automate the design of Convolutional Networks (ConvNets) under hardware constraints and they have emerged as key components of AutoML frameworks. However, the NAS problem remains challenging due to the combinatorially large design space and the significant search time (at least 200 GPU-hours). In this work, we alleviate the NAS search cost down to less than 3 hours, while achieving state-of-the-art image classification results under mobile latency constraints. We propose a novel diff"},"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":"1907.00959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-01T17:52:55Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"6a2c10c12bc7db763e832ca3f03ebbe12afc843731c956508da167a598aa585f","abstract_canon_sha256":"835581af1873c40b24366588e07943a0b520decb2be0119070e4a1946ddb8627"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:51.356272Z","signature_b64":"dRGvYh3O+Z/xcqCoj8BZIiP2ryb5HTnOO1ZZBa6uXLZ4j2NlvZKEyjzroC3OsKTF5ctkUVe7URcQG1Dp+VarDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc08b72afaa950f04f7a37d7f0e10294bbf31dc50e6c7e20798f8cc7df7bdb5","last_reissued_at":"2026-07-05T06:31:51.355856Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:51.355856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Path Mobile AutoML: Efficient ConvNet Design and NAS Hyperparameter Optimization","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-07-01T17:52:55Z","abstract_excerpt":"Can we reduce the search cost of Neural Architecture Search (NAS) from days down to only few hours? NAS methods automate the design of Convolutional Networks (ConvNets) under hardware constraints and they have emerged as key components of AutoML frameworks. However, the NAS problem remains challenging due to the combinatorially large design space and the significant search time (at least 200 GPU-hours). In this work, we alleviate the NAS search cost down to less than 3 hours, while achieving state-of-the-art image classification results under mobile latency constraints. We propose a novel diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00959","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/1907.00959/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":"1907.00959","created_at":"2026-07-05T06:31:51.355919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00959v1","created_at":"2026-07-05T06:31:51.355919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00959","created_at":"2026-07-05T06:31:51.355919+00:00"},{"alias_kind":"pith_short_12","alias_value":"77AIW4VPVKKQ","created_at":"2026-07-05T06:31:51.355919+00:00"},{"alias_kind":"pith_short_16","alias_value":"77AIW4VPVKKQ6BHX","created_at":"2026-07-05T06:31:51.355919+00:00"},{"alias_kind":"pith_short_8","alias_value":"77AIW4VP","created_at":"2026-07-05T06:31:51.355919+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/77AIW4VPVKKQ6BHXUN6X6DQQFF","json":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF.json","graph_json":"https://pith.science/api/pith-number/77AIW4VPVKKQ6BHXUN6X6DQQFF/graph.json","events_json":"https://pith.science/api/pith-number/77AIW4VPVKKQ6BHXUN6X6DQQFF/events.json","paper":"https://pith.science/paper/77AIW4VP"},"agent_actions":{"view_html":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF","download_json":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF.json","view_paper":"https://pith.science/paper/77AIW4VP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00959&json=true","fetch_graph":"https://pith.science/api/pith-number/77AIW4VPVKKQ6BHXUN6X6DQQFF/graph.json","fetch_events":"https://pith.science/api/pith-number/77AIW4VPVKKQ6BHXUN6X6DQQFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF/action/storage_attestation","attest_author":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF/action/author_attestation","sign_citation":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF/action/citation_signature","submit_replication":"https://pith.science/pith/77AIW4VPVKKQ6BHXUN6X6DQQFF/action/replication_record"}},"created_at":"2026-07-05T06:31:51.355919+00:00","updated_at":"2026-07-05T06:31:51.355919+00:00"}