{"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/replicate-input","entry":"replicate_input","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":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":2,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"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":"2606.02267","paper":"/paper/arxiv-2606-02267","title":"A combination of noise and bilateral filters achieve supralinear and scalable adversarial robustness in CNNs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wzekai99/DM-Improves-AT","path":"core/attacks/utils.py","file_url":"https://github.com/wzekai99/DM-Improves-AT/blob/HEAD/core/attacks/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2406.13283","paper":"/paper/large-scale-dataset-pruning-in-adversarial","title":"Large-Scale Dataset Pruning in Adversarial Training through Data Importance Extrapolation","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BjoernNieth/LS-Dataset-pruning-in-AT","path":"core/attacks/utils.py","file_url":"https://github.com/BjoernNieth/LS-Dataset-pruning-in-AT/blob/HEAD/core/attacks/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2405.16260","paper":"/paper/enhancing-consistency-based-image-generation","title":"Enhancing Consistency-Based Image Generation via Adversarialy-Trained Classification and Energy-Based Discrimination","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shelley-Golan/Boosting-via-Joint-Model","path":"adversaries.py","file_url":"https://github.com/Shelley-Golan/Boosting-via-Joint-Model/blob/HEAD/adversaries.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2302.03015","paper":"/paper/exploring-and-exploiting-decision-boundary","title":"Exploring and Exploiting Decision Boundary Dynamics for Adversarial Robustness","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuancheng-xu/dynamics-aware-robust-training","path":"core/DyART/DyART_Linf.py","file_url":"https://github.com/yuancheng-xu/dynamics-aware-robust-training/blob/HEAD/core/DyART/DyART_Linf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e78e41a8926dc30","mcp_get_code":{"code_sha256":"4e78e41a8926dc30"}},{"arxiv_id":"2110.09468","paper":"/paper/improving-robustness-using-generated-data","title":"Improving Robustness using Generated Data","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imrahulr/adversarial_robustness_pytorch","path":"core/attacks/utils.py","file_url":"https://github.com/imrahulr/adversarial_robustness_pytorch/blob/HEAD/core/attacks/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}}]}