{"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/safe-name","entry":"safe_name","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":8,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":7,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":8,"n_places_pointer_only":5,"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":7,"ran_fixture":0,"ran":1,"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":"2608.08212","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08212","title":"Harmful Content Is Not Enough: Continuation Framing Moderates In-Context Emergent Misalignment","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"PeiYangLiu/icl-em-format-control","path":"run_trapi_one_model.py","file_url":"https://github.com/PeiYangLiu/icl-em-format-control/blob/HEAD/run_trapi_one_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PeiYangLiu/icl-em-format-control when it was checked","code_sha256":"0386101e4907b649","code_sha256_prefix":"0386101e4907b649","mcp_get_code":{"code_sha256":"0386101e4907b649"}},{"arxiv_id":"2608.01678","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01678","title":"Progressive Agent Skill Generation via Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ejhshen/skill-alpha","path":"src/inference/eval_skill_alpha.py","file_url":"https://github.com/ejhshen/skill-alpha/blob/HEAD/src/inference/eval_skill_alpha.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b4244ff26f7c693","code_sha256_prefix":"5b4244ff26f7c693","mcp_get_code":{"code_sha256":"5b4244ff26f7c693"}},{"arxiv_id":"2608.01358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01358","title":"HopRefusalBench: Diagnosing Refusal Failures in Search-Augmented Agents for Multi-Hop Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"JiananXie/HopRefusalBench","path":"run_experiment.py","file_url":"https://github.com/JiananXie/HopRefusalBench/blob/HEAD/run_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JiananXie/HopRefusalBench when it was checked","code_sha256":"4185b30c8b8be6cd","code_sha256_prefix":"4185b30c8b8be6cd","mcp_get_code":{"code_sha256":"4185b30c8b8be6cd"}},{"arxiv_id":"2606.31036","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31036","title":"Teaching LLMs to Recommend and Defer in Underrepresented Epilepsy Care","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"roychowdhuryresearch/Manana","path":"manana/datasets.py","file_url":"https://github.com/roychowdhuryresearch/Manana/blob/HEAD/manana/datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, roychowdhuryresearch/Manana when it was checked","code_sha256":"498d16712e3d8898","code_sha256_prefix":"498d16712e3d8898","mcp_get_code":{"code_sha256":"498d16712e3d8898"}},{"arxiv_id":"2606.29920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29920","title":"Can LLM-as-a-Judge Reliably Verify Rubrics in Agentic Scenarios?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"THU-KEG/RuVerBench","path":"code/run_judges/deepresearch_runner.py","file_url":"https://github.com/THU-KEG/RuVerBench/blob/HEAD/code/run_judges/deepresearch_runner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, THU-KEG/RuVerBench (NOASSERTION)","code_sha256":"870de96e45399ea3","code_sha256_prefix":"870de96e45399ea3","mcp_get_code":{"code_sha256":"870de96e45399ea3"}},{"arxiv_id":"2602.01539","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01539","title":"MAGIC: A Co-Evolving Attacker-Defender Adversarial Game for Robust LLM Safety","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"BattleWen/MAGIC","path":"eval/OpenRT/eval_async.py","file_url":"https://github.com/BattleWen/MAGIC/blob/HEAD/eval/OpenRT/eval_async.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60a3bf42198e606e","code_sha256_prefix":"60a3bf42198e606e","mcp_get_code":{"code_sha256":"60a3bf42198e606e"}},{"arxiv_id":"2406.05590","arxiv_id_is_arxiv":true,"paper":"/paper/nyu-ctf-dataset-a-scalable-open-source","title":"NYU CTF Bench: A Scalable Open-Source Benchmark Dataset for Evaluating LLMs in Offensive Security","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-llm-ctf/llm_ctf_database","path":"python/nyuctf/utils.py","file_url":"https://github.com/nyu-llm-ctf/llm_ctf_database/blob/HEAD/python/nyuctf/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, nyu-llm-ctf/llm_ctf_database, is not in the permissive set Syntology serves inline","code_sha256":"a185058a114d1e70","code_sha256_prefix":"a185058a114d1e70","mcp_get_code":{"code_sha256":"a185058a114d1e70"}},{"arxiv_id":"2202.01875","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-explainability-as-a-dialogue-a","title":"Rethinking Explainability as a Dialogue: A Practitioner's Perspective","date":"2022-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dylan-slack/talktomodel","path":"experiments/compute_parsing_accuracy.py","file_url":"https://github.com/dylan-slack/talktomodel/blob/HEAD/experiments/compute_parsing_accuracy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa021a4936e28b28","code_sha256_prefix":"fa021a4936e28b28","mcp_get_code":{"code_sha256":"fa021a4936e28b28"}}],"record_sha256":"d0e48f58ee143980a2385639f4bc27f7832ead03d8968e9e824ca4425e059710","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}