{"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/get-nonascii-toks","entry":"get_nonascii_toks","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2605.08876","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08876","title":"OTora: A Unified Red Teaming Framework for Reasoning-Level Denial-of-Service in LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"llm2409/OTora","path":"otora/utils.py","file_url":"https://github.com/llm2409/OTora/blob/HEAD/otora/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eee6a5743037193d","code_sha256_prefix":"eee6a5743037193d","mcp_get_code":{"code_sha256":"eee6a5743037193d"}},{"arxiv_id":"2410.05451","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-llms-to-be-robust-against-prompt","title":"SecAlign: Defending Against Prompt Injection with Preference Optimization","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/secalign","path":"advprompter/utils.py","file_url":"https://github.com/facebookresearch/secalign/blob/HEAD/advprompter/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/secalign (NOASSERTION)","code_sha256":"6ee64cc227326973","code_sha256_prefix":"6ee64cc227326973","mcp_get_code":{"code_sha256":"6ee64cc227326973"}},{"arxiv_id":"2408.14866","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-adversarial-suffix-transfer","title":"Advancing Adversarial Suffix Transfer Learning on Aligned Large Language Models","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waffle-Liu/DeGCG","path":"baselines/gcg/gcg_utils.py","file_url":"https://github.com/Waffle-Liu/DeGCG/blob/HEAD/baselines/gcg/gcg_utils.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":"400ada600d105b0a","code_sha256_prefix":"400ada600d105b0a","mcp_get_code":{"code_sha256":"400ada600d105b0a"}},{"arxiv_id":"2405.18780","arxiv_id_is_arxiv":true,"paper":"/paper/quantitative-certification-of-bias-in-large","title":"Quantitative Certification of Bias in Large Language Models","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuc-focal-lab/LLMCert-B","path":"utils_api.py","file_url":"https://github.com/uiuc-focal-lab/LLMCert-B/blob/HEAD/utils_api.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, uiuc-focal-lab/LLMCert-B, is not in the permissive set Syntology serves inline","code_sha256":"8d62b2cc64e63739","code_sha256_prefix":"8d62b2cc64e63739","mcp_get_code":{"code_sha256":"8d62b2cc64e63739"}},{"arxiv_id":"2404.07981","arxiv_id_is_arxiv":true,"paper":"/paper/manipulating-large-language-models-to","title":"Manipulating Large Language Models to Increase Product Visibility","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aounon/llm-rank-optimizer","path":"tools.py","file_url":"https://github.com/aounon/llm-rank-optimizer/blob/HEAD/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"917ac97cb67e17b3","code_sha256_prefix":"917ac97cb67e17b3","mcp_get_code":{"code_sha256":"917ac97cb67e17b3"}},{"arxiv_id":"2402.09154","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-large-language-models-with","title":"Attacking Large Language Models with Projected Gradient Descent","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigeisler/reinforce-attacks-llms","path":"baselines/reinforce/gcg_utils.py","file_url":"https://github.com/sigeisler/reinforce-attacks-llms/blob/HEAD/baselines/reinforce/gcg_utils.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":"400ada600d105b0a","code_sha256_prefix":"400ada600d105b0a","mcp_get_code":{"code_sha256":"400ada600d105b0a"}},{"arxiv_id":"2307.15043","arxiv_id_is_arxiv":true,"paper":"/paper/universal-and-transferable-adversarial","title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grayswanai/nanogcg","path":"nanogcg/gcg.py","file_url":"https://github.com/grayswanai/nanogcg/blob/HEAD/nanogcg/gcg.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"726e8111ce3c1903","code_sha256_prefix":"726e8111ce3c1903","mcp_get_code":{"code_sha256":"726e8111ce3c1903"}}],"record_sha256":"b8f42c1bf710cc2a7f0e09152eaa0dae49ce0030a2f6a538d55caf046b2566c5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}