{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/make-divisible-2","entry":"_make_divisible","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":14,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":5,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":14,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2211.12905","arxiv_id_is_arxiv":true,"paper":"/paper/ghostnetv2-enhance-cheap-operation-with-long","title":"GhostNetV2: Enhance Cheap Operation with Long-Range Attention","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likyoo/GhostNetV2-PyTorch","path":"ghostnetv2.py","file_url":"https://github.com/likyoo/GhostNetV2-PyTorch/blob/HEAD/ghostnetv2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, likyoo/GhostNetV2-PyTorch when it was checked","code_sha256":"75495d6418418155","code_sha256_prefix":"75495d6418418155","mcp_get_code":{"code_sha256":"75495d6418418155"}},{"arxiv_id":"2104.00298","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leondgarse/Keras_efficientnet_v2","path":"keras_efficientnet_v2/efficientnet_v2.py","file_url":"https://github.com/leondgarse/Keras_efficientnet_v2/blob/HEAD/keras_efficientnet_v2/efficientnet_v2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29f99c375893c0a7","code_sha256_prefix":"29f99c375893c0a7","mcp_get_code":{"code_sha256":"29f99c375893c0a7"}},{"arxiv_id":"2104.00298","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavidLandup0/deepvision","path":"deepvision/models/classification/efficientnet/efficientnetv2.py","file_url":"https://github.com/DavidLandup0/deepvision/blob/HEAD/deepvision/models/classification/efficientnet/efficientnetv2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"933cca1f8110f0cc","code_sha256_prefix":"933cca1f8110f0cc","mcp_get_code":{"code_sha256":"933cca1f8110f0cc"}},{"arxiv_id":"2103.13253","arxiv_id_is_arxiv":true,"paper":"/paper/learning-versatile-neural-architectures-by","title":"Learning Versatile Neural Architectures by Propagating Network Codes","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingmyu/NCP","path":"models/supernet.py","file_url":"https://github.com/dingmyu/NCP/blob/HEAD/models/supernet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"733638be3c212532","code_sha256_prefix":"733638be3c212532","mcp_get_code":{"code_sha256":"733638be3c212532"}},{"arxiv_id":"2103.11511","arxiv_id_is_arxiv":true,"paper":"/paper/movinets-mobile-video-networks-for-efficient","title":"MoViNets: Mobile Video Networks for Efficient Video Recognition","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Atze00/MoViNet-pytorch","path":"movinets/models.py","file_url":"https://github.com/Atze00/MoViNet-pytorch/blob/HEAD/movinets/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cf345647883539d","code_sha256_prefix":"0cf345647883539d","mcp_get_code":{"code_sha256":"0cf345647883539d"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"canturan10/satellighte","path":"satellighte/archs/efficientnet/module.py","file_url":"https://github.com/canturan10/satellighte/blob/HEAD/satellighte/archs/efficientnet/module.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0621a0616046823","code_sha256_prefix":"c0621a0616046823","mcp_get_code":{"code_sha256":"c0621a0616046823"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrisqqq123/FA-Dist-EfficientNet","path":"models/efficientnet.py","file_url":"https://github.com/chrisqqq123/FA-Dist-EfficientNet/blob/HEAD/models/efficientnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98d68ff672dd2414","code_sha256_prefix":"98d68ff672dd2414","mcp_get_code":{"code_sha256":"98d68ff672dd2414"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/vision","path":"torchvision/models/efficientnet.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/models/efficientnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d02b2d3887edbb5","code_sha256_prefix":"5d02b2d3887edbb5","mcp_get_code":{"code_sha256":"5d02b2d3887edbb5"}},{"arxiv_id":"1905.02244","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpikeKing/mobilenet_v3","path":"mn3_model.py","file_url":"https://github.com/SpikeKing/mobilenet_v3/blob/HEAD/mn3_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SpikeKing/mobilenet_v3 when it was checked","code_sha256":"03eee59192d9c54e","code_sha256_prefix":"03eee59192d9c54e","mcp_get_code":{"code_sha256":"03eee59192d9c54e"}},{"arxiv_id":"1802.02611","arxiv_id_is_arxiv":true,"paper":"/paper/encoder-decoder-with-atrous-separable","title":"Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation","date":"2018-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sara-nl/SURF-segmentation","path":"deeplab/keras-deeplab-v3-plus-master/model.py","file_url":"https://github.com/sara-nl/SURF-segmentation/blob/HEAD/deeplab/keras-deeplab-v3-plus-master/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sara-nl/SURF-segmentation when it was checked","code_sha256":"1eac80b6e2cee7b2","code_sha256_prefix":"1eac80b6e2cee7b2","mcp_get_code":{"code_sha256":"1eac80b6e2cee7b2"}},{"arxiv_id":"1801.04381","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenetv2-inverted-residuals-and-linear","title":"MobileNetV2: Inverted Residuals and Linear Bottlenecks","date":"2018-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yakhyo/gaze-estimation","path":"models/mobilenet.py","file_url":"https://github.com/yakhyo/gaze-estimation/blob/HEAD/models/mobilenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13980381792aff88","code_sha256_prefix":"13980381792aff88","mcp_get_code":{"code_sha256":"13980381792aff88"}},{"arxiv_id":"1801.04381","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenetv2-inverted-residuals-and-linear","title":"MobileNetV2: Inverted Residuals and Linear Bottlenecks","date":"2018-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-learning-algorithm/LightWeightCNN","path":"py/lib/models/mobilenet_v2/mobilenet_v2.py","file_url":"https://github.com/deep-learning-algorithm/LightWeightCNN/blob/HEAD/py/lib/models/mobilenet_v2/mobilenet_v2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13f1c8e878ee2013","code_sha256_prefix":"13f1c8e878ee2013","mcp_get_code":{"code_sha256":"13f1c8e878ee2013"}},{"arxiv_id":"1704.04861","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenets-efficient-convolutional-neural","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","date":"2017-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diasirish/mobilenetv3","path":"model.py","file_url":"https://github.com/diasirish/mobilenetv3/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, diasirish/mobilenetv3 when it was checked","code_sha256":"0d8f0dbec2595af8","code_sha256_prefix":"0d8f0dbec2595af8","mcp_get_code":{"code_sha256":"0d8f0dbec2595af8"}},{"arxiv_id":"1704.04861","arxiv_id_is_arxiv":true,"paper":"/paper/mobilenets-efficient-convolutional-neural","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","date":"2017-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangvation/torch-mobilenet","path":"module/mobilenet.py","file_url":"https://github.com/wangvation/torch-mobilenet/blob/HEAD/module/mobilenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, wangvation/torch-mobilenet (NOASSERTION)","code_sha256":"4369467852623e56","code_sha256_prefix":"4369467852623e56","mcp_get_code":{"code_sha256":"4369467852623e56"}}],"record_sha256":"5e34f8c8d28276505a1e9f64abdd6bb330ff0f11af366fb1bceb7f55caa16f8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}