{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S43VLRKWXXNCNNBVSQXKIVZKFT","short_pith_number":"pith:S43VLRKW","canonical_record":{"source":{"id":"1905.04159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-10T13:23:48Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"d34f39d7e5a0a01f98f1906d12c03409ff293ab74449eb81e43cbd7ee9342efe","abstract_canon_sha256":"01342a5085d06720ad2c1db3d897f4ebb1d0eeea9f9bb782b5c3c931399354c5"},"schema_version":"1.0"},"canonical_sha256":"973755c556bdda26b435942ea4572a2cc1306d11f2c4465e94e67c2157906a35","source":{"kind":"arxiv","id":"1905.04159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04159","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04159v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04159","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"S43VLRKWXXNC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S43VLRKWXXNCNNBV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S43VLRKW","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S43VLRKWXXNCNNBVSQXKIVZKFT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-10T13:23:48Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"d34f39d7e5a0a01f98f1906d12c03409ff293ab74449eb81e43cbd7ee9342efe","abstract_canon_sha256":"01342a5085d06720ad2c1db3d897f4ebb1d0eeea9f9bb782b5c3c931399354c5"},"schema_version":"1.0"},"canonical_sha256":"973755c556bdda26b435942ea4572a2cc1306d11f2c4465e94e67c2157906a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.360535Z","signature_b64":"L872ACwggrLjZ8vBZnTS8a/IEvbIy18fnpzw1ZnogdY3ERuWGlNEiGrpo9kcr1RxcI6BL/jAGr/Om5aKe8MrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973755c556bdda26b435942ea4572a2cc1306d11f2c4465e94e67c2157906a35","last_reissued_at":"2026-05-17T23:46:34.360006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.360006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04159","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:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkyDB4jT6pk7DeH9TtII+5H3ANg+aHybWZASKVnMdsDx9KhWCs9GCi0jKwAEteEj3TQc3+guU9UdC8o01Rp9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:40:24.970286Z"},"content_sha256":"6439b63c51210ea21a915cac087fe48830e7eb1a8ca254a9eb73733ec1c7946e","schema_version":"1.0","event_id":"sha256:6439b63c51210ea21a915cac087fe48830e7eb1a8ca254a9eb73733ec1c7946e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S43VLRKWXXNCNNBVSQXKIVZKFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single-Path NAS: Device-Aware Efficient ConvNet Design","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-05-10T13:23:48Z","abstract_excerpt":"Can we automatically design a Convolutional Network (ConvNet) with the highest image classification accuracy under the latency constraint of a mobile device? Neural Architecture Search (NAS) for ConvNet design is a challenging problem due to the combinatorially large design space and search time (at least 200 GPU-hours). To alleviate this complexity, we propose Single-Path NAS, a novel differentiable NAS method for designing device-efficient ConvNets in less than 4 hours. 1. Novel NAS formulation: our method introduces a single-path, over-parameterized ConvNet to encode all architectural decis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04159","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:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNcq/fbZ2ssok3hm8LxiQGOZdj1E1S2qcnk6vVCYtLDSNiiXXZ3uYJN13tHALMhmAZimmoBumcyRF8ImjF3rBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:40:24.971008Z"},"content_sha256":"567f6fdf1f33cf57b050c9665d08d71cb6b13899004219db1e179ad6e574bcc3","schema_version":"1.0","event_id":"sha256:567f6fdf1f33cf57b050c9665d08d71cb6b13899004219db1e179ad6e574bcc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/bundle.json","state_url":"https://pith.science/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/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-05-25T23:40:24Z","links":{"resolver":"https://pith.science/pith/S43VLRKWXXNCNNBVSQXKIVZKFT","bundle":"https://pith.science/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/bundle.json","state":"https://pith.science/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S43VLRKWXXNCNNBVSQXKIVZKFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S43VLRKWXXNCNNBVSQXKIVZKFT","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":"01342a5085d06720ad2c1db3d897f4ebb1d0eeea9f9bb782b5c3c931399354c5","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-10T13:23:48Z","title_canon_sha256":"d34f39d7e5a0a01f98f1906d12c03409ff293ab74449eb81e43cbd7ee9342efe"},"schema_version":"1.0","source":{"id":"1905.04159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04159","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04159v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04159","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"S43VLRKWXXNC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S43VLRKWXXNCNNBV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S43VLRKW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:567f6fdf1f33cf57b050c9665d08d71cb6b13899004219db1e179ad6e574bcc3","target":"graph","created_at":"2026-05-17T23:46:34Z","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 latency constraint of a mobile device? Neural Architecture Search (NAS) for ConvNet design is a challenging problem due to the combinatorially large design space and search time (at least 200 GPU-hours). To alleviate this complexity, we propose Single-Path NAS, a novel differentiable NAS method for designing device-efficient ConvNets in less than 4 hours. 1. Novel NAS formulation: our method introduces a single-path, over-parameterized ConvNet to encode all architectural decis","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-05-10T13:23:48Z","title":"Single-Path NAS: Device-Aware Efficient ConvNet Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04159","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:6439b63c51210ea21a915cac087fe48830e7eb1a8ca254a9eb73733ec1c7946e","target":"record","created_at":"2026-05-17T23:46:34Z","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":"01342a5085d06720ad2c1db3d897f4ebb1d0eeea9f9bb782b5c3c931399354c5","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-10T13:23:48Z","title_canon_sha256":"d34f39d7e5a0a01f98f1906d12c03409ff293ab74449eb81e43cbd7ee9342efe"},"schema_version":"1.0","source":{"id":"1905.04159","kind":"arxiv","version":1}},"canonical_sha256":"973755c556bdda26b435942ea4572a2cc1306d11f2c4465e94e67c2157906a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973755c556bdda26b435942ea4572a2cc1306d11f2c4465e94e67c2157906a35","first_computed_at":"2026-05-17T23:46:34.360006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:34.360006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L872ACwggrLjZ8vBZnTS8a/IEvbIy18fnpzw1ZnogdY3ERuWGlNEiGrpo9kcr1RxcI6BL/jAGr/Om5aKe8MrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:34.360535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6439b63c51210ea21a915cac087fe48830e7eb1a8ca254a9eb73733ec1c7946e","sha256:567f6fdf1f33cf57b050c9665d08d71cb6b13899004219db1e179ad6e574bcc3"],"state_sha256":"c7a0101f07d5148d10806866a9da92ab6663ba67a325c5116092dbaf7822f8f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3JpKWwxG+g1TKnfKsAHCg5rJzu7G65oQDHqYNLD3kQWCG8r3EFM6KrWjhNLmTi28P5OQlQv+HGbHrDgWZc4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:40:24.974619Z","bundle_sha256":"e5fdfa0caa5ce3b0f973cf44754ae8bc3f9dada921e8614981bfe909de4c4573"}}