{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QLQKZD7CEY4NQPLKGTTMHROYHV","short_pith_number":"pith:QLQKZD7C","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"},"canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","source":{"kind":"arxiv","id":"1904.02877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02877","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02877v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02877","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"QLQKZD7CEY4N","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLQKZD7CEY4NQPLK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLQKZD7C","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QLQKZD7CEY4NQPLKGTTMHROYHV","target":"record","payload":{"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"},"canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","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"},"source_kind":"arxiv","source_id":"1904.02877","source_version":1,"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-05-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWbh9QZ5FQalECs5oIbv3HE/KNe3tCFU9DN3BmqC4WWnzm4+1m9EaE27cfbf9qfqdZv0vUBADRxAfMKYxATFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:29:50.920752Z"},"content_sha256":"9d246f1ee743e470d5e3e0acb904be5c0e37b451f3f0bda89f1d97740c57b7d9","schema_version":"1.0","event_id":"sha256:9d246f1ee743e470d5e3e0acb904be5c0e37b451f3f0bda89f1d97740c57b7d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QLQKZD7CEY4NQPLKGTTMHROYHV","target":"graph","payload":{"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"},"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-05-17T23:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1Mdkqu2y8OyhIquYIIxuigLYpMGz69Qpag+yQ01xXaLGZ9hCYMmT5JWhxUgnMwwZbaJb2Ra7r3tDwpuYapQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:29:50.921475Z"},"content_sha256":"43c4869572711529a049cad9797837d6d8f38c2283e3bfddfb9a6e08c525f20b","schema_version":"1.0","event_id":"sha256:43c4869572711529a049cad9797837d6d8f38c2283e3bfddfb9a6e08c525f20b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/bundle.json","state_url":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/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-06-06T21:29:50Z","links":{"resolver":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV","bundle":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/bundle.json","state":"https://pith.science/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLQKZD7CEY4NQPLKGTTMHROYHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QLQKZD7CEY4NQPLKGTTMHROYHV","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":"ddea13917a70c7f93ccf6615941a30bd27e1e9cf043aa23039d028a58aef4705","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-05T05:49:41Z","title_canon_sha256":"63995f2fb06e178ff69a6e0468609d12018c653c02bf30990a3989c46743a0a0"},"schema_version":"1.0","source":{"id":"1904.02877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02877","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02877v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02877","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"QLQKZD7CEY4N","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QLQKZD7CEY4NQPLK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QLQKZD7C","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:43c4869572711529a049cad9797837d6d8f38c2283e3bfddfb9a6e08c525f20b","target":"graph","created_at":"2026-05-17T23:49:19Z","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"},"paper":{"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","authors_text":"Bodhi Priyantha, Diana Marculescu, Dimitrios Lymberopoulos, Dimitrios Stamoulis, Di Wang, Jie Liu, Ruizhou Ding","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-05T05:49:41Z","title":"Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02877","kind":"arxiv","version":1},"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:9d246f1ee743e470d5e3e0acb904be5c0e37b451f3f0bda89f1d97740c57b7d9","target":"record","created_at":"2026-05-17T23:49:19Z","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":"ddea13917a70c7f93ccf6615941a30bd27e1e9cf043aa23039d028a58aef4705","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-05T05:49:41Z","title_canon_sha256":"63995f2fb06e178ff69a6e0468609d12018c653c02bf30990a3989c46743a0a0"},"schema_version":"1.0","source":{"id":"1904.02877","kind":"arxiv","version":1}},"canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82e0ac8fe22638d83d6a34e6c3c5d83d4e96cc0e66609fe49c7698cca3644569","first_computed_at":"2026-05-17T23:49:19.363255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:19.363255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pSSIuuc7O/D4QJzf4ZQ2fNiTSFyKKqQrssiQv8qeR+zF99KAXwe+mfaidrIY4gaDkf0cM4nDi9LM783Xy3bCBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:19.363884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d246f1ee743e470d5e3e0acb904be5c0e37b451f3f0bda89f1d97740c57b7d9","sha256:43c4869572711529a049cad9797837d6d8f38c2283e3bfddfb9a6e08c525f20b"],"state_sha256":"d8763aab667b64439da07a39a43681725bb245a70854ff0bcd448c6fbee3f1ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcAQuQJsKIRue9Zu5pGT6FE0H9+GTtDfDlKbPo28KT8zZ7abxea7S3zBThjkd18VTrCoC79emoOT10Z6QUVJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:29:50.924951Z","bundle_sha256":"2a06c69d48d7f540dd06a89d32fd2d7ab2b5f6edd8f14cc8aae189de13d8c74a"}}