{"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/load-ground-truth","entry":"load_ground_truth","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":3,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":2,"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":4,"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":"2609.13945","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13945","title":"SAILOR: Solver-Assisted Interactive LLM-based Optimization Recovery","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"sshaghayeghs/SAILOR","path":"ast_solver/pipeline.py","file_url":"https://github.com/sshaghayeghs/SAILOR/blob/HEAD/ast_solver/pipeline.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, sshaghayeghs/SAILOR when it was checked","code_sha256":"cf4530ca628192cf","code_sha256_prefix":"cf4530ca628192cf","mcp_get_code":{"code_sha256":"cf4530ca628192cf"}},{"arxiv_id":"2607.02510","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-02510","title":"Online Safety Monitoring for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"monasch/llm-monitor","path":"python_scripts/get_signal_prm.py","file_url":"https://github.com/monasch/llm-monitor/blob/HEAD/python_scripts/get_signal_prm.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":"35a984834e874c85","code_sha256_prefix":"35a984834e874c85","mcp_get_code":{"code_sha256":"35a984834e874c85"}},{"arxiv_id":"2603.21335","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21335","title":"TimeTox: An LLM-Based Pipeline for Automated Extraction of Time Toxicity from Clinical Trial Protocols","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"sakethbuild/TimeTox","path":"agent_comparison.py","file_url":"https://github.com/sakethbuild/TimeTox/blob/HEAD/agent_comparison.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sakethbuild/TimeTox when it was checked","code_sha256":"acc5b9353a83890b","code_sha256_prefix":"acc5b9353a83890b","mcp_get_code":{"code_sha256":"acc5b9353a83890b"}},{"arxiv_id":"2601.06966","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06966","title":"RealMem: Benchmarking LLMs in Real-World Memory-Driven Interaction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"AvatarMemory/RealMemBench","path":"eval/compute_llm_metrics_for_realmem.py","file_url":"https://github.com/AvatarMemory/RealMemBench/blob/HEAD/eval/compute_llm_metrics_for_realmem.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":"e78cd2d9a3dd4718","code_sha256_prefix":"e78cd2d9a3dd4718","mcp_get_code":{"code_sha256":"e78cd2d9a3dd4718"}},{"arxiv_id":"2506.14035","arxiv_id_is_arxiv":true,"paper":"/paper/simpledoc-multi-modal-document-understanding","title":"SimpleDoc: Multi-Modal Document Understanding with Dual-Cue Page Retrieval and Iterative Refinement","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ag2ai/SimpleDoc","path":"evaluation/evaluate_responses.py","file_url":"https://github.com/ag2ai/SimpleDoc/blob/HEAD/evaluation/evaluate_responses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ag2ai/SimpleDoc when it was checked","code_sha256":"a60837f27b20ddec","code_sha256_prefix":"a60837f27b20ddec","mcp_get_code":{"code_sha256":"a60837f27b20ddec"}},{"arxiv_id":"2305.14846","arxiv_id_is_arxiv":true,"paper":"/paper/introducing-competition-to-boost-the-1","title":"Introducing Competition to Boost the Transferability of Targeted Adversarial Examples through Clean Feature Mixup","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreamflake/cfm","path":"eval_attacks.py","file_url":"https://github.com/dreamflake/cfm/blob/HEAD/eval_attacks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sclbd/transfer_attack_rap, and GitHub detected no licence in that repository when it was checked","code_sha256":"9e4f4d7edbf00ba0","code_sha256_prefix":"9e4f4d7edbf00ba0","mcp_get_code":{"code_sha256":"9e4f4d7edbf00ba0"}},{"arxiv_id":"2210.05968","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-the-transferability-of-adversarial-2","title":"Boosting the Transferability of Adversarial Attacks with Reverse Adversarial Perturbation","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sclbd/transfer_attack_rap","path":"rap_attack.py","file_url":"https://github.com/sclbd/transfer_attack_rap/blob/HEAD/rap_attack.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, sclbd/transfer_attack_rap when it was checked","code_sha256":"9e4f4d7edbf00ba0","code_sha256_prefix":"9e4f4d7edbf00ba0","mcp_get_code":{"code_sha256":"9e4f4d7edbf00ba0"}},{"arxiv_id":"2103.14641","arxiv_id_is_arxiv":true,"paper":"/paper/on-generating-transferable-targeted","title":"On Generating Transferable Targeted Perturbations","date":"2021-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengyuZhao/Targeted-Tansfer","path":"eval_ensemble.py","file_url":"https://github.com/ZhengyuZhao/Targeted-Tansfer/blob/HEAD/eval_ensemble.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sclbd/transfer_attack_rap, and GitHub detected no licence in that repository when it was checked","code_sha256":"9e4f4d7edbf00ba0","code_sha256_prefix":"9e4f4d7edbf00ba0","mcp_get_code":{"code_sha256":"9e4f4d7edbf00ba0"}},{"arxiv_id":"2012.11207","arxiv_id_is_arxiv":true,"paper":"/paper/on-success-and-simplicity-a-second-look-at","title":"On Success and Simplicity: A Second Look at Transferable Targeted Attacks","date":"2020-12-21","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":"9e4f4d7edbf00ba0","code_sha256_prefix":"9e4f4d7edbf00ba0","mcp_get_code":{"code_sha256":"9e4f4d7edbf00ba0"}},{"arxiv_id":"aaai_25576","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25576","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LHRLAB/NQE","path":"src/new_evaluation/iter_qe_evaluation.py","file_url":"https://github.com/LHRLAB/NQE/blob/HEAD/src/new_evaluation/iter_qe_evaluation.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":"d9f1fd0bfa8bd9f3","code_sha256_prefix":"d9f1fd0bfa8bd9f3","mcp_get_code":{"code_sha256":"d9f1fd0bfa8bd9f3"}}],"record_sha256":"b8a0a85e6e0e14f1e25e38df5e88ba0c93bc8f104913b08a3968f06349c3fca6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}