{"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/conv3x3-2","entry":"Conv3x3","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":6,"n_papers_ran":4,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2601.21291","paper":"/paper/arxiv-2601-21291","title":"Gaussian Belief Propagation Network for Depth Completion","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"kakaxi314/GBPN","path":"models/utils.py","file_url":"https://github.com/kakaxi314/GBPN/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f8ae19885bce102c","mcp_get_code":{"code_sha256":"f8ae19885bce102c"}},{"arxiv_id":"2403.11270","paper":"/paper/bilateral-propagation-network-for-depth","title":"Bilateral Propagation Network for Depth Completion","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaxi314/BP-Net","path":"models/utils.py","file_url":"https://github.com/kakaxi314/BP-Net/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f8ae19885bce102c","mcp_get_code":{"code_sha256":"f8ae19885bce102c"}},{"arxiv_id":"2108.08829","paper":"/paper/fine-grained-semantics-aware-representation","title":"Fine-grained Semantics-aware Representation Enhancement for Self-supervised Monocular Depth Estimation","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shlomi-amitai/FSRE-Depth","path":"networks/cma.py","file_url":"https://github.com/shlomi-amitai/FSRE-Depth/blob/HEAD/networks/cma.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c99ca4ba41bbbba6","mcp_get_code":{"code_sha256":"c99ca4ba41bbbba6"}},{"arxiv_id":"1906.00910","paper":"/paper/190600910","title":"Learning Representations by Maximizing Mutual Information Across Views","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alibaba-AAIG/SSL-FEW-SHOT","path":"feat/networks/amdimnet.py","file_url":"https://github.com/Alibaba-AAIG/SSL-FEW-SHOT/blob/HEAD/feat/networks/amdimnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd0c3fab3b60d3c1","mcp_get_code":{"code_sha256":"fd0c3fab3b60d3c1"}},{"arxiv_id":"1606.06650","paper":"/paper/3d-u-net-learning-dense-volumetric","title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","date":"2016-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shrajan/AAAI-2022","path":"networks/unet.py","file_url":"https://github.com/Shrajan/AAAI-2022/blob/HEAD/networks/unet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"002f393823c7b57c","mcp_get_code":{"code_sha256":"002f393823c7b57c"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shreyaspadhy/unet-zoo","path":"models.py","file_url":"https://github.com/shreyaspadhy/unet-zoo/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99ea3efd344410f4","mcp_get_code":{"code_sha256":"99ea3efd344410f4"}}]}