{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/attacker","entry":"Attacker","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":3,"n_samples_constructed":2,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2608.09542","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-09542","title":"Dual-Adversarial Safety Alignment: Cultivating Intrinsic Threat Comprehension in LRMs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"renmiamu/AdvSafe","path":"src/agent/attacker.py","file_url":"https://github.com/renmiamu/AdvSafe/blob/HEAD/src/agent/attacker.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"528b86b6bc65a5ae","code_sha256_prefix":"528b86b6bc65a5ae","mcp_get_code":{"code_sha256":"528b86b6bc65a5ae"}},{"arxiv_id":"2605.26595","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26595","title":"CORDYCEPS: Covert Control Attacks on LLMs via Data Poisoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Sadcardation/cordyceps","path":"Open-Prompt-Injection/OpenPromptInjection/attackers/SleeperAttacker.py","file_url":"https://github.com/Sadcardation/cordyceps/blob/HEAD/Open-Prompt-Injection/OpenPromptInjection/attackers/SleeperAttacker.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ab09600faafb4d4","code_sha256_prefix":"1ab09600faafb4d4","mcp_get_code":{"code_sha256":"1ab09600faafb4d4"}},{"arxiv_id":"2605.00974","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00974","title":"SRTJ: Self-Evolving Rule-Driven Training-Free LLM Jailbreaking","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TheSolkatt/SRTJ","path":"src/attacker.py","file_url":"https://github.com/TheSolkatt/SRTJ/blob/HEAD/src/attacker.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TheSolkatt/SRTJ when it was checked","code_sha256":"b6a850495a7e70fb","code_sha256_prefix":"b6a850495a7e70fb","mcp_get_code":{"code_sha256":"b6a850495a7e70fb"}},{"arxiv_id":"2410.02195","arxiv_id_is_arxiv":true,"paper":"/paper/backtime-backdoor-attacks-on-multivariate","title":"BACKTIME: Backdoor Attacks on Multivariate Time Series Forecasting","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaolin-cs/backtime","path":"attack.py","file_url":"https://github.com/xiaolin-cs/backtime/blob/HEAD/attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiaolin-cs/backtime when it was checked","code_sha256":"a0458a9d0f3f116c","code_sha256_prefix":"a0458a9d0f3f116c","mcp_get_code":{"code_sha256":"a0458a9d0f3f116c"}},{"arxiv_id":"2409.05021","arxiv_id_is_arxiv":true,"paper":"/paper/vision-fused-attack-advancing-aggressive-and","title":"Vision-fused Attack: Advancing Aggressive and Stealthy Adversarial Text against Neural Machine Translation","date":"2024-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levelower/VFA","path":"attack.py","file_url":"https://github.com/Levelower/VFA/blob/HEAD/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Levelower/VFA when it was checked","code_sha256":"b13d2218dfb23d83","code_sha256_prefix":"b13d2218dfb23d83","mcp_get_code":{"code_sha256":"b13d2218dfb23d83"}},{"arxiv_id":"2111.09277","arxiv_id_is_arxiv":true,"paper":"/paper/smoothmix-training-confidence-calibrated","title":"SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustness","date":"2021-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jh-jeong/smoothmix","path":"code/train_consistency.py","file_url":"https://github.com/jh-jeong/smoothmix/blob/HEAD/code/train_consistency.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dff4428e257e2940","code_sha256_prefix":"dff4428e257e2940","mcp_get_code":{"code_sha256":"dff4428e257e2940"}},{"arxiv_id":"2106.05087","arxiv_id_is_arxiv":true,"paper":"/paper/who-is-the-strongest-enemy-towards-optimal","title":"Who Is the Strongest Enemy? Towards Optimal and Efficient Evasion Attacks in Deep RL","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/paad_adv_rl","path":"code_atari/paad_rl/attacker/attacker.py","file_url":"https://github.com/umd-huang-lab/paad_adv_rl/blob/HEAD/code_atari/paad_rl/attacker/attacker.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, umd-huang-lab/paad_adv_rl when it was checked","code_sha256":"942887ec27de2b72","code_sha256_prefix":"942887ec27de2b72","mcp_get_code":{"code_sha256":"942887ec27de2b72"}},{"arxiv_id":"2102.05096","arxiv_id_is_arxiv":true,"paper":"/paper/adversarially-robust-classifier-with","title":"Towards Bridging the gap between Empirical and Certified Robustness against Adversarial Examples","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hadisalman/smoothing-adversarial","path":"code/train_pgd.py","file_url":"https://github.com/Hadisalman/smoothing-adversarial/blob/HEAD/code/train_pgd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"156c1e3dc785672c","code_sha256_prefix":"156c1e3dc785672c","mcp_get_code":{"code_sha256":"156c1e3dc785672c"}}],"record_sha256":"18a75b279aaa9d329200984d8f8dd2b1870a3a285744fa95262d556e677df56a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}