{"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/upblock","entry":"UpBlock","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":15,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":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":17,"n_samples_ran":12,"n_samples_constructed":7,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":2,"n_places":19,"n_places_pointer_only":9,"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":2,"ran_fixture":0,"ran":10,"unverified":5},"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":"2604.25172","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-25172","title":"Conditional Flow Matching for Probabilistic Downscaling of Maximum 3-day Snowfall in Alaska","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"glide-ism/wrf-flow","path":"models/unet_models.py","file_url":"https://github.com/glide-ism/wrf-flow/blob/HEAD/models/unet_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56f9d90393e88d53","code_sha256_prefix":"56f9d90393e88d53","mcp_get_code":{"code_sha256":"56f9d90393e88d53"}},{"arxiv_id":"2510.21396","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-21396","title":"Depth-Supervised Fusion Network for Seamless-Free Image Stitching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"DLUT-YRH/DSFN","path":"Fusion/newCodes/network.py","file_url":"https://github.com/DLUT-YRH/DSFN/blob/HEAD/Fusion/newCodes/network.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, DLUT-YRH/DSFN when it was checked","code_sha256":"4f4b9acf83d1da3c","code_sha256_prefix":"4f4b9acf83d1da3c","mcp_get_code":{"code_sha256":"4f4b9acf83d1da3c"}},{"arxiv_id":"2509.02101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-02101","title":"-Semantics-Aware Logical Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"MaticFuc/SALAD","path":"ae.py","file_url":"https://github.com/MaticFuc/SALAD/blob/HEAD/ae.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":"e9961b404f0444f1","code_sha256_prefix":"e9961b404f0444f1","mcp_get_code":{"code_sha256":"e9961b404f0444f1"}},{"arxiv_id":"2407.05232","arxiv_id_is_arxiv":true,"paper":"/paper/papm-a-physics-aware-proxy-model-for-process","title":"PAPM: A Physics-aware Proxy Model for Process Systems","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pengwei07/papm","path":"papm/model/pdeunet.py","file_url":"https://github.com/pengwei07/papm/blob/HEAD/papm/model/pdeunet.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, pengwei07/papm when it was checked","code_sha256":"5f44095c7d71012a","code_sha256_prefix":"5f44095c7d71012a","mcp_get_code":{"code_sha256":"5f44095c7d71012a"}},{"arxiv_id":"2405.17111","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-bridge-autoencoders-for","title":"Diffusion Bridge AutoEncoders for Unsupervised Representation Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aailab-kaist/DBAE","path":"ddbm/unet.py","file_url":"https://github.com/aailab-kaist/DBAE/blob/HEAD/ddbm/unet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a2cb2800ec7d0de","code_sha256_prefix":"5a2cb2800ec7d0de","mcp_get_code":{"code_sha256":"5a2cb2800ec7d0de"}},{"arxiv_id":"2401.01552","arxiv_id_is_arxiv":true,"paper":"/paper/cra-pcn-point-cloud-completion-with-intra-and","title":"CRA-PCN: Point Cloud Completion with Intra- and Inter-level Cross-Resolution Transformers","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EasyRy/CRA-PCN","path":"models/crapcn.py","file_url":"https://github.com/EasyRy/CRA-PCN/blob/HEAD/models/crapcn.py","status":"unverified","verification_level":0,"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, EasyRy/CRA-PCN when it was checked","code_sha256":"0d8684e3d516a211","code_sha256_prefix":"0d8684e3d516a211","mcp_get_code":{"code_sha256":"0d8684e3d516a211"}},{"arxiv_id":"2310.18894","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.18894","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"Crazy-Jack/nips2023_shape_vs_texture","path":"few-shot-img-syn/TopKGen/models.py","file_url":"https://github.com/Crazy-Jack/nips2023_shape_vs_texture/blob/HEAD/few-shot-img-syn/TopKGen/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Crazy-Jack/nips2023_shape_vs_texture when it was checked","code_sha256":"5a2cb2800ec7d0de","code_sha256_prefix":"5a2cb2800ec7d0de","mcp_get_code":{"code_sha256":"5a2cb2800ec7d0de"}},{"arxiv_id":"2211.05556","arxiv_id_is_arxiv":true,"paper":"/paper/generating-astronomical-spectra-from","title":"Generating astronomical spectra from photometry with conditional diffusion models","date":null,"month_inferred_from_arxiv_id":"2022-11","title_source":"archive","repo":"larsdoorenbos/generate-spectra","path":"generative/unet.py","file_url":"https://github.com/larsdoorenbos/generate-spectra/blob/HEAD/generative/unet.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":"2b5306125b24e7ca","code_sha256_prefix":"2b5306125b24e7ca","mcp_get_code":{"code_sha256":"2b5306125b24e7ca"}},{"arxiv_id":"2205.13671","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-for-partial-differential","title":"Transformer for Partial Differential Equations' Operator Learning","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BaratiLab/OFormer","path":"BVP/nn_module/cnn_module.py","file_url":"https://github.com/BaratiLab/OFormer/blob/HEAD/BVP/nn_module/cnn_module.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":"d2a267488e5f88c6","code_sha256_prefix":"d2a267488e5f88c6","mcp_get_code":{"code_sha256":"d2a267488e5f88c6"}},{"arxiv_id":"2201.10419","arxiv_id_is_arxiv":true,"paper":"/paper/ensemble-learning-priors-unfolding-for","title":"Ensemble learning priors unfolding for scalable Snapshot Compressive Sensing","date":"2022-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"integritynoble/ELP-Unfolding","path":"scalable_ELP/scalable.py","file_url":"https://github.com/integritynoble/ELP-Unfolding/blob/HEAD/scalable_ELP/scalable.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, integritynoble/ELP-Unfolding when it was checked","code_sha256":"d9973247d799f7aa","code_sha256_prefix":"d9973247d799f7aa","mcp_get_code":{"code_sha256":"d9973247d799f7aa"}},{"arxiv_id":"2111.01007","arxiv_id_is_arxiv":true,"paper":"/paper/projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dome272/ProjectedGAN-pytorch","path":"projected_gan.py","file_url":"https://github.com/dome272/ProjectedGAN-pytorch/blob/HEAD/projected_gan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32d6c5741cfd6028","code_sha256_prefix":"32d6c5741cfd6028","mcp_get_code":{"code_sha256":"32d6c5741cfd6028"}},{"arxiv_id":"2110.15497","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-foreground-extraction-via-deep","title":"Unsupervised Foreground Extraction via Deep Region Competition","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yupeiyu98/deep-region-competition","path":"drc_workspace/src/models.py","file_url":"https://github.com/yupeiyu98/deep-region-competition/blob/HEAD/drc_workspace/src/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yupeiyu98/deep-region-competition when it was checked","code_sha256":"e976201ab6c52f60","code_sha256_prefix":"e976201ab6c52f60","mcp_get_code":{"code_sha256":"e976201ab6c52f60"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainingai-code/DDPM-Pytorch","path":"models/unet_base.py","file_url":"https://github.com/explainingai-code/DDPM-Pytorch/blob/HEAD/models/unet_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"044848eaf0604542","code_sha256_prefix":"044848eaf0604542","mcp_get_code":{"code_sha256":"044848eaf0604542"}},{"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":"westgate458/xb-net","path":"XBNet.py","file_url":"https://github.com/westgate458/xb-net/blob/HEAD/XBNet.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, westgate458/xb-net when it was checked","code_sha256":"6b4c6ed31fe9bf35","code_sha256_prefix":"6b4c6ed31fe9bf35","mcp_get_code":{"code_sha256":"6b4c6ed31fe9bf35"}},{"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":"EvaBr/AnatomyNets","path":"Networks.py","file_url":"https://github.com/EvaBr/AnatomyNets/blob/HEAD/Networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, EvaBr/AnatomyNets, is not in the permissive set Syntology serves inline","code_sha256":"d4334599c31d7c6c","code_sha256_prefix":"d4334599c31d7c6c","mcp_get_code":{"code_sha256":"d4334599c31d7c6c"}},{"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":"galprz/brain-tumor-segmentation","path":"src/models.py","file_url":"https://github.com/galprz/brain-tumor-segmentation/blob/HEAD/src/models.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, galprz/brain-tumor-segmentation when it was checked","code_sha256":"de7fbc68ed8272eb","code_sha256_prefix":"de7fbc68ed8272eb","mcp_get_code":{"code_sha256":"de7fbc68ed8272eb"}},{"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":"labmlai/annotated_deep_learning_paper_implementations","path":"labml_nn/diffusion/ddpm/unet.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/diffusion/ddpm/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de6ec1e2d99c332f","code_sha256_prefix":"de6ec1e2d99c332f","mcp_get_code":{"code_sha256":"de6ec1e2d99c332f"}},{"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":"johschmidt42/pytorch-2d-3d-unet-tutorial","path":"unet.py","file_url":"https://github.com/johschmidt42/pytorch-2d-3d-unet-tutorial/blob/HEAD/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3db48aa290294f3c","code_sha256_prefix":"3db48aa290294f3c","mcp_get_code":{"code_sha256":"3db48aa290294f3c"}},{"arxiv_id":"Ni_CHAIN_Enhancing_Generalization_in_Data-Efficient_GANs_via_lipsCHitz_continuity_constrAIned_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ni_CHAIN_Enhancing_Generalization_in_Data-Efficient_GANs_via_lipsCHitz_continuity_constrAIned_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MaxwellYaoNi/CHAIN","path":"FastGANDBig/chain_models.py","file_url":"https://github.com/MaxwellYaoNi/CHAIN/blob/HEAD/FastGANDBig/chain_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a2cb2800ec7d0de","code_sha256_prefix":"5a2cb2800ec7d0de","mcp_get_code":{"code_sha256":"5a2cb2800ec7d0de"}}],"record_sha256":"0146e8cbb936c4493955b2fad8f51c6a71d5127bee674e2dbc6add0d4a2880fb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}