{"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/clean-answer","entry":"clean_answer","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":2,"ran_draft_wrong":5,"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":"2607.00605","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-00605","title":"Auditing Forgetting in Limited Memory Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"raeesiarya/LMLMAudit","path":"src/lmlm-audit/run_audit.py","file_url":"https://github.com/raeesiarya/LMLMAudit/blob/HEAD/src/lmlm-audit/run_audit.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":"e78ccae7868d860d","code_sha256_prefix":"e78ccae7868d860d","mcp_get_code":{"code_sha256":"e78ccae7868d860d"}},{"arxiv_id":"2506.07927","arxiv_id_is_arxiv":true,"paper":"/paper/solving-inequality-proofs-with-large-language","title":"Solving Inequality Proofs with Large Language Models","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lupantech/ineqmath","path":"data_curation/data_reformulation/bound_reformulation.py","file_url":"https://github.com/lupantech/ineqmath/blob/HEAD/data_curation/data_reformulation/bound_reformulation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11636c4dee59c991","code_sha256_prefix":"11636c4dee59c991","mcp_get_code":{"code_sha256":"11636c4dee59c991"}},{"arxiv_id":"2505.19616","arxiv_id_is_arxiv":true,"paper":"/paper/diagnosing-and-mitigating-modality","title":"Diagnosing and Mitigating Modality Interference in Multimodal Large Language Models","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d60fdb543dd96366","code_sha256_prefix":"d60fdb543dd96366","mcp_get_code":{"code_sha256":"d60fdb543dd96366"}},{"arxiv_id":"2503.17352","arxiv_id_is_arxiv":true,"paper":"/paper/openvlthinker-an-early-exploration-to-complex","title":"OpenVLThinker: An Early Exploration to Complex Vision-Language Reasoning via Iterative Self-Improvement","date":"2025-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihedeng9/openvlthinker","path":"v1/utils/clean_answer.py","file_url":"https://github.com/yihedeng9/openvlthinker/blob/HEAD/v1/utils/clean_answer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e0e5ee3ad0516dd","code_sha256_prefix":"8e0e5ee3ad0516dd","mcp_get_code":{"code_sha256":"8e0e5ee3ad0516dd"}},{"arxiv_id":"2502.13069","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-agents-to-overcome-ambiguity-in","title":"Interactive Agents to Overcome Ambiguity in Software Engineering","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sani903/InteractiveSWEAgents","path":"experiments/cosine_distance/generate_cosine_distances.py","file_url":"https://github.com/sani903/InteractiveSWEAgents/blob/HEAD/experiments/cosine_distance/generate_cosine_distances.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e093fcb20868bedf","code_sha256_prefix":"e093fcb20868bedf","mcp_get_code":{"code_sha256":"e093fcb20868bedf"}},{"arxiv_id":"2501.01872","arxiv_id_is_arxiv":true,"paper":"/paper/turning-logic-against-itself-probing-model","title":"Turning Logic Against Itself : Probing Model Defenses Through Contrastive Questions","date":"2025-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/emnlp2025-poate-attack","path":"poate_attack/attacks/evaluators/risk_scorer.py","file_url":"https://github.com/UKPLab/emnlp2025-poate-attack/blob/HEAD/poate_attack/attacks/evaluators/risk_scorer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from princeton-sysml/jailbreak_llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"8c5418f18b5585e9","code_sha256_prefix":"8c5418f18b5585e9","mcp_get_code":{"code_sha256":"8c5418f18b5585e9"}},{"arxiv_id":"2410.03659","arxiv_id_is_arxiv":true,"paper":"/paper/unraveling-cross-modality-knowledge-conflict","title":"Unraveling Cross-Modality Knowledge Conflicts in Large Vision-Language Models","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luka-group/vlm-knowledge-conflict","path":"src/analysis/post_hoc_contrastive_decoding_metric.py","file_url":"https://github.com/luka-group/vlm-knowledge-conflict/blob/HEAD/src/analysis/post_hoc_contrastive_decoding_metric.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, luka-group/vlm-knowledge-conflict when it was checked","code_sha256":"6f996660f16793e2","code_sha256_prefix":"6f996660f16793e2","mcp_get_code":{"code_sha256":"6f996660f16793e2"}},{"arxiv_id":"2410.03659","arxiv_id_is_arxiv":true,"paper":"/paper/unraveling-cross-modality-knowledge-conflict","title":"Unraveling Cross-Modality Knowledge Conflicts in Large Vision-Language Models","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luka-group/vlm-knowledge-conflict","path":"src/evaluate/evaluate_mc.py","file_url":"https://github.com/luka-group/vlm-knowledge-conflict/blob/HEAD/src/evaluate/evaluate_mc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, luka-group/vlm-knowledge-conflict when it was checked","code_sha256":"d60fdb543dd96366","code_sha256_prefix":"d60fdb543dd96366","mcp_get_code":{"code_sha256":"d60fdb543dd96366"}},{"arxiv_id":"2407.12784","arxiv_id_is_arxiv":true,"paper":"/paper/agentpoison-red-teaming-llm-agents-via","title":"AgentPoison: Red-teaming LLM Agents via Poisoning Memory or Knowledge Bases","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BillChan226/AgentPoison","path":"ReAct/wrappers.py","file_url":"https://github.com/BillChan226/AgentPoison/blob/HEAD/ReAct/wrappers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88dcb3128f8012f3","code_sha256_prefix":"88dcb3128f8012f3","mcp_get_code":{"code_sha256":"88dcb3128f8012f3"}},{"arxiv_id":"2310.06987","arxiv_id_is_arxiv":true,"paper":"/paper/catastrophic-jailbreak-of-open-source-llms","title":"Catastrophic Jailbreak of Open-source LLMs via Exploiting Generation","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-sysml/jailbreak_llm","path":"evaluate.py","file_url":"https://github.com/princeton-sysml/jailbreak_llm/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, princeton-sysml/jailbreak_llm when it was checked","code_sha256":"8c5418f18b5585e9","code_sha256_prefix":"8c5418f18b5585e9","mcp_get_code":{"code_sha256":"8c5418f18b5585e9"}},{"arxiv_id":"2025.findings-acl.804","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.804","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WalterPaci/IMPAQTS-PID","path":"MCG_task.py","file_url":"https://github.com/WalterPaci/IMPAQTS-PID/blob/HEAD/MCG_task.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":"e6cad5ea74555cc6","code_sha256_prefix":"e6cad5ea74555cc6","mcp_get_code":{"code_sha256":"e6cad5ea74555cc6"}}],"record_sha256":"148ba775ae5b341cedd0486a4bead3b99dcb8bd83d418cda8b6b55603ec78096","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}