{"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/baseattack","entry":"BaseAttack","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":6,"n_papers_ran":4,"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":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":2},"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":"2311.06423","paper":"/paper/flatness-aware-adversarial-attack","title":"Transferability Bound Theory: Exploring Relationship between Adversarial Transferability and Flatness","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmy266/tpa","path":"toolkit/adv/attack.py","file_url":"https://github.com/fmy266/tpa/blob/HEAD/toolkit/adv/attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6fbe88d522599801","mcp_get_code":{"code_sha256":"6fbe88d522599801"}},{"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":"27b61ad1437b1f9c","mcp_get_code":{"code_sha256":"27b61ad1437b1f9c"}},{"arxiv_id":"2210.02041","paper":"/paper/natural-color-fool-towards-boosting-black-box","title":"Natural Color Fool: Towards Boosting Black-box Unrestricted Attacks","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ylhz/natural-color-fool","path":"torch_attack/attacks/NCF.py","file_url":"https://github.com/ylhz/natural-color-fool/blob/HEAD/torch_attack/attacks/NCF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8db1b381814078f3","mcp_get_code":{"code_sha256":"8db1b381814078f3"}},{"arxiv_id":"2203.15859","paper":"/paper/nicgslowdown-evaluating-the-efficiency","title":"NICGSlowDown: Evaluating the Efficiency Robustness of Neural Image Caption Generation Models","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seekingdream/nicgslowdown","path":"src/attack/slowdown.py","file_url":"https://github.com/seekingdream/nicgslowdown/blob/HEAD/src/attack/slowdown.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"137934608a3ebb13","mcp_get_code":{"code_sha256":"137934608a3ebb13"}},{"arxiv_id":"2106.08970","paper":"/paper/sleeper-agent-scalable-hidden-trigger","title":"Sleeper Agent: Scalable Hidden Trigger Backdoors for Neural Networks Trained from Scratch","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsouri/Sleeper-Agent","path":"forest/victims/batched_attacks.py","file_url":"https://github.com/hsouri/Sleeper-Agent/blob/HEAD/forest/victims/batched_attacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"34911817e88e224a","mcp_get_code":{"code_sha256":"34911817e88e224a"}},{"arxiv_id":"2106.02820","paper":"/paper/graphmi-extracting-private-graph-data-from","title":"GraphMI: Extracting Private Graph Data from Graph Neural Networks","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaixizhang/GraphMI","path":"base_attack.py","file_url":"https://github.com/zaixizhang/GraphMI/blob/HEAD/base_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4401c0d2d1104076","mcp_get_code":{"code_sha256":"4401c0d2d1104076"}}]}