{"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/extract-code-block","entry":"extract_code_block","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":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":3,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":4,"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":3,"ran_fixture":0,"ran":2,"unverified":3},"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.28877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-28877","title":"Open-Source LLM-Driven Formal Verification: A Multi-Agent Pipeline for RTL Repair","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"trunghafromvietnam/rtl-repair-framework","path":"agents/nodes.py","file_url":"https://github.com/trunghafromvietnam/rtl-repair-framework/blob/HEAD/agents/nodes.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":"ce26d83cdb54631b","code_sha256_prefix":"ce26d83cdb54631b","mcp_get_code":{"code_sha256":"ce26d83cdb54631b"}},{"arxiv_id":"2605.12944","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12944","title":"From Instance Selection to Fixed-Pool Data Recipe Search for Supervised Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"w253/AutoSelection","path":"src/recipe_sandbox/agents/schema_mapping.py","file_url":"https://github.com/w253/AutoSelection/blob/HEAD/src/recipe_sandbox/agents/schema_mapping.py","status":"unverified","verification_level":0,"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, w253/AutoSelection when it was checked","code_sha256":"912003fae4663c8f","code_sha256_prefix":"912003fae4663c8f","mcp_get_code":{"code_sha256":"912003fae4663c8f"}},{"arxiv_id":"2605.02545","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-02545","title":"Strategy-Aware Optimization Modeling with Reasoning LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"rachhhhing/SAGE","path":"reward_func/content_utils.py","file_url":"https://github.com/rachhhhing/SAGE/blob/HEAD/reward_func/content_utils.py","status":"unverified","verification_level":0,"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, rachhhhing/SAGE when it was checked","code_sha256":"eaeb1c20e27a0a8c","code_sha256_prefix":"eaeb1c20e27a0a8c","mcp_get_code":{"code_sha256":"eaeb1c20e27a0a8c"}},{"arxiv_id":"2602.22703","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22703","title":"Enhancing Geometric Perception in VLMs via Translator-Guided Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Longin-Yu/GeoPerceive","path":"src/parser.py","file_url":"https://github.com/Longin-Yu/GeoPerceive/blob/HEAD/src/parser.py","status":"unverified","verification_level":0,"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, Longin-Yu/GeoPerceive when it was checked","code_sha256":"54d45d9fae74577c","code_sha256_prefix":"54d45d9fae74577c","mcp_get_code":{"code_sha256":"54d45d9fae74577c"}},{"arxiv_id":"2505.20302","arxiv_id_is_arxiv":true,"paper":"/paper/verithoughts-enabling-automated-verilog-code","title":"VeriThoughts: Enabling Automated Verilog Code Generation using Reasoning and Formal Verification","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wilyub/verithoughts","path":"evaluation_verithoughts/verilog_vllm_multi.py","file_url":"https://github.com/wilyub/verithoughts/blob/HEAD/evaluation_verithoughts/verilog_vllm_multi.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, wilyub/verithoughts when it was checked","code_sha256":"ac62438fe193db61","code_sha256_prefix":"ac62438fe193db61","mcp_get_code":{"code_sha256":"ac62438fe193db61"}},{"arxiv_id":"2504.00906","arxiv_id_is_arxiv":true,"paper":"/paper/agent-s2-a-compositional-generalist","title":"Agent S2: A Compositional Generalist-Specialist Framework for Computer Use Agents","date":"2025-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simular-ai/agent-s","path":"gui_agents/s3/agents/code_agent.py","file_url":"https://github.com/simular-ai/agent-s/blob/HEAD/gui_agents/s3/agents/code_agent.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":"5b5848f799f23954","code_sha256_prefix":"5b5848f799f23954","mcp_get_code":{"code_sha256":"5b5848f799f23954"}},{"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/llm_utils.py","file_url":"https://github.com/ise-uiuc/kernelgpt/blob/HEAD/spec-gen/llm_utils.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":"cafe4e687de900be","code_sha256_prefix":"cafe4e687de900be","mcp_get_code":{"code_sha256":"cafe4e687de900be"}},{"arxiv_id":"2025.emnlp-main.1337","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.1337","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RazvanDu/CopySpec","path":"GSM/cp_gsm.py","file_url":"https://github.com/RazvanDu/CopySpec/blob/HEAD/GSM/cp_gsm.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":"8a7b55da32d5a1e0","code_sha256_prefix":"8a7b55da32d5a1e0","mcp_get_code":{"code_sha256":"8a7b55da32d5a1e0"}}],"record_sha256":"72061832b5469db7322a76a0f9459e7201da2c77e47506a6747f2e785bb3d7e0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}