{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V3EGGQBMIY77QTELYVXPUO7KHU","short_pith_number":"pith:V3EGGQBM","canonical_record":{"source":{"id":"1812.03443","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-09T08:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"12edb0074a905a9c340040a94f34aee2eb7c1ba8ab811b2b1648836f39840917","abstract_canon_sha256":"361cbb46d537606161193856fc7c62d8869a37c9df6bfc5335c8318e26cd914e"},"schema_version":"1.0"},"canonical_sha256":"aec863402c463ff84c8bc56efa3bea3d1c7ca7683871cc3e5901d9c22c01a12f","source":{"kind":"arxiv","id":"1812.03443","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03443","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03443v3","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03443","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"V3EGGQBMIY77","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V3EGGQBMIY77QTEL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V3EGGQBM","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V3EGGQBMIY77QTELYVXPUO7KHU","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03443","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-09T08:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"12edb0074a905a9c340040a94f34aee2eb7c1ba8ab811b2b1648836f39840917","abstract_canon_sha256":"361cbb46d537606161193856fc7c62d8869a37c9df6bfc5335c8318e26cd914e"},"schema_version":"1.0"},"canonical_sha256":"aec863402c463ff84c8bc56efa3bea3d1c7ca7683871cc3e5901d9c22c01a12f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.129961Z","signature_b64":"c7Nvx1m6lZtZlsNmGuxqZqCf4rhXUFPwePPmfLG9gqbj042cugbF72f2lg5xr6Hteo1faDkgr8d7LxbeJC77AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aec863402c463ff84c8bc56efa3bea3d1c7ca7683871cc3e5901d9c22c01a12f","last_reissued_at":"2026-05-17T23:45:15.129536Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.129536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03443","source_version":3,"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nInu1+ijrmS1euyQ3bCacv7YGEIDo3bONY8O2/UgNmbYpVq5WbtEKjFJzMJ0SKM2EiH7e9mGduVkSnG0nYSVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:12.247150Z"},"content_sha256":"44740cf0bc4e866c3991c13b658c112918dd089bb9ed23231173cd4c6239fa3e","schema_version":"1.0","event_id":"sha256:44740cf0bc4e866c3991c13b658c112918dd089bb9ed23231173cd4c6239fa3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V3EGGQBMIY77QTELYVXPUO7KHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bichen Wu, Fei Sun, Kurt Keutzer, Peizhao Zhang, Peter Vajda, Xiaoliang Dai, Yanghan Wang, Yangqing Jia, Yiming Wu, Yuandong Tian","submitted_at":"2018-12-09T08:24:50Z","abstract_excerpt":"Designing accurate and efficient ConvNets for mobile devices is challenging because the design space is combinatorially large. Due to this, previous neural architecture search (NAS) methods are computationally expensive. ConvNet architecture optimality depends on factors such as input resolution and target devices. However, existing approaches are too expensive for case-by-case redesigns. Also, previous work focuses primarily on reducing FLOPs, but FLOP count does not always reflect actual latency. To address these, we propose a differentiable neural architecture search (DNAS) framework that u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03443","kind":"arxiv","version":3},"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKVzWBdjJj6J881rSZ3S7WoR4DCiJat97Ve4WdqENKjZBWhyamtAmTD3mtX98QdrrNRYyEDze5YHg9YZdsRJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:12.247825Z"},"content_sha256":"ad6d98da39d61c97f1deb961d2634fd37a5c310ceab31ae6f7e38ef198957fdd","schema_version":"1.0","event_id":"sha256:ad6d98da39d61c97f1deb961d2634fd37a5c310ceab31ae6f7e38ef198957fdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3EGGQBMIY77QTELYVXPUO7KHU/bundle.json","state_url":"https://pith.science/pith/V3EGGQBMIY77QTELYVXPUO7KHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3EGGQBMIY77QTELYVXPUO7KHU/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-27T00:45:12Z","links":{"resolver":"https://pith.science/pith/V3EGGQBMIY77QTELYVXPUO7KHU","bundle":"https://pith.science/pith/V3EGGQBMIY77QTELYVXPUO7KHU/bundle.json","state":"https://pith.science/pith/V3EGGQBMIY77QTELYVXPUO7KHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3EGGQBMIY77QTELYVXPUO7KHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V3EGGQBMIY77QTELYVXPUO7KHU","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":"361cbb46d537606161193856fc7c62d8869a37c9df6bfc5335c8318e26cd914e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-09T08:24:50Z","title_canon_sha256":"12edb0074a905a9c340040a94f34aee2eb7c1ba8ab811b2b1648836f39840917"},"schema_version":"1.0","source":{"id":"1812.03443","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03443","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03443v3","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03443","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"V3EGGQBMIY77","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"V3EGGQBMIY77QTEL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"V3EGGQBM","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:ad6d98da39d61c97f1deb961d2634fd37a5c310ceab31ae6f7e38ef198957fdd","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"Designing accurate and efficient ConvNets for mobile devices is challenging because the design space is combinatorially large. Due to this, previous neural architecture search (NAS) methods are computationally expensive. ConvNet architecture optimality depends on factors such as input resolution and target devices. However, existing approaches are too expensive for case-by-case redesigns. Also, previous work focuses primarily on reducing FLOPs, but FLOP count does not always reflect actual latency. To address these, we propose a differentiable neural architecture search (DNAS) framework that u","authors_text":"Bichen Wu, Fei Sun, Kurt Keutzer, Peizhao Zhang, Peter Vajda, Xiaoliang Dai, Yanghan Wang, Yangqing Jia, Yiming Wu, Yuandong Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-09T08:24:50Z","title":"FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03443","kind":"arxiv","version":3},"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:44740cf0bc4e866c3991c13b658c112918dd089bb9ed23231173cd4c6239fa3e","target":"record","created_at":"2026-05-17T23:45:15Z","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":"361cbb46d537606161193856fc7c62d8869a37c9df6bfc5335c8318e26cd914e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-09T08:24:50Z","title_canon_sha256":"12edb0074a905a9c340040a94f34aee2eb7c1ba8ab811b2b1648836f39840917"},"schema_version":"1.0","source":{"id":"1812.03443","kind":"arxiv","version":3}},"canonical_sha256":"aec863402c463ff84c8bc56efa3bea3d1c7ca7683871cc3e5901d9c22c01a12f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aec863402c463ff84c8bc56efa3bea3d1c7ca7683871cc3e5901d9c22c01a12f","first_computed_at":"2026-05-17T23:45:15.129536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.129536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c7Nvx1m6lZtZlsNmGuxqZqCf4rhXUFPwePPmfLG9gqbj042cugbF72f2lg5xr6Hteo1faDkgr8d7LxbeJC77AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.129961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03443","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44740cf0bc4e866c3991c13b658c112918dd089bb9ed23231173cd4c6239fa3e","sha256:ad6d98da39d61c97f1deb961d2634fd37a5c310ceab31ae6f7e38ef198957fdd"],"state_sha256":"e29885b50b368b92a7a93574e770a91355cb49b9f44195dcf9d672ea2f288974"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZF0/y4L7VDhuA8Kyiex2VKSnrzMOpN6akDS6WN6gScVlf/6Hwq1X4J6+EoimQlSkvALRUxCXYZqelvwch3CCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:45:12.251016Z","bundle_sha256":"d0a0a8dc7603a80117a9a568cc55a0058b1efdb9f45d382c412e8147628cd619"}}