{"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/file-to-string","entry":"file_to_string","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":7,"n_papers_ran":5,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2506.17335","paper":"/paper/lmr-bench-evaluating-llm-agent-s-ability-on","title":"LMR-BENCH: Evaluating LLM Agent's Ability on Reproducing Language Modeling Research","date":"2025-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"du-nlp-lab/LMR-Bench","path":"utils/data_process/data_utils.py","file_url":"https://github.com/du-nlp-lab/LMR-Bench/blob/HEAD/utils/data_process/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a88ce98f7db66404","mcp_get_code":{"code_sha256":"a88ce98f7db66404"}},{"arxiv_id":"2501.08603","paper":"/paper/monte-carlo-tree-search-for-comprehensive","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zz1358m/mcts-ahd-master","path":"utils/utils.py","file_url":"https://github.com/zz1358m/mcts-ahd-master/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2412.14995","paper":"/paper/hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datphamvn/hsevo","path":"utils/utils.py","file_url":"https://github.com/datphamvn/hsevo/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2409.18382","paper":"/paper/curricullm-automatic-task-curricula-design","title":"CurricuLLM: Automatic Task Curricula Design for Learning Complex Robot Skills using Large Language Models","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labicon/curricullm","path":"gpt/utils.py","file_url":"https://github.com/labicon/curricullm/blob/HEAD/gpt/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2409.13682","paper":"/paper/remembr-building-and-reasoning-over-long","title":"ReMEmbR: Building and Reasoning Over Long-Horizon Spatio-Temporal Memory for Robot Navigation","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA-AI-IOT/remembr","path":"remembr/utils/util.py","file_url":"https://github.com/NVIDIA-AI-IOT/remembr/blob/HEAD/remembr/utils/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"acd3a0b23e28c84a","mcp_get_code":{"code_sha256":"acd3a0b23e28c84a"}},{"arxiv_id":"2408.08435","paper":"/paper/automated-design-of-agentic-systems","title":"Automated Design of Agentic Systems","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengranhu/adas","path":"_arc/utils.py","file_url":"https://github.com/shengranhu/adas/blob/HEAD/_arc/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"765cc65c8097e240","mcp_get_code":{"code_sha256":"765cc65c8097e240"}},{"arxiv_id":"2310.12931","paper":"/paper/eureka-human-level-reward-design-via-coding","title":"Eureka: Human-Level Reward Design via Coding Large Language Models","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eureka-research/Eureka","path":"eureka/utils/extract_task_code.py","file_url":"https://github.com/eureka-research/Eureka/blob/HEAD/eureka/utils/extract_task_code.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}}]}