{"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/unetconvblock","entry":"UNetConvBlock","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":7,"n_samples_constructed":3,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":5,"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":7,"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":"2309.01958","arxiv_id_is_arxiv":true,"paper":"/paper/empowering-low-light-image-enhancer-through","title":"Empowering Low-Light Image Enhancer through Customized Learnable Priors","date":"2023-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zheng980629/CUE","path":"basicsr/archs/LearnablePriorsCondUNetFreReflRestore_arch.py","file_url":"https://github.com/zheng980629/CUE/blob/HEAD/basicsr/archs/LearnablePriorsCondUNetFreReflRestore_arch.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, zheng980629/CUE when it was checked","code_sha256":"4f7bbfa1161eb18c","code_sha256_prefix":"4f7bbfa1161eb18c","mcp_get_code":{"code_sha256":"4f7bbfa1161eb18c"}},{"arxiv_id":"2208.05244","arxiv_id_is_arxiv":true,"paper":"/paper/learning-degradation-representations-for","title":"Learning Degradation Representations for Image Deblurring","date":"2022-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dasongli1/learning_degradation","path":"basicsr/models/archs/msdi_arch.py","file_url":"https://github.com/dasongli1/learning_degradation/blob/HEAD/basicsr/models/archs/msdi_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dasongli1/learning_degradation when it was checked","code_sha256":"7e510587e572735e","code_sha256_prefix":"7e510587e572735e","mcp_get_code":{"code_sha256":"7e510587e572735e"}},{"arxiv_id":"2204.13348","arxiv_id_is_arxiv":true,"paper":"/paper/deep-generalized-unfolding-networks-for-image","title":"Deep Generalized Unfolding Networks for Image Restoration","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mc-e/deep-generalized-unfolding-networks-for-image-restoration","path":"Compressive-Sensing/DGUNet.py","file_url":"https://github.com/mc-e/deep-generalized-unfolding-networks-for-image-restoration/blob/HEAD/Compressive-Sensing/DGUNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mc-e/deep-generalized-unfolding-networks-for-image-restoration when it was checked","code_sha256":"823e506a5289cdbd","code_sha256_prefix":"823e506a5289cdbd","mcp_get_code":{"code_sha256":"823e506a5289cdbd"}},{"arxiv_id":"2111.15542","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-transfer-for-traffic-forecasting","title":"Learning to Transfer for Traffic Forecasting via Multi-task Learning","date":"2021-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yichaolu/traffic4cast2021","path":"core_competition/model_v3.py","file_url":"https://github.com/yichaolu/traffic4cast2021/blob/HEAD/core_competition/model_v3.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, yichaolu/traffic4cast2021 when it was checked","code_sha256":"9bdfb965335c98c5","code_sha256_prefix":"9bdfb965335c98c5","mcp_get_code":{"code_sha256":"9bdfb965335c98c5"}},{"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":"jvanvugt/pytorch-unet","path":"unet.py","file_url":"https://github.com/jvanvugt/pytorch-unet/blob/HEAD/unet.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":"1a78a040d3aeae98","code_sha256_prefix":"1a78a040d3aeae98","mcp_get_code":{"code_sha256":"1a78a040d3aeae98"}},{"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":"jiye-ML/unet_pytorch","path":"unet.py","file_url":"https://github.com/jiye-ML/unet_pytorch/blob/HEAD/unet.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, jiye-ML/unet_pytorch when it was checked","code_sha256":"14651d77be33a8b1","code_sha256_prefix":"14651d77be33a8b1","mcp_get_code":{"code_sha256":"14651d77be33a8b1"}},{"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":"tatigabru/kaggle-lyft","path":"src/models/unet.py","file_url":"https://github.com/tatigabru/kaggle-lyft/blob/HEAD/src/models/unet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e89b6c2f0d08c5fa","code_sha256_prefix":"e89b6c2f0d08c5fa","mcp_get_code":{"code_sha256":"e89b6c2f0d08c5fa"}}],"record_sha256":"cd1522b020b13159a2e469cd033045d2c1c6920a8f94619db4791a7e9776bcda","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}