{"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/unetgenerator","entry":"UnetGenerator","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":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1},"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":"2509.19947","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19947","title":"A Set of Generalized Components to Achieve Effective Poison-only Clean-label Backdoor Attacks with Collaborative Sample Selection and Triggers","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"HITSZ-wzx/GeneralComponents","path":"utils.py","file_url":"https://github.com/HITSZ-wzx/GeneralComponents/blob/HEAD/utils.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, HITSZ-wzx/GeneralComponents when it was checked","code_sha256":"18de75898aec0808","code_sha256_prefix":"18de75898aec0808","mcp_get_code":{"code_sha256":"18de75898aec0808"}},{"arxiv_id":"2309.16351","arxiv_id_is_arxiv":true,"paper":"/paper/dark-side-augmentation-generating-diverse-1","title":"Dark Side Augmentation: Generating Diverse Night Examples for Metric Learning","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohwald/gandtr","path":"mdir/components/model/network/p2p_networks.py","file_url":"https://github.com/mohwald/gandtr/blob/HEAD/mdir/components/model/network/p2p_networks.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":"e5a7558718798606","code_sha256_prefix":"e5a7558718798606","mcp_get_code":{"code_sha256":"e5a7558718798606"}},{"arxiv_id":"2204.13656","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-multi-modal-medical-image","title":"Unsupervised Multi-Modal Medical Image Registration via Discriminator-Free Image-to-Image Translation","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heyblackC/DFMIR","path":"models/networks.py","file_url":"https://github.com/heyblackC/DFMIR/blob/HEAD/models/networks.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, heyblackC/DFMIR when it was checked","code_sha256":"6622a698d50ddaf9","code_sha256_prefix":"6622a698d50ddaf9","mcp_get_code":{"code_sha256":"6622a698d50ddaf9"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liaoguiqiu/DeepContour","path":"DeepContour/model/networks.py","file_url":"https://github.com/liaoguiqiu/DeepContour/blob/HEAD/DeepContour/model/networks.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, liaoguiqiu/DeepContour when it was checked","code_sha256":"4607de09c7c7d0e2","code_sha256_prefix":"4607de09c7c7d0e2","mcp_get_code":{"code_sha256":"4607de09c7c7d0e2"}},{"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":"nbouteldja/kidneystaintranslation","path":"models/networks.py","file_url":"https://github.com/nbouteldja/kidneystaintranslation/blob/HEAD/models/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, nbouteldja/kidneystaintranslation, is not in the permissive set Syntology serves inline","code_sha256":"bef8b47f65bbc179","code_sha256_prefix":"bef8b47f65bbc179","mcp_get_code":{"code_sha256":"bef8b47f65bbc179"}},{"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":"lrr-rachel/PCDUNet","path":"networks.py","file_url":"https://github.com/lrr-rachel/PCDUNet/blob/HEAD/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18a8374d4a1035b1","code_sha256_prefix":"18a8374d4a1035b1","mcp_get_code":{"code_sha256":"18a8374d4a1035b1"}}],"record_sha256":"26782995685f5169da6d4779f325bce2c4d6198baad5756cd53801558bc0d9d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}