{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZNKLJMOQCKWCKGYO6MAXGGR657","short_pith_number":"pith:ZNKLJMOQ","schema_version":"1.0","canonical_sha256":"cb54b4b1d012ac251b0ef301731a3eefee759c8d48ae9aba6bb447c36ea34883","source":{"kind":"arxiv","id":"1905.02244","version":5},"attestation_state":"computed","paper":{"title":"Searching for MobileNetV3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew Howard, Bo Chen, Grace Chu, Hartwig Adam, Liang-Chieh Chen, Mark Sandler, Mingxing Tan, Quoc V. Le, Ruoming Pang, Vijay Vasudevan, Weijun Wang, Yukun Zhu","submitted_at":"2019-05-06T19:38:31Z","abstract_excerpt":"We present the next generation of MobileNets based on a combination of complementary search techniques as well as a novel architecture design. MobileNetV3 is tuned to mobile phone CPUs through a combination of hardware-aware network architecture search (NAS) complemented by the NetAdapt algorithm and then subsequently improved through novel architecture advances. This paper starts the exploration of how automated search algorithms and network design can work together to harness complementary approaches improving the overall state of the art. Through this process we create two new MobileNet mod"},"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":"1905.02244","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-06T19:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"ab2c6f1fd268045af081f5499a4fffe89df5bd29e331447a6f8ba1dfff8c920a","abstract_canon_sha256":"00a6ba99a7ecccbf9a43f3785aa37e272ee9ccf5cecb418447de71c933605ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:43.188716Z","signature_b64":"i0OHT05XChzDMCXMvhtG7NzKqimDHG9lo/QG5kJvCwgCKVEuDXTkpEINKIEFtJdBumIV8Sc0sKPYibAf9f1BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb54b4b1d012ac251b0ef301731a3eefee759c8d48ae9aba6bb447c36ea34883","last_reissued_at":"2026-07-05T00:20:43.188211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:43.188211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching for MobileNetV3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew Howard, Bo Chen, Grace Chu, Hartwig Adam, Liang-Chieh Chen, Mark Sandler, Mingxing Tan, Quoc V. Le, Ruoming Pang, Vijay Vasudevan, Weijun Wang, Yukun Zhu","submitted_at":"2019-05-06T19:38:31Z","abstract_excerpt":"We present the next generation of MobileNets based on a combination of complementary search techniques as well as a novel architecture design. MobileNetV3 is tuned to mobile phone CPUs through a combination of hardware-aware network architecture search (NAS) complemented by the NetAdapt algorithm and then subsequently improved through novel architecture advances. This paper starts the exploration of how automated search algorithms and network design can work together to harness complementary approaches improving the overall state of the art. Through this process we create two new MobileNet mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02244","kind":"arxiv","version":5},"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/1905.02244/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":"1905.02244","created_at":"2026-07-05T00:20:43.188265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02244v5","created_at":"2026-07-05T00:20:43.188265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02244","created_at":"2026-07-05T00:20:43.188265+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNKLJMOQCKWC","created_at":"2026-07-05T00:20:43.188265+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNKLJMOQCKWCKGYO","created_at":"2026-07-05T00:20:43.188265+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNKLJMOQ","created_at":"2026-07-05T00:20:43.188265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02045","citing_title":"Attention mechanisms and transfer learning for robust peach leaf damage classification under domain shift","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2606.27579","citing_title":"Distribution-based deep multiple instance learning for tumor proportion scoring in NSCLC","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09881","citing_title":"Toward Calibrated, Fair, and accurate Deepfake Detection","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20250","citing_title":"Physics-informed convolutional neural networks for fluid flow through porous media","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17476","citing_title":"Privatar: Scalable Privacy-preserving Multi-user VR via Secure Offloading","ref_index":125,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03039","citing_title":"Mixed-Precision Information Bottlenecks for On-Device Trait-State Disentanglement in Bipolar Agitation Detection","ref_index":82,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657","json":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657.json","graph_json":"https://pith.science/api/pith-number/ZNKLJMOQCKWCKGYO6MAXGGR657/graph.json","events_json":"https://pith.science/api/pith-number/ZNKLJMOQCKWCKGYO6MAXGGR657/events.json","paper":"https://pith.science/paper/ZNKLJMOQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657","download_json":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657.json","view_paper":"https://pith.science/paper/ZNKLJMOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02244&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNKLJMOQCKWCKGYO6MAXGGR657/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNKLJMOQCKWCKGYO6MAXGGR657/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657/action/storage_attestation","attest_author":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657/action/author_attestation","sign_citation":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657/action/citation_signature","submit_replication":"https://pith.science/pith/ZNKLJMOQCKWCKGYO6MAXGGR657/action/replication_record"}},"created_at":"2026-07-05T00:20:43.188265+00:00","updated_at":"2026-07-05T00:20:43.188265+00:00"}