{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/generate-noise","entry":"generate_noise","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":5,"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":3,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2212.09994","paper":"/paper/towards-robustness-of-text-to-sql-models-3","title":"Towards Robustness of Text-to-SQL Models Against Natural and Realistic Adversarial Table Perturbation","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ContextualSP","path":"adaptershare/mt_dnn/perturbation.py","file_url":"https://github.com/microsoft/ContextualSP/blob/HEAD/adaptershare/mt_dnn/perturbation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"417ac95acb8c20b4","mcp_get_code":{"code_sha256":"417ac95acb8c20b4"}},{"arxiv_id":"2204.06625","paper":"/paper/camero-consistency-regularized-ensemble-of","title":"CAMERO: Consistency Regularized Ensemble of Perturbed Language Models with Weight Sharing","date":"2022-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cliang1453/CAMERO","path":"mt_dnn/perturbation.py","file_url":"https://github.com/cliang1453/CAMERO/blob/HEAD/mt_dnn/perturbation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"124f2519ccc332da","mcp_get_code":{"code_sha256":"124f2519ccc332da"}},{"arxiv_id":"2110.06274","paper":"/paper/list-lite-self-training-makes-efficient-few-1","title":"LiST: Lite Prompted Self-training Makes Parameter-Efficient Few-shot Learners","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/list","path":"src/models.py","file_url":"https://github.com/microsoft/list/blob/HEAD/src/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"417ac95acb8c20b4","mcp_get_code":{"code_sha256":"417ac95acb8c20b4"}},{"arxiv_id":"2110.02900","paper":"/paper/meta-internal-learning","title":"Meta Internal Learning","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RaphaelBensTAU/MetaInternalLearning","path":"utils/images.py","file_url":"https://github.com/RaphaelBensTAU/MetaInternalLearning/blob/HEAD/utils/images.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f2a37b5ec74f13c8","mcp_get_code":{"code_sha256":"f2a37b5ec74f13c8"}},{"arxiv_id":"2006.00176","paper":"/paper/when2com-multi-agent-perception-via","title":"When2com: Multi-Agent Perception via Communication Graph Grouping","date":"2020-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/MultiAgentPerception","path":"ptsemseg/process_img.py","file_url":"https://github.com/GT-RIPL/MultiAgentPerception/blob/HEAD/ptsemseg/process_img.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a381497cf6bcb48b","mcp_get_code":{"code_sha256":"a381497cf6bcb48b"}},{"arxiv_id":"1906.09230","paper":"/paper/modeling-and-forecasting-art-movements-with","title":"Modeling and Forecasting Art Movements with CGANs","date":"2019-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cganart/gan_art_2019","path":"CGAN_128.py","file_url":"https://github.com/cganart/gan_art_2019/blob/HEAD/CGAN_128.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bc57ac0ad951fe69","mcp_get_code":{"code_sha256":"bc57ac0ad951fe69"}},{"arxiv_id":"1406.2661","paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FrankwaP/pytorch-toy-GAN","path":"networks.py","file_url":"https://github.com/FrankwaP/pytorch-toy-GAN/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2b2be559123cb8d4","mcp_get_code":{"code_sha256":"2b2be559123cb8d4"}},{"arxiv_id":"2023.findings-emnlp.528","paper":null,"title":"arXiv:2023.findings-emnlp.528","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wjn1996/UPET","path":"model/prompt_for_sequence_classification.py","file_url":"https://github.com/wjn1996/UPET/blob/HEAD/model/prompt_for_sequence_classification.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"417ac95acb8c20b4","mcp_get_code":{"code_sha256":"417ac95acb8c20b4"}}]}