Home › Code › conv2d_same

conv2d_same

Syntologyentry name in harvested coderead from the graph 2026-09-24

conv2d_same appears in the code Syntology harvested for 8 papers, as 8 distinct code bodies found in 8 places (a place is one code body under one paper). At least one of them ran in 2 of the papers; 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named conv2d_same do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 2 of the 8 distinct code bodies named conv2d_same; 6 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
2ran · our draft was wrong
0ran · fixture could not drive it
0ran
6unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 8 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

8 papers shown of 8, newest first; 8 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation 26 Aug 2024 yushuntang/dpal/models/helpers.py d68221a69e61e4fc unverified MIT (permissive)
Benchmarking Uncertainty Disentanglement: Specialized Uncertainties for Specialized Tasks 29 Feb 2024 bmucsanyi/bud/bud/layers/conv2d_same.py a71eaf07e052ef66 unverified Apache-2.0 (permissive)
OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning 6 Feb 2024 pprp/timm/timm/layers/conv2d_same.py 8cf70ff8a63b107f unverified Apache-2.0 (permissive)
DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networks 2 Jun 2022 facebookresearch/depthshrinker/models/efficientnet_blocks.py 61bb8dbefa4ed19a ran · our draft was wrong licence not identified · pointer only
SAUNet: Shape Attentive U-Net for Interpretable Medical Image Segmentation 21 Jan 2020 sunjesse/shape-attentive-unet/models/custom_functions.py c7421ba4abae271c unverified BSD-3-Clause (permissive)
EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks 28 May 2019 rwightman/gen-efficientnet-pytorch/geffnet/gen_efficientnet.py a991beae0b7b2c9b ran · our draft was wrong Apache-2.0 (permissive)
Searching for MobileNetV3 6 May 2019 rwightman/genmobilenet-pytorch/geffnet/conv2d_layers.py 4ec99f9f08732346 unverified Apache-2.0 (permissive)
Affinity Derivation and Graph Merge for Instance Segmentation 27 Nov 2018 xck36/GMIS/resnet_v1_base.py 2bade4ca10b330fb unverified BSD-3-Clause (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections