{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/conv2d-same","entry":"conv2d_same","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":2,"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":8,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":6},"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":"2408.13983","paper":"/paper/dual-path-adversarial-lifting-for-domain","title":"Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushuntang/dpal","path":"models/helpers.py","file_url":"https://github.com/yushuntang/dpal/blob/HEAD/models/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d68221a69e61e4fc","mcp_get_code":{"code_sha256":"d68221a69e61e4fc"}},{"arxiv_id":"2402.19460","paper":"/paper/benchmarking-uncertainty-disentanglement","title":"Benchmarking Uncertainty Disentanglement: Specialized Uncertainties for Specialized Tasks","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmucsanyi/bud","path":"bud/layers/conv2d_same.py","file_url":"https://github.com/bmucsanyi/bud/blob/HEAD/bud/layers/conv2d_same.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a71eaf07e052ef66","mcp_get_code":{"code_sha256":"a71eaf07e052ef66"}},{"arxiv_id":"2402.04129","paper":"/paper/ovor-oneprompt-with-virtual-outlier","title":"OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/timm","path":"timm/layers/conv2d_same.py","file_url":"https://github.com/pprp/timm/blob/HEAD/timm/layers/conv2d_same.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8cf70ff8a63b107f","mcp_get_code":{"code_sha256":"8cf70ff8a63b107f"}},{"arxiv_id":"2206.00843","paper":"/paper/depthshrinker-a-new-compression-paradigm","title":"DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networks","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/depthshrinker","path":"models/efficientnet_blocks.py","file_url":"https://github.com/facebookresearch/depthshrinker/blob/HEAD/models/efficientnet_blocks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"61bb8dbefa4ed19a","mcp_get_code":{"code_sha256":"61bb8dbefa4ed19a"}},{"arxiv_id":"2001.07645","paper":"/paper/saunet-shape-attentive-u-net-for","title":"SAUNet: Shape Attentive U-Net for Interpretable Medical Image Segmentation","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunjesse/shape-attentive-unet","path":"models/custom_functions.py","file_url":"https://github.com/sunjesse/shape-attentive-unet/blob/HEAD/models/custom_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"c7421ba4abae271c","mcp_get_code":{"code_sha256":"c7421ba4abae271c"}},{"arxiv_id":"1905.11946","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":"rwightman/gen-efficientnet-pytorch","path":"geffnet/gen_efficientnet.py","file_url":"https://github.com/rwightman/gen-efficientnet-pytorch/blob/HEAD/geffnet/gen_efficientnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a991beae0b7b2c9b","mcp_get_code":{"code_sha256":"a991beae0b7b2c9b"}},{"arxiv_id":"1905.02244","paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/genmobilenet-pytorch","path":"geffnet/conv2d_layers.py","file_url":"https://github.com/rwightman/genmobilenet-pytorch/blob/HEAD/geffnet/conv2d_layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4ec99f9f08732346","mcp_get_code":{"code_sha256":"4ec99f9f08732346"}},{"arxiv_id":"1811.10870","paper":"/paper/affinity-derivation-and-graph-merge-for","title":"Affinity Derivation and Graph Merge for Instance Segmentation","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xck36/GMIS","path":"resnet_v1_base.py","file_url":"https://github.com/xck36/GMIS/blob/HEAD/resnet_v1_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"2bade4ca10b330fb","mcp_get_code":{"code_sha256":"2bade4ca10b330fb"}}]}