{"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/mcts","entry":"MCTS","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":15,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":16,"n_samples_ran":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":6,"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":0,"ran_fixture":0,"ran":4,"unverified":12},"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":"2605.17285","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17285","title":"UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models","date":"2026-05-17","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"hjkng/unrexplainer","path":"explainer/unrexplainer.py","file_url":"https://github.com/hjkng/unrexplainer/blob/HEAD/explainer/unrexplainer.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, hjkng/unrexplainer when it was checked","code_sha256":"875ba8418dc34b3c","code_sha256_prefix":"875ba8418dc34b3c","mcp_get_code":{"code_sha256":"875ba8418dc34b3c"}},{"arxiv_id":"2601.06444","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06444","title":"Physics-Informed Tree Search for High-Dimensional Computational Design","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"sbanik2/PyPhysTree","path":"lgtree/MCTS.py","file_url":"https://github.com/sbanik2/PyPhysTree/blob/HEAD/lgtree/MCTS.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5697618fbaac5d23","code_sha256_prefix":"5697618fbaac5d23","mcp_get_code":{"code_sha256":"5697618fbaac5d23"}},{"arxiv_id":"2504.04204","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-elicitation-of-latent-information","title":"Adaptive Elicitation of Latent Information Using Natural Language","date":"2025-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"namkoong-lab/adaptive-elicitation","path":"src/eval/info_gain.py","file_url":"https://github.com/namkoong-lab/adaptive-elicitation/blob/HEAD/src/eval/info_gain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5113eb5b7fffa7ce","code_sha256_prefix":"5113eb5b7fffa7ce","mcp_get_code":{"code_sha256":"5113eb5b7fffa7ce"}},{"arxiv_id":"2503.22165","arxiv_id_is_arxiv":true,"paper":"/paper/landscape-of-thoughts-visualizing-the","title":"Landscape of Thoughts: Visualizing the Reasoning Process of Large Language Models","date":"2025-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/landscape-of-thoughts","path":"lot/algorithms/Tree/MCTS/mcts.py","file_url":"https://github.com/tmlr-group/landscape-of-thoughts/blob/HEAD/lot/algorithms/Tree/MCTS/mcts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"acb210e335a350af","code_sha256_prefix":"acb210e335a350af","mcp_get_code":{"code_sha256":"acb210e335a350af"}},{"arxiv_id":"2503.11586","arxiv_id_is_arxiv":true,"paper":"/paper/broaden-your-scope-efficient-multi-turn","title":"Broaden your SCOPE! Efficient Multi-turn Conversation Planning for LLMs using Semantic Space","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenzhiliang94/convo-plan-scope","path":"monte_carlo_tree_search/mcts.py","file_url":"https://github.com/chenzhiliang94/convo-plan-scope/blob/HEAD/monte_carlo_tree_search/mcts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d85b76831c5a641","code_sha256_prefix":"2d85b76831c5a641","mcp_get_code":{"code_sha256":"2d85b76831c5a641"}},{"arxiv_id":"2502.13383","arxiv_id_is_arxiv":true,"paper":"/paper/mm-verify-enhancing-multimodal-reasoning-with","title":"MM-Verify: Enhancing Multimodal Reasoning with Chain-of-Thought Verification","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aurora-slz/MM-Verify","path":"search/MCTS/mcts.py","file_url":"https://github.com/Aurora-slz/MM-Verify/blob/HEAD/search/MCTS/mcts.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, Aurora-slz/MM-Verify when it was checked","code_sha256":"856c9aad637b0958","code_sha256_prefix":"856c9aad637b0958","mcp_get_code":{"code_sha256":"856c9aad637b0958"}},{"arxiv_id":"2501.18922","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef265cb7e70e7f95","code_sha256_prefix":"ef265cb7e70e7f95","mcp_get_code":{"code_sha256":"ef265cb7e70e7f95"}},{"arxiv_id":"2412.07186","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-tree-search-based-space-transfer","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/mcts-transfer","path":"mcts/MCTS.py","file_url":"https://github.com/lamda-bbo/mcts-transfer/blob/HEAD/mcts/MCTS.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, lamda-bbo/mcts-transfer when it was checked","code_sha256":"a09bc86bb469556d","code_sha256_prefix":"a09bc86bb469556d","mcp_get_code":{"code_sha256":"a09bc86bb469556d"}},{"arxiv_id":"2409.05873","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0306a6d410a9cd1a","code_sha256_prefix":"0306a6d410a9cd1a","mcp_get_code":{"code_sha256":"0306a6d410a9cd1a"}},{"arxiv_id":"2404.12253","arxiv_id_is_arxiv":true,"paper":"/paper/toward-self-improvement-of-llms-via","title":"Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yetianjhu/alphallm","path":"search/mcts.py","file_url":"https://github.com/yetianjhu/alphallm/blob/HEAD/search/mcts.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, yetianjhu/alphallm when it was checked","code_sha256":"d3ceda385feb848e","code_sha256_prefix":"d3ceda385feb848e","mcp_get_code":{"code_sha256":"d3ceda385feb848e"}},{"arxiv_id":"2309.17382","arxiv_id_is_arxiv":true,"paper":"/paper/reason-for-future-act-for-now-a-principled","title":"Reason for Future, Act for Now: A Principled Framework for Autonomous LLM Agents with Provable Sample Efficiency","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agentification/RAFA_code","path":"BlocksWorld/src/rafa/mcts_agent.py","file_url":"https://github.com/agentification/RAFA_code/blob/HEAD/BlocksWorld/src/rafa/mcts_agent.py","status":"ran","verification_level":1,"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, agentification/RAFA_code when it was checked","code_sha256":"31358b2342ed1715","code_sha256_prefix":"31358b2342ed1715","mcp_get_code":{"code_sha256":"31358b2342ed1715"}},{"arxiv_id":"2305.14992","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ffecffc5ed458c7","code_sha256_prefix":"6ffecffc5ed458c7","mcp_get_code":{"code_sha256":"6ffecffc5ed458c7"}},{"arxiv_id":"2305.13660","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-based-monte-carlo-tree-search-for-goal","title":"Prompt-Based Monte-Carlo Tree Search for Goal-Oriented Dialogue Policy Planning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonyux/GDPZero","path":"core/mcts.py","file_url":"https://github.com/jasonyux/GDPZero/blob/HEAD/core/mcts.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, jasonyux/GDPZero when it was checked","code_sha256":"683b87c888dbee29","code_sha256_prefix":"683b87c888dbee29","mcp_get_code":{"code_sha256":"683b87c888dbee29"}},{"arxiv_id":"2305.10601","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c919c70de90b021d","code_sha256_prefix":"c919c70de90b021d","mcp_get_code":{"code_sha256":"c919c70de90b021d"}},{"arxiv_id":"2305.10601","arxiv_id_is_arxiv":true,"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a60a888f98f637a1","code_sha256_prefix":"a60a888f98f637a1","mcp_get_code":{"code_sha256":"a60a888f98f637a1"}},{"arxiv_id":"1911.08265","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koulanurag/muzero-pytorch","path":"core/mcts.py","file_url":"https://github.com/koulanurag/muzero-pytorch/blob/HEAD/core/mcts.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54758c22e1156b77","code_sha256_prefix":"54758c22e1156b77","mcp_get_code":{"code_sha256":"54758c22e1156b77"}}],"record_sha256":"61218596a8dde1e5406c8d0da88a61b06ed58798db317fcc8013f578aff4952c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}