{"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/lerp-clip","entry":"lerp_clip","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":8,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2408.08502","paper":"/paper/efficient-image-to-image-diffusion-classifier","title":"Efficient Image-to-Image Diffusion Classifier for Adversarial Robustness","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hfmei/idc","path":"IDC-BPDA/classifiers/attribute_net.py","file_url":"https://github.com/hfmei/idc/blob/HEAD/IDC-BPDA/classifiers/attribute_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"195d635db8eb778b","mcp_get_code":{"code_sha256":"195d635db8eb778b"}},{"arxiv_id":"2401.16352","paper":"/paper/adversarial-training-on-purification-atop","title":"Adversarial Training on Purification (AToP): Advancing Both Robustness and Generalization","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glin2022/atop","path":"classifiers/attribute_net.py","file_url":"https://github.com/glin2022/atop/blob/HEAD/classifiers/attribute_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"195d635db8eb778b","mcp_get_code":{"code_sha256":"195d635db8eb778b"}},{"arxiv_id":"2311.16124","paper":"/paper/diffattack-evasion-attacks-against-diffusion-1","title":"DiffAttack: Evasion Attacks Against Diffusion-Based Adversarial Purification","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangmintong/DiffAttack","path":"DiffAttack_DDPM_Based/classifiers/attribute_net.py","file_url":"https://github.com/kangmintong/DiffAttack/blob/HEAD/DiffAttack_DDPM_Based/classifiers/attribute_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"195d635db8eb778b","mcp_get_code":{"code_sha256":"195d635db8eb778b"}},{"arxiv_id":"2205.07460","paper":"/paper/diffusion-models-for-adversarial-purification","title":"Diffusion Models for Adversarial Purification","date":"2022-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chail/gan-ensembling","path":"networks/classifiers/attribute_classifier.py","file_url":"https://github.com/chail/gan-ensembling/blob/HEAD/networks/classifiers/attribute_classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"195d635db8eb778b","mcp_get_code":{"code_sha256":"195d635db8eb778b"}},{"arxiv_id":"1909.03935","paper":"/paper/gan-leaks-a-taxonomy-of-membership-inference","title":"GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/GAN-Leaks","path":"gan_models/pggan/networks.py","file_url":"https://github.com/DingfanChen/GAN-Leaks/blob/HEAD/gan_models/pggan/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e81789f8f2068c8","mcp_get_code":{"code_sha256":"6e81789f8f2068c8"}},{"arxiv_id":"1812.04948","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":"LignumResearch/stylewood-model-usage","path":"training/networks_progan.py","file_url":"https://github.com/LignumResearch/stylewood-model-usage/blob/HEAD/training/networks_progan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6e81789f8f2068c8","mcp_get_code":{"code_sha256":"6e81789f8f2068c8"}},{"arxiv_id":"1802.08797","paper":"/paper/residual-dense-network-for-image-super","title":"Residual Dense Network for Image Super-Resolution","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DivJAth/DeepLearning5922","path":"WorkerServer/progressive_gans/networks.py","file_url":"https://github.com/DivJAth/DeepLearning5922/blob/HEAD/WorkerServer/progressive_gans/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e81789f8f2068c8","mcp_get_code":{"code_sha256":"6e81789f8f2068c8"}},{"arxiv_id":"1710.10196","paper":"/paper/progressive-growing-of-gans-for-improved","title":"Progressive Growing of GANs for Improved Quality, Stability, and Variation","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NikhitaMethwani/Deep-Fakes-Cars-Generation","path":"networks.py","file_url":"https://github.com/NikhitaMethwani/Deep-Fakes-Cars-Generation/blob/HEAD/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e81789f8f2068c8","mcp_get_code":{"code_sha256":"6e81789f8f2068c8"}}]}