{"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/file-to-string","entry":"file_to_string","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":0,"unverified":1},"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":"2506.17335","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, du-nlp-lab/LMR-Bench when it was checked","code_sha256":"a88ce98f7db66404","code_sha256_prefix":"a88ce98f7db66404","mcp_get_code":{"code_sha256":"a88ce98f7db66404"}},{"arxiv_id":"2501.08603","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 labicon/curricullm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ab6795497be8743a","code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2412.14995","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 labicon/curricullm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ab6795497be8743a","code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2409.18382","arxiv_id_is_arxiv":true,"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_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, labicon/curricullm when it was checked","code_sha256":"ab6795497be8743a","code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}},{"arxiv_id":"2409.13682","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NVIDIA-AI-IOT/remembr (NOASSERTION)","code_sha256":"acd3a0b23e28c84a","code_sha256_prefix":"acd3a0b23e28c84a","mcp_get_code":{"code_sha256":"acd3a0b23e28c84a"}},{"arxiv_id":"2408.08435","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"765cc65c8097e240","code_sha256_prefix":"765cc65c8097e240","mcp_get_code":{"code_sha256":"765cc65c8097e240"}},{"arxiv_id":"2310.12931","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 labicon/curricullm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ab6795497be8743a","code_sha256_prefix":"ab6795497be8743a","mcp_get_code":{"code_sha256":"ab6795497be8743a"}}],"record_sha256":"c7dbb2323a4a7f6bc3bcd771cbf449ff347aedb9dd28bac5849ef06c74335f8b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}