{"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/run-eval","entry":"run_eval","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":12,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":12,"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":1,"ran_fixture":0,"ran":4,"unverified":5},"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.02991","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02991","title":"TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Data-Driven-Computational-Geotechnics/TRACE","path":"common/eval_common.py","file_url":"https://github.com/Data-Driven-Computational-Geotechnics/TRACE/blob/HEAD/common/eval_common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"155a7ca64cbef7ca","code_sha256_prefix":"155a7ca64cbef7ca","mcp_get_code":{"code_sha256":"155a7ca64cbef7ca"}},{"arxiv_id":"2608.00656","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-00656","title":"Simulation-Based Plate-Reverb Parameter Estimation from a Single Impulse Response","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LOGUNIVPM/1st-DAFx-Challenge","path":"batchEval.py","file_url":"https://github.com/LOGUNIVPM/1st-DAFx-Challenge/blob/HEAD/batchEval.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, LOGUNIVPM/1st-DAFx-Challenge when it was checked","code_sha256":"4ddf9028d1984a85","code_sha256_prefix":"4ddf9028d1984a85","mcp_get_code":{"code_sha256":"4ddf9028d1984a85"}},{"arxiv_id":"2605.20075","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20075","title":"CopT: Contrastive On-Policy Thinking with Continuous Spaces for General and Agentic Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"shishirpatil/gorilla","path":"gorilla/inference/gorilla_eval.py","file_url":"https://github.com/shishirpatil/gorilla/blob/HEAD/gorilla/inference/gorilla_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0739c6a004099445","code_sha256_prefix":"0739c6a004099445","mcp_get_code":{"code_sha256":"0739c6a004099445"}},{"arxiv_id":"2510.19176","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-19176","title":"The Zero-Step Thinking: An Empirical Study of Mode Selection as Harder Early Exit in Reasoning Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Trae1ounG/Zero_Step_Thinking","path":"src/train_predictor_with_class_weights.py","file_url":"https://github.com/Trae1ounG/Zero_Step_Thinking/blob/HEAD/src/train_predictor_with_class_weights.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, Trae1ounG/Zero_Step_Thinking when it was checked","code_sha256":"56958f10c524ec4e","code_sha256_prefix":"56958f10c524ec4e","mcp_get_code":{"code_sha256":"56958f10c524ec4e"}},{"arxiv_id":"2404.06921","arxiv_id_is_arxiv":true,"paper":"/paper/goex-perspectives-and-designs-towards-a","title":"GoEX: Perspectives and Designs Towards a Runtime for Autonomous LLM Applications","date":"2024-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShishirPatil/gorilla","path":"gorilla/inference/gorilla_eval.py","file_url":"https://github.com/ShishirPatil/gorilla/blob/HEAD/gorilla/inference/gorilla_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0739c6a004099445","code_sha256_prefix":"0739c6a004099445","mcp_get_code":{"code_sha256":"0739c6a004099445"}},{"arxiv_id":"2401.10727","arxiv_id_is_arxiv":true,"paper":"/paper/tool-lmm-a-large-multi-modal-model-for-tool","title":"MLLM-Tool: A Multimodal Large Language Model For Tool Agent Learning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mllm-tool/mllm-tool","path":"code/inference.py","file_url":"https://github.com/mllm-tool/mllm-tool/blob/HEAD/code/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22a14acf7a13a6b0","code_sha256_prefix":"22a14acf7a13a6b0","mcp_get_code":{"code_sha256":"22a14acf7a13a6b0"}},{"arxiv_id":"2401.00563","arxiv_id_is_arxiv":true,"paper":"/paper/kernelgpt-enhanced-kernel-fuzzing-via-large","title":"KernelGPT: Enhanced Kernel Fuzzing via Large Language Models","date":"2023-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ise-uiuc/kernelgpt","path":"spec-gen/eval_spec.py","file_url":"https://github.com/ise-uiuc/kernelgpt/blob/HEAD/spec-gen/eval_spec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b04b35a66f40278","code_sha256_prefix":"4b04b35a66f40278","mcp_get_code":{"code_sha256":"4b04b35a66f40278"}},{"arxiv_id":"2310.16111","arxiv_id_is_arxiv":true,"paper":"/paper/locally-differentially-private-document","title":"Locally Differentially Private Document Generation Using Zero Shot Prompting","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saitejautpala/dp_prompt","path":"attacks/text_attacker_architecture.py","file_url":"https://github.com/saitejautpala/dp_prompt/blob/HEAD/attacks/text_attacker_architecture.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":"cb16209dce94db5f","code_sha256_prefix":"cb16209dce94db5f","mcp_get_code":{"code_sha256":"cb16209dce94db5f"}},{"arxiv_id":"2201.01549","arxiv_id_is_arxiv":true,"paper":"/paper/spt-code-sequence-to-sequence-pre-training","title":"SPT-Code: Sequence-to-Sequence Pre-Training for Learning Source Code Representations","date":null,"month_inferred_from_arxiv_id":"2022-01","title_source":"archive","repo":"nougatca/spt-code","path":"sources/downstream_tasks/search.py","file_url":"https://github.com/nougatca/spt-code/blob/HEAD/sources/downstream_tasks/search.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":"1646803daed79ebe","code_sha256_prefix":"1646803daed79ebe","mcp_get_code":{"code_sha256":"1646803daed79ebe"}},{"arxiv_id":"2009.07364","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-theoretic-view-on-selecting","title":"An information theoretic view on selecting linguistic probes","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SPOClab-ca/InfoProbe","path":"src/pos_probe.py","file_url":"https://github.com/SPOClab-ca/InfoProbe/blob/HEAD/src/pos_probe.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":"f8435c21eef9039f","code_sha256_prefix":"f8435c21eef9039f","mcp_get_code":{"code_sha256":"f8435c21eef9039f"}},{"arxiv_id":"2024.findings-acl.39","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.39","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"passing2961/DribeR","path":"open_vlm_main.py","file_url":"https://github.com/passing2961/DribeR/blob/HEAD/open_vlm_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"970a21f1c0fb22ef","code_sha256_prefix":"970a21f1c0fb22ef","mcp_get_code":{"code_sha256":"970a21f1c0fb22ef"}},{"arxiv_id":"2023.findings-emnlp.566","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.566","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SaitejaUtpala/dp_prompt","path":"attacks/text_attacker_architecture.py","file_url":"https://github.com/SaitejaUtpala/dp_prompt/blob/HEAD/attacks/text_attacker_architecture.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":"cb16209dce94db5f","code_sha256_prefix":"cb16209dce94db5f","mcp_get_code":{"code_sha256":"cb16209dce94db5f"}}],"record_sha256":"5ec9fc896e852722237d56a9981a1b14b3eb23405119d62fa78a41339f69dc0c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}