{"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/mctsnode","entry":"MCTSNode","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":7,"n_samples_ran":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":3},"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":"2602.23876","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, deng-ai-lab/RF-Agent when it was checked","code_sha256":"a2fa193c28631e49","code_sha256_prefix":"a2fa193c28631e49","mcp_get_code":{"code_sha256":"a2fa193c28631e49"}},{"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":"ad93a0a3f26917e5","code_sha256_prefix":"ad93a0a3f26917e5","mcp_get_code":{"code_sha256":"ad93a0a3f26917e5"}},{"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":"a039ae2104694a7e","code_sha256_prefix":"a039ae2104694a7e","mcp_get_code":{"code_sha256":"a039ae2104694a7e"}},{"arxiv_id":"2310.19906","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sang-woo-seo/pgib when it was checked","code_sha256":"0d084866b0972960","code_sha256_prefix":"0d084866b0972960","mcp_get_code":{"code_sha256":"0d084866b0972960"}},{"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":"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":"1eb22998632706e9","code_sha256_prefix":"1eb22998632706e9","mcp_get_code":{"code_sha256":"1eb22998632706e9"}},{"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":"778fb657e40c2423","code_sha256_prefix":"778fb657e40c2423","mcp_get_code":{"code_sha256":"778fb657e40c2423"}},{"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":"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":"e508098731faf687","code_sha256_prefix":"e508098731faf687","mcp_get_code":{"code_sha256":"e508098731faf687"}}],"record_sha256":"ba51e3b46c42271ca1db1c9bac522281fdf58d56279b126e4d385f00aba31f26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}