{"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/pgdattack","entry":"PGDAttack","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":5,"n_papers_ran":2,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2607.12354","paper":"/paper/arxiv-2607-12354","title":"Reducing information dependency does not cause training data privacy. Adversarially non-robust features do","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"BreuerLabs/Anti-Adversarial-Training","path":"defenses/adversarial_train.py","file_url":"https://github.com/BreuerLabs/Anti-Adversarial-Training/blob/HEAD/defenses/adversarial_train.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"abbba5e686773648","mcp_get_code":{"code_sha256":"abbba5e686773648"}},{"arxiv_id":"2403.17343","paper":"/paper/language-models-are-free-boosters-for","title":"Residual-based Language Models are Free Boosters for Biomedical Imaging","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixinlai/llmboostmedical","path":"2D_classification/engine.py","file_url":"https://github.com/zhixinlai/llmboostmedical/blob/HEAD/2D_classification/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58ab30e8c22165b6","mcp_get_code":{"code_sha256":"58ab30e8c22165b6"}},{"arxiv_id":"2310.12973","paper":"/paper/frozen-transformers-in-language-models-are","title":"Frozen Transformers in Language Models Are Effective Visual Encoder Layers","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqipang/lm4visualencoding","path":"image_classification/engine.py","file_url":"https://github.com/ziqipang/lm4visualencoding/blob/HEAD/image_classification/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58ab30e8c22165b6","mcp_get_code":{"code_sha256":"58ab30e8c22165b6"}},{"arxiv_id":"2306.09104","paper":"/paper/on-strengthening-and-defending-graph","title":"On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/mc-gra","path":"MC-GRA/topology_attack.py","file_url":"https://github.com/tmlr-group/mc-gra/blob/HEAD/MC-GRA/topology_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20859a342af81901","mcp_get_code":{"code_sha256":"20859a342af81901"}},{"arxiv_id":"Guo_Improving_Robustness_of_Vision_Transformers_by_Reducing_Sensitivity_To_Patch_CVPR_2023_paper","paper":null,"title":"arXiv:Guo_Improving_Robustness_of_Vision_Transformers_by_Reducing_Sensitivity_To_Patch_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"guoyongcs/RSPC","path":"RSPC_RVT/engine.py","file_url":"https://github.com/guoyongcs/RSPC/blob/HEAD/RSPC_RVT/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58ab30e8c22165b6","mcp_get_code":{"code_sha256":"58ab30e8c22165b6"}}]}