{"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/mctsnode","entry":"MCTSNode","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":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":7,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":3},"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":"2602.23876","paper":"/paper/arxiv-2602-23876","title":"RF-Agent: Automated Reward Function Design via Language Agent Tree Search","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"deng-ai-lab/RF-Agent","path":"RF_Agent/rf_agent_algo/rfagent_algo.py","file_url":"https://github.com/deng-ai-lab/RF-Agent/blob/HEAD/RF_Agent/rf_agent_algo/rfagent_algo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a2fa193c28631e49","mcp_get_code":{"code_sha256":"a2fa193c28631e49"}},{"arxiv_id":"2501.18922","paper":"/paper/kbqa-o1-agentic-knowledge-base-question","title":"KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhrlab/kbqa-o1","path":"reasoners/algorithm/mcts.py","file_url":"https://github.com/lhrlab/kbqa-o1/blob/HEAD/reasoners/algorithm/mcts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad93a0a3f26917e5","mcp_get_code":{"code_sha256":"ad93a0a3f26917e5"}},{"arxiv_id":"2409.05873","paper":"/paper/syntax-guided-procedural-synthesis-of","title":"Procedural Synthesis of Synthesizable Molecules","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shiningsunnyday/synthesisnet","path":"src/synnet/policy/mcts.py","file_url":"https://github.com/shiningsunnyday/synthesisnet/blob/HEAD/src/synnet/policy/mcts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a039ae2104694a7e","mcp_get_code":{"code_sha256":"a039ae2104694a7e"}},{"arxiv_id":"2310.19906","paper":"/paper/interpretable-prototype-based-graph-1","title":"Interpretable Prototype-based Graph Information Bottleneck","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sang-woo-seo/pgib","path":"models/train_gnns.py","file_url":"https://github.com/sang-woo-seo/pgib/blob/HEAD/models/train_gnns.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d084866b0972960","mcp_get_code":{"code_sha256":"0d084866b0972960"}},{"arxiv_id":"2305.14992","paper":"/paper/reasoning-with-language-model-is-planning","title":"Reasoning with Language Model is Planning with World Model","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ber666/RAP","path":"rap/blocksworld_mcts.py","file_url":"https://github.com/Ber666/RAP/blob/HEAD/rap/blocksworld_mcts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1eb22998632706e9","mcp_get_code":{"code_sha256":"1eb22998632706e9"}},{"arxiv_id":"2305.10601","paper":"/paper/tree-of-thoughts-deliberate-problem-solving-1","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"codelion/optillm","path":"optillm/mcts.py","file_url":"https://github.com/codelion/optillm/blob/HEAD/optillm/mcts.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":"778fb657e40c2423","mcp_get_code":{"code_sha256":"778fb657e40c2423"}},{"arxiv_id":"2305.10601","paper":"/paper/tree-of-thoughts-deliberate-problem-solving-1","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huiwy/reflection-on-trees","path":"reasoners/algorithm/mcts.py","file_url":"https://github.com/huiwy/reflection-on-trees/blob/HEAD/reasoners/algorithm/mcts.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":"e508098731faf687","mcp_get_code":{"code_sha256":"e508098731faf687"}}]}