{"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/conv3x3-2","entry":"Conv3x3","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":1,"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":5,"unverified":0},"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":"2601.21291","arxiv_id_is_arxiv":true,"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":"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":"f8ae19885bce102c","code_sha256_prefix":"f8ae19885bce102c","mcp_get_code":{"code_sha256":"f8ae19885bce102c"}},{"arxiv_id":"2403.11270","arxiv_id_is_arxiv":true,"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":"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":"f8ae19885bce102c","code_sha256_prefix":"f8ae19885bce102c","mcp_get_code":{"code_sha256":"f8ae19885bce102c"}},{"arxiv_id":"2108.08829","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c99ca4ba41bbbba6","code_sha256_prefix":"c99ca4ba41bbbba6","mcp_get_code":{"code_sha256":"c99ca4ba41bbbba6"}},{"arxiv_id":"1906.00910","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd0c3fab3b60d3c1","code_sha256_prefix":"fd0c3fab3b60d3c1","mcp_get_code":{"code_sha256":"fd0c3fab3b60d3c1"}},{"arxiv_id":"1606.06650","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Shrajan/AAAI-2022 when it was checked","code_sha256":"002f393823c7b57c","code_sha256_prefix":"002f393823c7b57c","mcp_get_code":{"code_sha256":"002f393823c7b57c"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99ea3efd344410f4","code_sha256_prefix":"99ea3efd344410f4","mcp_get_code":{"code_sha256":"99ea3efd344410f4"}}],"record_sha256":"a956cd9a0c57e32e7d94c017518c48eae2d07c6807a80edf0e07e6127c67a6de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}