{"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/noise","entry":"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":17,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":6,"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":15,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":6,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":20,"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":4,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":3,"ran":4,"unverified":2},"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":"2503.21592","arxiv_id_is_arxiv":true,"paper":"/paper/critical-iterative-denoising-a-discrete","title":"Critical Iterative Denoising: A Discrete Generative Model Applied to Graphs","date":"2025-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoboget/sid","path":"sample.py","file_url":"https://github.com/yoboget/sid/blob/HEAD/sample.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, yoboget/sid when it was checked","code_sha256":"4db8d1e7069f11a5","code_sha256_prefix":"4db8d1e7069f11a5","mcp_get_code":{"code_sha256":"4db8d1e7069f11a5"}},{"arxiv_id":"2410.23996","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/disentangledssl","path":"synthetic_task/algorithms.py","file_url":"https://github.com/uhlerlab/disentangledssl/blob/HEAD/synthetic_task/algorithms.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, uhlerlab/disentangledssl when it was checked","code_sha256":"d36953754afe8bd1","code_sha256_prefix":"d36953754afe8bd1","mcp_get_code":{"code_sha256":"d36953754afe8bd1"}},{"arxiv_id":"2406.14440","arxiv_id_is_arxiv":true,"paper":"/paper/llm4cp-adapting-large-language-models-for","title":"LLM4CP: Adapting Large Language Models for Channel Prediction","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuboxun/LLM4CP","path":"data.py","file_url":"https://github.com/liuboxun/LLM4CP/blob/HEAD/data.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, liuboxun/LLM4CP when it was checked","code_sha256":"042402a6ccad0f67","code_sha256_prefix":"042402a6ccad0f67","mcp_get_code":{"code_sha256":"042402a6ccad0f67"}},{"arxiv_id":"2406.11779","arxiv_id_is_arxiv":true,"paper":"/paper/provable-guarantees-for-model-performance-via","title":"Compact Proofs of Model Performance via Mechanistic Interpretability","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JasonGross/guarantees-based-mechanistic-interpretability","path":"gbmi/exp_indhead/realmodeltest.py","file_url":"https://github.com/JasonGross/guarantees-based-mechanistic-interpretability/blob/HEAD/gbmi/exp_indhead/realmodeltest.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42b722deb4782413","code_sha256_prefix":"42b722deb4782413","mcp_get_code":{"code_sha256":"42b722deb4782413"}},{"arxiv_id":"2402.19091","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-representations-from-intermediate","title":"Leveraging Representations from Intermediate Encoder-blocks for Synthetic Image Detection","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mever-team/rine","path":"src/perturbation.py","file_url":"https://github.com/mever-team/rine/blob/HEAD/src/perturbation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98ee32fa8f79db2a","code_sha256_prefix":"98ee32fa8f79db2a","mcp_get_code":{"code_sha256":"98ee32fa8f79db2a"}},{"arxiv_id":"2310.05401","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-mcmc-sampling-from-flat-basins-with","title":"Entropy-MCMC: Sampling from Flat Basins with Ease","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lblaoke/emcmc","path":"exp/mnist_logistic_reg_emcmc.py","file_url":"https://github.com/lblaoke/emcmc/blob/HEAD/exp/mnist_logistic_reg_emcmc.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, lblaoke/emcmc when it was checked","code_sha256":"2e669216626c55b3","code_sha256_prefix":"2e669216626c55b3","mcp_get_code":{"code_sha256":"2e669216626c55b3"}},{"arxiv_id":"2310.05401","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-mcmc-sampling-from-flat-basins-with","title":"Entropy-MCMC: Sampling from Flat Basins with Ease","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lblaoke/emcmc","path":"exp/imagenet_sgld.py","file_url":"https://github.com/lblaoke/emcmc/blob/HEAD/exp/imagenet_sgld.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, lblaoke/emcmc when it was checked","code_sha256":"20f28b2642d8ffa2","code_sha256_prefix":"20f28b2642d8ffa2","mcp_get_code":{"code_sha256":"20f28b2642d8ffa2"}},{"arxiv_id":"2306.05268","arxiv_id_is_arxiv":true,"paper":"/paper/factorized-contrastive-learning-going-beyond","title":"Factorized Contrastive Learning: Going Beyond Multi-view Redundancy","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/FactorCL","path":"IRFL_model.py","file_url":"https://github.com/pliang279/FactorCL/blob/HEAD/IRFL_model.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":"3ba768516088431d","code_sha256_prefix":"3ba768516088431d","mcp_get_code":{"code_sha256":"3ba768516088431d"}},{"arxiv_id":"2010.10258","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-autoregressive-modeling-for-1","title":"Hierarchical Autoregressive Modeling for Neural Video Compression","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buggyyang/hier-video-compression","path":"models.py","file_url":"https://github.com/buggyyang/hier-video-compression/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, buggyyang/hier-video-compression when it was checked","code_sha256":"5499218583ec12e3","code_sha256_prefix":"5499218583ec12e3","mcp_get_code":{"code_sha256":"5499218583ec12e3"}},{"arxiv_id":"2003.08685","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-frequency-analysis-for-deep-fake","title":"Leveraging Frequency Analysis for Deep Fake Image Recognition","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUB-SysSec/GANDCTAnalysis","path":"create_perturbed_imagedata.py","file_url":"https://github.com/RUB-SysSec/GANDCTAnalysis/blob/HEAD/create_perturbed_imagedata.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98ee32fa8f79db2a","code_sha256_prefix":"98ee32fa8f79db2a","mcp_get_code":{"code_sha256":"98ee32fa8f79db2a"}},{"arxiv_id":"1912.04958","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-image-quality-of","title":"Analyzing and Improving the Image Quality of StyleGAN","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manicman1999/StyleGAN2-Tensorflow-2.0","path":"stylegan_two.py","file_url":"https://github.com/manicman1999/StyleGAN2-Tensorflow-2.0/blob/HEAD/stylegan_two.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":"8af2f60798b76e8c","code_sha256_prefix":"8af2f60798b76e8c","mcp_get_code":{"code_sha256":"8af2f60798b76e8c"}},{"arxiv_id":"1903.07291","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-image-synthesis-with-spatially","title":"Semantic Image Synthesis with Spatially-Adaptive Normalization","date":"2019-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manicman1999/StyleGAN-Keras","path":"stylegan.py","file_url":"https://github.com/manicman1999/StyleGAN-Keras/blob/HEAD/stylegan.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":"62432992de807ab4","code_sha256_prefix":"62432992de807ab4","mcp_get_code":{"code_sha256":"62432992de807ab4"}},{"arxiv_id":"1903.06048","arxiv_id_is_arxiv":true,"paper":"/paper/msg-gan-multi-scale-gradients-gan-for-more","title":"MSG-GAN: Multi-Scale Gradients for Generative Adversarial Networks","date":"2019-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manicman1999/StyleGAN-Tensorflow-2.0","path":"stylegan.py","file_url":"https://github.com/manicman1999/StyleGAN-Tensorflow-2.0/blob/HEAD/stylegan.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":"8af2f60798b76e8c","code_sha256_prefix":"8af2f60798b76e8c","mcp_get_code":{"code_sha256":"8af2f60798b76e8c"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","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":true,"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":"8af2f60798b76e8c","code_sha256_prefix":"8af2f60798b76e8c","mcp_get_code":{"code_sha256":"8af2f60798b76e8c"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkulaczkowski/mixedstylegan","path":"mixed-stylegan.py","file_url":"https://github.com/mkulaczkowski/mixedstylegan/blob/HEAD/mixed-stylegan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aae23321c69d4e23","code_sha256_prefix":"aae23321c69d4e23","mcp_get_code":{"code_sha256":"aae23321c69d4e23"}},{"arxiv_id":"1804.01523","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-adversarial-video-prediction","title":"Stochastic Adversarial Video Prediction","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bonennult/video_prediction","path":"video_prediction/models/mocogan_model.py","file_url":"https://github.com/Bonennult/video_prediction/blob/HEAD/video_prediction/models/mocogan_model.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":"02fded9160d71360","code_sha256_prefix":"02fded9160d71360","mcp_get_code":{"code_sha256":"02fded9160d71360"}},{"arxiv_id":"1703.06953","arxiv_id_is_arxiv":true,"paper":"/paper/multi-style-generative-network-for-real-time","title":"Multi-style Generative Network for Real-time Transfer","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"habout632/gans","path":"experiments/image_generation/gans/cgan.py","file_url":"https://github.com/habout632/gans/blob/HEAD/experiments/image_generation/gans/cgan.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":"2193a8e5441cfb68","code_sha256_prefix":"2193a8e5441cfb68","mcp_get_code":{"code_sha256":"2193a8e5441cfb68"}},{"arxiv_id":"1703.06953","arxiv_id_is_arxiv":true,"paper":"/paper/multi-style-generative-network-for-real-time","title":"Multi-style Generative Network for Real-time Transfer","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"habout632/gans","path":"experiments/image_generation/gans/dcgan.py","file_url":"https://github.com/habout632/gans/blob/HEAD/experiments/image_generation/gans/dcgan.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":"efb95cb76ecae277","code_sha256_prefix":"efb95cb76ecae277","mcp_get_code":{"code_sha256":"efb95cb76ecae277"}},{"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":"safwankdb/Wasserstein-GAN","path":"wgan.py","file_url":"https://github.com/safwankdb/Wasserstein-GAN/blob/HEAD/wgan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, safwankdb/Wasserstein-GAN when it was checked","code_sha256":"9dd51c421620b70a","code_sha256_prefix":"9dd51c421620b70a","mcp_get_code":{"code_sha256":"9dd51c421620b70a"}},{"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":"safwankdb/Vanilla-GAN","path":"vanilla_gan.py","file_url":"https://github.com/safwankdb/Vanilla-GAN/blob/HEAD/vanilla_gan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, safwankdb/Vanilla-GAN when it was checked","code_sha256":"80deccecb808a61e","code_sha256_prefix":"80deccecb808a61e","mcp_get_code":{"code_sha256":"80deccecb808a61e"}}],"record_sha256":"ae74dc045591229021374bb4746dc5bc6c649b199db4766d60cfa9f71e73cb4f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}