{"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/sample-noise","entry":"sample_noise","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":11,"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":5,"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":"2303.11989","arxiv_id_is_arxiv":true,"paper":"/paper/text2room-extracting-textured-3d-meshes-from","title":"Text2Room: Extracting Textured 3D Meshes from 2D Text-to-Image Models","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukashoel/text2room","path":"model/trajectories/pose_noise_util.py","file_url":"https://github.com/lukashoel/text2room/blob/HEAD/model/trajectories/pose_noise_util.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":"e6fffec018d7dd86","code_sha256_prefix":"e6fffec018d7dd86","mcp_get_code":{"code_sha256":"e6fffec018d7dd86"}},{"arxiv_id":"2001.03994","arxiv_id_is_arxiv":true,"paper":"/paper/fast-is-better-than-free-revisiting-1","title":"Fast is better than free: Revisiting adversarial training","date":"2020-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MetaSolver/icml2021","path":"sopa/src/solvers/utils.py","file_url":"https://github.com/MetaSolver/icml2021/blob/HEAD/sopa/src/solvers/utils.py","status":"ran","verification_level":1,"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":"1a22911f27fa7a50","code_sha256_prefix":"1a22911f27fa7a50","mcp_get_code":{"code_sha256":"1a22911f27fa7a50"}},{"arxiv_id":"1906.01529","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks-a-survey-and","title":"Generative Adversarial Networks in Computer Vision: A Survey and Taxonomy","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wileyw/DeepLearningDemos","path":"CycleGANSolution/a4-code-v2-updated/model_checker.py","file_url":"https://github.com/wileyw/DeepLearningDemos/blob/HEAD/CycleGANSolution/a4-code-v2-updated/model_checker.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":"2356434146f46c0d","code_sha256_prefix":"2356434146f46c0d","mcp_get_code":{"code_sha256":"2356434146f46c0d"}},{"arxiv_id":"1906.01529","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks-a-survey-and","title":"Generative Adversarial Networks in Computer Vision: A Survey and Taxonomy","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wileyw/DeepLearningDemos","path":"GAN/vanilla_gan.py","file_url":"https://github.com/wileyw/DeepLearningDemos/blob/HEAD/GAN/vanilla_gan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b6536d1407cac83","code_sha256_prefix":"5b6536d1407cac83","mcp_get_code":{"code_sha256":"5b6536d1407cac83"}},{"arxiv_id":"1811.04757","arxiv_id_is_arxiv":true,"paper":"/paper/dtm-based-filtrations","title":"DTM-based Filtrations","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"GUDHI/TDA-tutorial","path":"tutorials/utils/utils_epd.py","file_url":"https://github.com/GUDHI/TDA-tutorial/blob/HEAD/tutorials/utils/utils_epd.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":"a8315cc4eabef8cd","code_sha256_prefix":"a8315cc4eabef8cd","mcp_get_code":{"code_sha256":"a8315cc4eabef8cd"}},{"arxiv_id":"1704.00028","arxiv_id_is_arxiv":true,"paper":"/paper/improved-training-of-wasserstein-gans","title":"Improved Training of Wasserstein GANs","date":"2017-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Improved_Training_of_Wasserstein_GANs/wgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Improved_Training_of_Wasserstein_GANs/wgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4e891b5ef55d07","code_sha256_prefix":"1d4e891b5ef55d07","mcp_get_code":{"code_sha256":"1d4e891b5ef55d07"}},{"arxiv_id":"1701.07875","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Wasserstein_GAN/wgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Wasserstein_GAN/wgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"561c628f77383ba9","code_sha256_prefix":"561c628f77383ba9","mcp_get_code":{"code_sha256":"561c628f77383ba9"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Conditional_Generative_Adversarial_Nets/cgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Conditional_Generative_Adversarial_Nets/cgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9444146b0abd7cd9","code_sha256_prefix":"9444146b0abd7cd9","mcp_get_code":{"code_sha256":"9444146b0abd7cd9"}},{"arxiv_id":"1611.04076","arxiv_id_is_arxiv":true,"paper":"/paper/least-squares-generative-adversarial-networks","title":"Least Squares Generative Adversarial Networks","date":"2016-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Least_Squares_Generative_Adversarial_Networks/lsgan.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Least_Squares_Generative_Adversarial_Networks/lsgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cbc13ef676058576","code_sha256_prefix":"cbc13ef676058576","mcp_get_code":{"code_sha256":"cbc13ef676058576"}},{"arxiv_id":"1411.1784","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-generative-adversarial-nets","title":"Conditional Generative Adversarial Nets","date":"2014-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9444146b0abd7cd9","code_sha256_prefix":"9444146b0abd7cd9","mcp_get_code":{"code_sha256":"9444146b0abd7cd9"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Generative_Adversarial_Networks/GANs.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Generative_Adversarial_Networks/GANs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aebc0f62fe361939","code_sha256_prefix":"aebc0f62fe361939","mcp_get_code":{"code_sha256":"aebc0f62fe361939"}}],"record_sha256":"16521b9f099f778930d62974ee123ee3adc20abd061a482dc4ce0b9a68de2888","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}