{"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/convbnrelu","entry":"ConvBNReLU","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":16,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":19,"n_samples_ran":17,"n_samples_constructed":13,"n_samples_ran_checked":17,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":15,"n_places":19,"n_places_pointer_only":8,"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":0,"ran_fixture":0,"ran":17,"unverified":2},"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":"2607.15995","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15995","title":"CanonicalPhys: Pose-Robust Remote Photoplethysmography via Canonical-Space Priors","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"infraface/CanonicalPhys","path":"models/canonical_phys.py","file_url":"https://github.com/infraface/CanonicalPhys/blob/HEAD/models/canonical_phys.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33a9f1fd32ac30fc","code_sha256_prefix":"33a9f1fd32ac30fc","mcp_get_code":{"code_sha256":"33a9f1fd32ac30fc"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT-0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"812298b801d761c6","code_sha256_prefix":"812298b801d761c6","mcp_get_code":{"code_sha256":"812298b801d761c6"}},{"arxiv_id":"2411.01542","arxiv_id_is_arxiv":true,"paper":"/paper/factorizephys-matrix-factorization-for","title":"FactorizePhys: Matrix Factorization for Multidimensional Attention in Remote Physiological Sensing","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"physiologicailab/factorizephys","path":"neural_methods/model/FactorizePhys/FactorizePhys.py","file_url":"https://github.com/physiologicailab/factorizephys/blob/HEAD/neural_methods/model/FactorizePhys/FactorizePhys.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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, physiologicailab/factorizephys (NOASSERTION)","code_sha256":"6e953ed1bef334e0","code_sha256_prefix":"6e953ed1bef334e0","mcp_get_code":{"code_sha256":"6e953ed1bef334e0"}},{"arxiv_id":"2307.14008","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-frequency-filters-as-efficient","title":"Adaptive Frequency Filters As Efficient Global Token Mixers","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NWPU-Li/AFFNet","path":"aff_block_LL.py","file_url":"https://github.com/NWPU-Li/AFFNet/blob/HEAD/aff_block_LL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NWPU-Li/AFFNet when it was checked","code_sha256":"641eb298cd57de0b","code_sha256_prefix":"641eb298cd57de0b","mcp_get_code":{"code_sha256":"641eb298cd57de0b"}},{"arxiv_id":"2303.11880","arxiv_id_is_arxiv":true,"paper":"/paper/focused-and-collaborative-feedback","title":"Focused and Collaborative Feedback Integration for Interactive Image Segmentation","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"veizgyauzgyauz/FCFI","path":"isegm/model/modeling/fcfi/cffm.py","file_url":"https://github.com/veizgyauzgyauz/FCFI/blob/HEAD/isegm/model/modeling/fcfi/cffm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, veizgyauzgyauz/FCFI when it was checked","code_sha256":"5a436f039c4adc6e","code_sha256_prefix":"5a436f039c4adc6e","mcp_get_code":{"code_sha256":"5a436f039c4adc6e"}},{"arxiv_id":"2207.14552","arxiv_id_is_arxiv":true,"paper":"/paper/scaleformer-revisiting-the-transformer-based","title":"ScaleFormer: Revisiting the Transformer-based Backbones from a Scale-wise Perspective for Medical Image Segmentation","date":"2022-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJUGiveLab/ScaleFormer","path":"networks/ScaleFormer.py","file_url":"https://github.com/ZJUGiveLab/ScaleFormer/blob/HEAD/networks/ScaleFormer.py","status":"ran","verification_level":1,"contract_check":null,"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, ZJUGiveLab/ScaleFormer when it was checked","code_sha256":"5b7ed766c1872be5","code_sha256_prefix":"5b7ed766c1872be5","mcp_get_code":{"code_sha256":"5b7ed766c1872be5"}},{"arxiv_id":"2205.01271","arxiv_id_is_arxiv":true,"paper":"/paper/lite-pose-efficient-architecture-design-for","title":"Lite Pose: Efficient Architecture Design for 2D Human Pose Estimation","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/litepose","path":"lib/models/pose_efficient_hrnet.py","file_url":"https://github.com/mit-han-lab/litepose/blob/HEAD/lib/models/pose_efficient_hrnet.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":"cfa53abbbd2bfd20","code_sha256_prefix":"cfa53abbbd2bfd20","mcp_get_code":{"code_sha256":"cfa53abbbd2bfd20"}},{"arxiv_id":"2203.02688","arxiv_id_is_arxiv":true,"paper":"/paper/zoom-in-and-out-a-mixed-scale-triplet-network","title":"Zoom In and Out: A Mixed-scale Triplet Network for Camouflaged Object Detection","date":"2022-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lartpang/ZoomNet","path":"methods/zoomnet/zoomnet.py","file_url":"https://github.com/lartpang/ZoomNet/blob/HEAD/methods/zoomnet/zoomnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"862d137d282a2bab","code_sha256_prefix":"862d137d282a2bab","mcp_get_code":{"code_sha256":"862d137d282a2bab"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"694778287c1e57cb","code_sha256_prefix":"694778287c1e57cb","mcp_get_code":{"code_sha256":"694778287c1e57cb"}},{"arxiv_id":"2104.13188","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-bisenet-for-real-time-semantic","title":"Rethinking BiSeNet For Real-time Semantic Segmentation","date":"2021-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Deci-AI/super-gradients","path":"src/super_gradients/training/models/segmentation_models/stdc.py","file_url":"https://github.com/Deci-AI/super-gradients/blob/HEAD/src/super_gradients/training/models/segmentation_models/stdc.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":"8942f44b7273d2b1","code_sha256_prefix":"8942f44b7273d2b1","mcp_get_code":{"code_sha256":"8942f44b7273d2b1"}},{"arxiv_id":"2104.02244","arxiv_id_is_arxiv":true,"paper":"/paper/content-aware-gan-compression","title":"Content-Aware GAN Compression","date":"2021-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lychenyoko/content-aware-gan-compression","path":"Util/content_aware_pruning.py","file_url":"https://github.com/lychenyoko/content-aware-gan-compression/blob/HEAD/Util/content_aware_pruning.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"199ed6b9f3c73292","code_sha256_prefix":"199ed6b9f3c73292","mcp_get_code":{"code_sha256":"199ed6b9f3c73292"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a64ad8762fe201c4","code_sha256_prefix":"a64ad8762fe201c4","mcp_get_code":{"code_sha256":"a64ad8762fe201c4"}},{"arxiv_id":"2103.04133","arxiv_id_is_arxiv":true,"paper":"/paper/learning-statistical-texture-for-semantic","title":"Learning Statistical Texture for Semantic Segmentation","date":"2021-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanyunzhu99/Learning-Statistical-Texture-for-Semantic-Segmentation","path":"STLNet.py","file_url":"https://github.com/lanyunzhu99/Learning-Statistical-Texture-for-Semantic-Segmentation/blob/HEAD/STLNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lanyunzhu99/Learning-Statistical-Texture-for-Semantic-Segmentation when it was checked","code_sha256":"f26c090aaae914dd","code_sha256_prefix":"f26c090aaae914dd","mcp_get_code":{"code_sha256":"f26c090aaae914dd"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"998f5b8d1f852446","code_sha256_prefix":"998f5b8d1f852446","mcp_get_code":{"code_sha256":"998f5b8d1f852446"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bbf9113c42008a7","code_sha256_prefix":"7bbf9113c42008a7","mcp_get_code":{"code_sha256":"7bbf9113c42008a7"}},{"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":"meijieru/yet_another_mobilenet_series","path":"models/mobilenet_base.py","file_url":"https://github.com/meijieru/yet_another_mobilenet_series/blob/HEAD/models/mobilenet_base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, meijieru/yet_another_mobilenet_series (NOASSERTION)","code_sha256":"ac463ce4dee9e114","code_sha256_prefix":"ac463ce4dee9e114","mcp_get_code":{"code_sha256":"ac463ce4dee9e114"}},{"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":"duan-song/SATNet","path":"models/MobileNetV2.py","file_url":"https://github.com/duan-song/SATNet/blob/HEAD/models/MobileNetV2.py","status":"ran","verification_level":1,"contract_check":null,"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, duan-song/SATNet when it was checked","code_sha256":"e13e89a59e74d402","code_sha256_prefix":"e13e89a59e74d402","mcp_get_code":{"code_sha256":"e13e89a59e74d402"}},{"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":"canturan10/satellighte","path":"satellighte/archs/mobilenetv2/module.py","file_url":"https://github.com/canturan10/satellighte/blob/HEAD/satellighte/archs/mobilenetv2/module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"030ac159ba75736b","code_sha256_prefix":"030ac159ba75736b","mcp_get_code":{"code_sha256":"030ac159ba75736b"}},{"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":"deep-learning-algorithm/LightWeightCNN","path":"py/lib/models/mobilenet/mobilenet.py","file_url":"https://github.com/deep-learning-algorithm/LightWeightCNN/blob/HEAD/py/lib/models/mobilenet/mobilenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9b5f1e8c01481db","code_sha256_prefix":"a9b5f1e8c01481db","mcp_get_code":{"code_sha256":"a9b5f1e8c01481db"}}],"record_sha256":"5ea40f668f4afad3c6133fd1078f803a2c047af8443263d94db2cc104c0ed89a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}