{"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/mobilenet-v2","entry":"mobilenet_v2","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":23,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":8,"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":20,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":6,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":23,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":0,"ran":9,"unverified":5},"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":"2606.27527","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27527","title":"Large Language Model Teaches Visual Students: Cross-Modality Transfer of Fine-Grained Conceptual Knowledge","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"lliangthomas/lavid","path":"lavid/models/distill_models.py","file_url":"https://github.com/lliangthomas/lavid/blob/HEAD/lavid/models/distill_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"651da65a78a6815e","code_sha256_prefix":"651da65a78a6815e","mcp_get_code":{"code_sha256":"651da65a78a6815e"}},{"arxiv_id":"2604.18256","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18256","title":"Domain-Specialized Object Detection via Model-Level Mixtures of Experts","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"KASTEL-MobilityLab/mixtures-of-experts","path":"models/deeplab_moe.py","file_url":"https://github.com/KASTEL-MobilityLab/mixtures-of-experts/blob/HEAD/models/deeplab_moe.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT-0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c6395d61f50c6c0","code_sha256_prefix":"6c6395d61f50c6c0","mcp_get_code":{"code_sha256":"6c6395d61f50c6c0"}},{"arxiv_id":"2508.21695","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-21695","title":"Activation Subspaces for Out-of-Distribution Detection","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"visinf/actsub","path":"actsub_standard/models/ood_mobilenet.py","file_url":"https://github.com/visinf/actsub/blob/HEAD/actsub_standard/models/ood_mobilenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d903f08a285787b0","code_sha256_prefix":"d903f08a285787b0","mcp_get_code":{"code_sha256":"d903f08a285787b0"}},{"arxiv_id":"2505.05522","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-thought-machines","title":"Continuous Thought Machines","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huyvnphan/PyTorch_CIFAR10","path":"cifar10_models/mobilenetv2.py","file_url":"https://github.com/huyvnphan/PyTorch_CIFAR10/blob/HEAD/cifar10_models/mobilenetv2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"856759d3dba2362b","code_sha256_prefix":"856759d3dba2362b","mcp_get_code":{"code_sha256":"856759d3dba2362b"}},{"arxiv_id":"2411.02853","arxiv_id_is_arxiv":true,"paper":"/paper/adopt-modified-adam-can-converge-with-any-b-2","title":"ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UiPath/torchvision","path":"torchvision/models/mobilenetv2.py","file_url":"https://github.com/UiPath/torchvision/blob/HEAD/torchvision/models/mobilenetv2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57f30bbef481b9c8","code_sha256_prefix":"57f30bbef481b9c8","mcp_get_code":{"code_sha256":"57f30bbef481b9c8"}},{"arxiv_id":"2405.18902","arxiv_id_is_arxiv":true,"paper":"/paper/a-causal-framework-for-evaluating-deferring","title":"A Causal Framework for Evaluating Deferring Systems","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrepugni/pods","path":"src/networks.py","file_url":"https://github.com/andrepugni/pods/blob/HEAD/src/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, andrepugni/pods when it was checked","code_sha256":"6b099063d80dc67f","code_sha256_prefix":"6b099063d80dc67f","mcp_get_code":{"code_sha256":"6b099063d80dc67f"}},{"arxiv_id":"2403.15760","arxiv_id_is_arxiv":true,"paper":"/paper/an-upload-efficient-scheme-for-transferring","title":"An Upload-Efficient Scheme for Transferring Knowledge From a Server-Side Pre-trained Generator to Clients in Heterogeneous Federated Learning","date":"2024-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingz0/fedktl","path":"system/flcore/trainmodel/mobilenet_v2.py","file_url":"https://github.com/tsingz0/fedktl/blob/HEAD/system/flcore/trainmodel/mobilenet_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22b172e83bc1a35c","code_sha256_prefix":"22b172e83bc1a35c","mcp_get_code":{"code_sha256":"22b172e83bc1a35c"}},{"arxiv_id":"2403.07535","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-fusion-of-single-view-and-multi-view","title":"Adaptive Fusion of Single-View and Multi-View Depth for Autonomous Driving","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junda24/afnet","path":"networks/mobilenet.py","file_url":"https://github.com/junda24/afnet/blob/HEAD/networks/mobilenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90813520c84cd028","code_sha256_prefix":"90813520c84cd028","mcp_get_code":{"code_sha256":"90813520c84cd028"}},{"arxiv_id":"2403.06014","arxiv_id_is_arxiv":true,"paper":"/paper/hard-label-based-small-query-black-box","title":"Hard-label based Small Query Black-box Adversarial Attack","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jpark04-qub/sqba","path":"net/cifar10/mobilenetv2.py","file_url":"https://github.com/jpark04-qub/sqba/blob/HEAD/net/cifar10/mobilenetv2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"856759d3dba2362b","code_sha256_prefix":"856759d3dba2362b","mcp_get_code":{"code_sha256":"856759d3dba2362b"}},{"arxiv_id":"2311.14975","arxiv_id_is_arxiv":true,"paper":"/paper/eliminating-domain-bias-for-federated","title":"Eliminating Domain Bias for Federated Learning in Representation Space","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TsingZ0/DBE","path":"system/flcore/trainmodel/mobilenet_v2.py","file_url":"https://github.com/TsingZ0/DBE/blob/HEAD/system/flcore/trainmodel/mobilenet_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22b172e83bc1a35c","code_sha256_prefix":"22b172e83bc1a35c","mcp_get_code":{"code_sha256":"22b172e83bc1a35c"}},{"arxiv_id":"2310.04918","arxiv_id_is_arxiv":true,"paper":"/paper/robust-network-pruning-with-sparse-entropic","title":"SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youlei202/entropic-wasserstein-pruning","path":"models/mobilenetv2.py","file_url":"https://github.com/youlei202/entropic-wasserstein-pruning/blob/HEAD/models/mobilenetv2.py","status":"ran","verification_level":1,"contract_check":null,"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, youlei202/entropic-wasserstein-pruning when it was checked","code_sha256":"766de1c613646dc0","code_sha256_prefix":"766de1c613646dc0","mcp_get_code":{"code_sha256":"766de1c613646dc0"}},{"arxiv_id":"2303.13995","arxiv_id_is_arxiv":true,"paper":"/paper/line-out-of-distribution-detection-by","title":"LINe: Out-of-Distribution Detection by Leveraging Important Neurons","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yonghyun-ahn/line-out-of-distribution-detection-by-leveraging-important-neurons","path":"models/mobilenetv2.py","file_url":"https://github.com/yonghyun-ahn/line-out-of-distribution-detection-by-leveraging-important-neurons/blob/HEAD/models/mobilenetv2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c3391fd28fbb0aa","code_sha256_prefix":"3c3391fd28fbb0aa","mcp_get_code":{"code_sha256":"3c3391fd28fbb0aa"}},{"arxiv_id":"2211.16231","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-temperature-for-knowledge","title":"Curriculum Temperature for Knowledge Distillation","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengli97/ctkd","path":"models/mobilenetv2_imagenet.py","file_url":"https://github.com/zhengli97/ctkd/blob/HEAD/models/mobilenetv2_imagenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee9a05c9ee4702a2","code_sha256_prefix":"ee9a05c9ee4702a2","mcp_get_code":{"code_sha256":"ee9a05c9ee4702a2"}},{"arxiv_id":"2208.04187","arxiv_id_is_arxiv":true,"paper":"/paper/towards-memory-efficient-training-via-dual","title":"DIVISION: Memory Efficient Training via Dual Activation Precision","date":"2022-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanchuwang/division","path":"cifar_models/mobilenet.py","file_url":"https://github.com/guanchuwang/division/blob/HEAD/cifar_models/mobilenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d167093589e2e5c","code_sha256_prefix":"9d167093589e2e5c","mcp_get_code":{"code_sha256":"9d167093589e2e5c"}},{"arxiv_id":"2207.13686","arxiv_id_is_arxiv":true,"paper":"/paper/shift-tolerant-perceptual-similarity-metric-1","title":"Shift-tolerant Perceptual Similarity Metric","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhijay9/shifttolerant-lpips","path":"models_lpf/mobilenet.py","file_url":"https://github.com/abhijay9/shifttolerant-lpips/blob/HEAD/models_lpf/mobilenet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db4ebb84a4e9d995","code_sha256_prefix":"db4ebb84a4e9d995","mcp_get_code":{"code_sha256":"db4ebb84a4e9d995"}},{"arxiv_id":"2105.03245","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-focus-for-efficient-video","title":"Adaptive Focus for Efficient Video Recognition","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackfeather-wang/AdaFocus","path":"Experiments on ActivityNet, FCVID and Mini-Kinetics/models/gfv_net.py","file_url":"https://github.com/blackfeather-wang/AdaFocus/blob/HEAD/Experiments%20on%20ActivityNet%2C%20FCVID%20and%20Mini-Kinetics/models/gfv_net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, blackfeather-wang/AdaFocus when it was checked","code_sha256":"2f3f5423309d07f4","code_sha256_prefix":"2f3f5423309d07f4","mcp_get_code":{"code_sha256":"2f3f5423309d07f4"}},{"arxiv_id":"2008.04693","arxiv_id_is_arxiv":true,"paper":"/paper/profit-a-novel-training-method-for-sub-4-bit","title":"PROFIT: A Novel Training Method for sub-4-bit MobileNet Models","date":"2020-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EunhyeokPark/PROFIT","path":"conv_model/ilsvrc/MobileNetV2_quant.py","file_url":"https://github.com/EunhyeokPark/PROFIT/blob/HEAD/conv_model/ilsvrc/MobileNetV2_quant.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba91e9b63946d0c1","code_sha256_prefix":"ba91e9b63946d0c1","mcp_get_code":{"code_sha256":"ba91e9b63946d0c1"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dataflowr/notebooks","path":"Module17/mobilenetv2.py","file_url":"https://github.com/dataflowr/notebooks/blob/HEAD/Module17/mobilenetv2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"856759d3dba2362b","code_sha256_prefix":"856759d3dba2362b","mcp_get_code":{"code_sha256":"856759d3dba2362b"}},{"arxiv_id":"2006.04528","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-criteria-for-instance-based","title":"Evaluation of Similarity-based Explanations","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k-hanawa/criteria_for_instance_based_explanation","path":"src/torch/mobilenetv2.py","file_url":"https://github.com/k-hanawa/criteria_for_instance_based_explanation/blob/HEAD/src/torch/mobilenetv2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1bf41dee7f45a7f","code_sha256_prefix":"d1bf41dee7f45a7f","mcp_get_code":{"code_sha256":"d1bf41dee7f45a7f"}},{"arxiv_id":"1907.11561","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-for-classification-and-severity","title":"Deep Learning for Classification and Severity Estimation of Coffee Leaf Biotic Stress","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esgario/lara2018","path":"classification/architectures/mobilenetv2.py","file_url":"https://github.com/esgario/lara2018/blob/HEAD/classification/architectures/mobilenetv2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b15eab5b4bf8c19e","code_sha256_prefix":"b15eab5b4bf8c19e","mcp_get_code":{"code_sha256":"b15eab5b4bf8c19e"}},{"arxiv_id":"aaai_32254","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32254","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongsinLee/FLAIR","path":"backbone/mobilenet_v2.py","file_url":"https://github.com/HongsinLee/FLAIR/blob/HEAD/backbone/mobilenet_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ae596d3f7ee02b1","code_sha256_prefix":"4ae596d3f7ee02b1","mcp_get_code":{"code_sha256":"4ae596d3f7ee02b1"}},{"arxiv_id":"Wang_Practical_Network_Acceleration_With_Tiny_Sets_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Practical_Network_Acceleration_With_Tiny_Sets_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DoctorKey/Practise","path":"models/mobilenetv2.py","file_url":"https://github.com/DoctorKey/Practise/blob/HEAD/models/mobilenetv2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9c79c4519c05008","code_sha256_prefix":"a9c79c4519c05008","mcp_get_code":{"code_sha256":"a9c79c4519c05008"}},{"arxiv_id":"Quetu_LaCoOT_Layer_Collapse_through_Optimal_Transport_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Quetu_LaCoOT_Layer_Collapse_through_Optimal_Transport_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VGCQ/LaCoOT","path":"models/Mobilenetv2.py","file_url":"https://github.com/VGCQ/LaCoOT/blob/HEAD/models/Mobilenetv2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2954c0acc6ee0e01","code_sha256_prefix":"2954c0acc6ee0e01","mcp_get_code":{"code_sha256":"2954c0acc6ee0e01"}}],"record_sha256":"4dc84f77ac7c72b9244f5fef6a4ac2dc11f2fd160c64f35760ae338da8a8defd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}