{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/generate-code","entry":"generate_code","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":2,"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":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":5},"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":"2606.08414","paper":"/paper/arxiv-2606-08414","title":"PACT: Self-Evolving Physical Safety Alignment for Diffusion Policies in Embodied Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"robotwin-Platform/RoboTwin","path":"code_gen/task_generation.py","file_url":"https://github.com/robotwin-Platform/RoboTwin/blob/HEAD/code_gen/task_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b3a57bcb8e8f5a04","mcp_get_code":{"code_sha256":"b3a57bcb8e8f5a04"}},{"arxiv_id":"2606.08414","paper":"/paper/arxiv-2606-08414","title":"PACT: Self-Evolving Physical Safety Alignment for Diffusion Policies in Embodied Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"robotwin-Platform/RoboTwin","path":"code_gen/task_generation_mm.py","file_url":"https://github.com/robotwin-Platform/RoboTwin/blob/HEAD/code_gen/task_generation_mm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3468f78120466b2b","mcp_get_code":{"code_sha256":"3468f78120466b2b"}},{"arxiv_id":"2601.09703","paper":"/paper/arxiv-2601-09703","title":"ShortCoder: Knowledge-Augmented Syntax Optimization for Token-Efficient Code Generation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"DeepSoftwareAnalytics/ShorterCode","path":"reference_lora.py","file_url":"https://github.com/DeepSoftwareAnalytics/ShorterCode/blob/HEAD/reference_lora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c489f940658a635","mcp_get_code":{"code_sha256":"4c489f940658a635"}},{"arxiv_id":"2407.08473","paper":"/paper/natural-language-is-not-enough-benchmarking","title":"Natural language is not enough: Benchmarking multi-modal generative AI for Verilog generation","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aichipdesign/chipgptv","path":"test_benchmark/rtlcoder_finetune_benchmark.py","file_url":"https://github.com/aichipdesign/chipgptv/blob/HEAD/test_benchmark/rtlcoder_finetune_benchmark.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09d4d4a742ac61f7","mcp_get_code":{"code_sha256":"09d4d4a742ac61f7"}},{"arxiv_id":"2404.02183","paper":"/paper/self-organized-agents-a-llm-multi-agent","title":"Self-Organized Agents: A LLM Multi-Agent Framework toward Ultra Large-Scale Code Generation and Optimization","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsukushiai/self-organized-agent","path":"programming_runs/soas/agent.py","file_url":"https://github.com/tsukushiai/self-organized-agent/blob/HEAD/programming_runs/soas/agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c4c0bb9c81930ee1","mcp_get_code":{"code_sha256":"c4c0bb9c81930ee1"}},{"arxiv_id":"2310.03249","paper":"/paper/can-large-language-models-be-good-path","title":"Can Large Language Models be Good Path Planners? A Benchmark and Investigation on Spatial-temporal Reasoning","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohamedaghzal/llms-as-path-planners","path":"gpt-4-path-planning/src/generate_samples.py","file_url":"https://github.com/mohamedaghzal/llms-as-path-planners/blob/HEAD/gpt-4-path-planning/src/generate_samples.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c274f392ee719051","mcp_get_code":{"code_sha256":"c274f392ee719051"}},{"arxiv_id":"2309.17428","paper":"/paper/craft-customizing-llms-by-creating-and","title":"CRAFT: Customizing LLMs by Creating and Retrieving from Specialized Toolsets","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/craft","path":"vqa/construct_toolset.py","file_url":"https://github.com/lifan-yuan/craft/blob/HEAD/vqa/construct_toolset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7a213d993d2799df","mcp_get_code":{"code_sha256":"7a213d993d2799df"}}]}