{"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/check-for-attack-success","entry":"check_for_attack_success","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":3,"unverified":0},"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":"2603.03081","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03081","title":"TAO-Attack: Toward Advanced Optimization-Based Jailbreak Attacks for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ZevineXu/TAO-Attack","path":"attack.py","file_url":"https://github.com/ZevineXu/TAO-Attack/blob/HEAD/attack.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":"2b431b29ac3d458c","code_sha256_prefix":"2b431b29ac3d458c","mcp_get_code":{"code_sha256":"2b431b29ac3d458c"}},{"arxiv_id":"2406.01288","arxiv_id_is_arxiv":true,"paper":"/paper/improved-few-shot-jailbreaking-can-circumvent","title":"Improved Few-Shot Jailbreaking Can Circumvent Aligned Language Models and Their Defenses","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/I-FSJ","path":"exps/rs.py","file_url":"https://github.com/sail-sg/I-FSJ/blob/HEAD/exps/rs.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":"a2058f7fc99001a7","code_sha256_prefix":"a2058f7fc99001a7","mcp_get_code":{"code_sha256":"a2058f7fc99001a7"}},{"arxiv_id":"2405.21018","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-optimization-based","title":"Improved Techniques for Optimization-Based Jailbreaking on Large Language Models","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiaojunQAQ/I-GCG","path":"attack_llm_core_best_update_our_target.py","file_url":"https://github.com/jiaxiaojunQAQ/I-GCG/blob/HEAD/attack_llm_core_best_update_our_target.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiaxiaojunQAQ/I-GCG when it was checked","code_sha256":"3e43a8aedf0a2745","code_sha256_prefix":"3e43a8aedf0a2745","mcp_get_code":{"code_sha256":"3e43a8aedf0a2745"}},{"arxiv_id":"2405.01229","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-jailbreak-attack-with-momentum","title":"Boosting Jailbreak Attack with Momentum","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weizeming/momentum-attack-llm","path":"gcg.py","file_url":"https://github.com/weizeming/momentum-attack-llm/blob/HEAD/gcg.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, weizeming/momentum-attack-llm when it was checked","code_sha256":"3f2d43822911360c","code_sha256_prefix":"3f2d43822911360c","mcp_get_code":{"code_sha256":"3f2d43822911360c"}},{"arxiv_id":"2403.04957","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-and-universal-prompt-injection","title":"Automatic and Universal Prompt Injection Attacks against Large Language Models","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheltonliu-n/universal-prompt-injection","path":"universal_prompt_injection.py","file_url":"https://github.com/sheltonliu-n/universal-prompt-injection/blob/HEAD/universal_prompt_injection.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a1925d40005947b","code_sha256_prefix":"7a1925d40005947b","mcp_get_code":{"code_sha256":"7a1925d40005947b"}},{"arxiv_id":"2310.04451","arxiv_id_is_arxiv":true,"paper":"/paper/autodan-generating-stealthy-jailbreak-prompts","title":"AutoDAN: Generating Stealthy Jailbreak Prompts on Aligned Large Language Models","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SheltonLiu-N/AutoDAN","path":"autodan_ga_eval.py","file_url":"https://github.com/SheltonLiu-N/AutoDAN/blob/HEAD/autodan_ga_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a1925d40005947b","code_sha256_prefix":"7a1925d40005947b","mcp_get_code":{"code_sha256":"7a1925d40005947b"}}],"record_sha256":"c18727860c95b22a4008932a1d945c470f70a04886942372bad710c21d3e2167","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}