{"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":"/paper/rest-mcts-llm-self-training-via-process","title":"ReST-MCTS*: LLM Self-Training via Process Reward Guided Tree Search","arxiv_id":"2406.03816","date":"2024-06-06","proceeding":null,"authors":["Dan Zhang","Sining Zhoubian","Ziniu Hu","Yisong Yue","Yuxiao Dong","Jie Tang"],"abstract":"Recent methodologies in LLM self-training mostly rely on LLM generating responses and filtering those with correct output answers as training data. This approach often yields a low-quality fine-tuning training set (e.g., incorrect plans or intermediate reasoning). In this paper, we develop a reinforced self-training approach, called ReST-MCTS*, based on integrating process reward guidance with tree search MCTS* for collecting higher-quality reasoning traces as well as per-step value to train policy and reward models. ReST-MCTS* circumvents the per-step manual annotation typically used to train process rewards by tree-search-based reinforcement learning: Given oracle final correct answers, ReST-MCTS* is able to infer the correct process rewards by estimating the probability this step can help lead to the correct answer. These inferred rewards serve dual purposes: they act as value targets for further refining the process reward model and also facilitate the selection of high-quality traces for policy model self-training. We first show that the tree-search policy in ReST-MCTS* achieves higher accuracy compared with prior LLM reasoning baselines such as Best-of-N and Tree-of-Thought, within the same search budget. We then show that by using traces searched by this tree-search policy as training data, we can continuously enhance the three language models for multiple iterations, and outperform other self-training algorithms such as ReST$^\\text{EM}$ and Self-Rewarding LM. We release all code at https://github.com/THUDM/ReST-MCTS.","url_abs":"https://arxiv.org/abs/2406.03816v3","url_pdf":"https://arxiv.org/pdf/2406.03816v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"rest-mcts-llm-self-training-via-process","repo_url":"https://github.com/THUDM/ReST-MCTS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"rest-mcts-llm-self-training-via-process","repo_url":"https://github.com/DIRECT-BIT/SRA-MCTS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2406.03816","atlas_url":"https://app.syntology.ai/?focus=2406.03816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03816"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.03816"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"ReST-MCTS * "},"call":"get_reference_implementation(name='ReST-MCTS * ')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.03816"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.03816\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2406.03816"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2406.03816\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2406.03816"},"call":"get_concepts_for_paper(arxiv_id=\"2406.03816\")"}],"reference_implementation":[{"method_name":"ReST-MCTS * ","assembly_sha256":"47b6385d7f7a0f6a","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":5,"no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='ReST-MCTS * ')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2406.03816","call":"have('2406.03816')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"THUDM/ReST-MCTS","kind":"official","samples":13,"ran":6,"instrument":4,"unverified":7},{"repo":"DIRECT-BIT/SRA-MCTS","kind":"listed","samples":9,"ran":3,"instrument":3,"unverified":6}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"47b6385d7f7a0f6a","source_kind":"generated","method_name":"ReST-MCTS * ","realizes_method":"ReST-MCTS * ","graph_method":"ReST-MCTS * ","realizes_severed":false,"claim":"Compute Upper Confidence Bound (UCB) scores for child nodes in MCTS tree search. Given N child nodes, compute UCB score for each as: ucb_i = v_i + epsilon * sqrt(ln(n_parent) / n_child_i), where v_i is the value of child i, n_child_i is the visit count of child i, n_parent is the visit count of the","centrality":"contribution","entry":"ucb_score","entry_sha256":"8f2c25ead6164989b6a1fb97045365b936b7e908fba7632921e8fda7f9e52208","n_bricks":1,"bricks":[{"entry":"ucb_score","code_sha256":"8f2c25ead6164989b6a1fb97045365b936b7e908fba7632921e8fda7f9e52208","role":"entry","order":0,"level":3,"status":"ran_violates"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_violates":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":5,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"ed313cc78539","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"},{"assembly_sha256":"10ea1eb46cbb16eb","source_kind":"harvested","method_name":"ReST-MCTS * ","realizes_method":"ReST-MCTS * ","graph_method":"ReST-MCTS * ","realizes_severed":false,"claim":"Implements a Monte Carlo Tree Search (MCTS) algorithm guided by process rewards for LLM self-training, incorporating selection, expansion, simulation, and backpropagation phases.","centrality":"contribution","entry":"MCTS_search","entry_sha256":"9c7f89c86df49382","n_bricks":12,"bricks":[{"entry":"MCTS_search","code_sha256":"9c7f89c86df49382","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"executeRound","code_sha256":"68319c1da6a20dbd","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"treeNode","code_sha256":"ca2e487758bc8d8b","role":"helper","order":2,"level":1,"status":"ran"},{"entry":"back_propagate","code_sha256":"15d94bcdfc2d9d1b","role":"update_rule","order":3,"level":0,"status":"unverified"},{"entry":"expand","code_sha256":"972b9f317f5321f0","role":"sampler","order":4,"level":0,"status":"unverified"},{"entry":"getBestChild","code_sha256":"fb7427c831c79168","role":"helper","order":5,"level":1,"status":"ran_draft_wrong"},{"entry":"greedyPolicy","code_sha256":"921b11d38034e3e8","role":"sampler","order":6,"level":0,"status":"unverified"},{"entry":"randomPolicy","code_sha256":"f2cd3cffcc558e0c","role":"sampler","order":7,"level":0,"status":"unverified"},{"entry":"selectNode","code_sha256":"88d52f64be6d8180","role":"sampler","order":8,"level":1,"status":"ran_draft_wrong"},{"entry":"get_next_steps_expand","code_sha256":"4fd1ea2325d783a5","role":"helper","order":9,"level":0,"status":"unverified"},{"entry":"get_next_steps_roll","code_sha256":"91b601baaf0d2b44","role":"helper","order":10,"level":1,"status":"ran_draft_wrong"},{"entry":"isTerminal","code_sha256":"04c9e8ce083656fc","role":"helper","order":11,"level":1,"status":"ran_violates"}],"ran_individually":5,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1,"ran_draft_wrong":3,"ran_violates":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3375f652d246","n_siblings":1,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"8154ef75cf9c55d6","source_kind":"harvested","method_name":"ReST-MCTS * ","realizes_method":"ReST-MCTS * ","graph_method":"ReST-MCTS * ","realizes_severed":false,"claim":"The code implements a Monte Carlo Tree Search (MCTS) algorithm guided by process rewards for LLM self-training, involving selection, expansion, simulation, and backpropagation phases.","centrality":"contribution","entry":"MCTS_search","entry_sha256":"e819d89ad4828066","n_bricks":12,"bricks":[{"entry":"MCTS_search","code_sha256":"e819d89ad4828066","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"executeRound","code_sha256":"0f8338c98de6cd72","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"treeNode","code_sha256":"ca2e487758bc8d8b","role":"helper","order":2,"level":1,"status":"ran"},{"entry":"back_propagate","code_sha256":"15d94bcdfc2d9d1b","role":"update_rule","order":3,"level":0,"status":"unverified"},{"entry":"expand","code_sha256":"152f75c9b44ec04e","role":"sampler","order":4,"level":0,"status":"unverified"},{"entry":"getBestChild","code_sha256":"a291959b6558d330","role":"helper","order":5,"level":1,"status":"ran_draft_wrong"},{"entry":"greedyPolicy","code_sha256":"5eb7f8be714f63db","role":"sampler","order":6,"level":0,"status":"unverified"},{"entry":"randomPolicy","code_sha256":"735d77158ce66113","role":"sampler","order":7,"level":0,"status":"unverified"},{"entry":"selectNode","code_sha256":"3e9b96d2d986aaae","role":"sampler","order":8,"level":1,"status":"ran_draft_wrong"},{"entry":"get_next_steps_expand","code_sha256":"a6cb18e8066512b4","role":"helper","order":9,"level":0,"status":"unverified"},{"entry":"get_next_steps_roll","code_sha256":"d48bb511335b496a","role":"helper","order":10,"level":1,"status":"ran_draft_wrong"},{"entry":"isTerminal","code_sha256":"04c9e8ce083656fc","role":"helper","order":11,"level":1,"status":"ran_violates"}],"ran_individually":5,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1,"ran_draft_wrong":3,"ran_violates":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3375f652d246","n_siblings":1,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"3375f652d246","realizes_method":"ReST-MCTS * ","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["10ea1eb46cbb16eb","8154ef75cf9c55d6"]},{"group":"ed313cc78539","realizes_method":"ReST-MCTS * ","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["47b6385d7f7a0f6a"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2406.03816"},"call":"assembly(arxiv_id=\"2406.03816\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2406.03816.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2406.03816.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/THUDM/ReST-MCTS","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DIRECT-BIT/SRA-MCTS","reach":null}],"summary":{"ran_draft_wrong":7,"ran_violates":1,"ran":1,"unverified":13},"n_samples":22,"n_ran":9,"n_constructed":1,"n_ran_checked":2,"n_instrument":7,"n_unverified":13,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":13,"ran":6,"n_ran_checked":2,"n_instrument":4,"repositories":1},"listed":{"samples":9,"ran":3,"n_ran_checked":0,"n_instrument":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":13,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":8,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"fb7427c831c79168","code_sha256_prefix":"fb7427c831c79168","entry":"getBestChild","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:MockMCTSNode/0/?, mcts_task:MockMCTSTask/0/?","fixture_out_type":"MockMCTSNode","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"fb7427c831c79168"}},{"code_sha256":"a291959b6558d330","code_sha256_prefix":"a291959b6558d330","entry":"getBestChild","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:Node/0/?, mcts_task:MCTSTask/0/?","fixture_out_type":"Node","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a291959b6558d330"}},{"code_sha256":"91b601baaf0d2b44","code_sha256_prefix":"91b601baaf0d2b44","entry":"get_next_steps_roll","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"y:str/0/str, step_n:int/0/int, mcts_task:MockMCTSTask/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"91b601baaf0d2b44"}},{"code_sha256":"d48bb511335b496a","code_sha256_prefix":"d48bb511335b496a","entry":"get_next_steps_roll","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"y:str/0/str, step_n:int/0/int, mcts_task:MockMCTSTask/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d48bb511335b496a"}},{"code_sha256":"63ea91a630010b0e","code_sha256_prefix":"63ea91a630010b0e","entry":"gpt_usage","repo":"thudm/rest-mcts","repo_kind":"official","path":"models/model.py","file_url":"https://github.com/thudm/rest-mcts/blob/HEAD/models/model.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"backend:str/0/str","fixture_out_type":"dict","retrieve_with":{"tool":"get_code","code_sha256":"63ea91a630010b0e"},"code_page":"/code/gpt-usage","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thudm/rest-mcts when it was checked","mcp_get_code":{"code_sha256":"63ea91a630010b0e"}},{"code_sha256":"04c9e8ce083656fc","code_sha256_prefix":"04c9e8ce083656fc","entry":"isTerminal","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"node:Node/0/?, mcts_task:MCTSTask/0/?","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"04c9e8ce083656fc"}},{"code_sha256":"88d52f64be6d8180","code_sha256_prefix":"88d52f64be6d8180","entry":"selectNode","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:MCTSNode/0/?, mcts_task:MCTSTask/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"88d52f64be6d8180"}},{"code_sha256":"3e9b96d2d986aaae","code_sha256_prefix":"3e9b96d2d986aaae","entry":"selectNode","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"node:MCTSNode/0/?, mcts_task:MCTSTask/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3e9b96d2d986aaae"}},{"code_sha256":"ca2e487758bc8d8b","code_sha256_prefix":"ca2e487758bc8d8b","entry":"treeNode","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"treeNode","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"ca2e487758bc8d8b"}},{"code_sha256":"9c7f89c86df49382","code_sha256_prefix":"9c7f89c86df49382","entry":"MCTS_search","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"9c7f89c86df49382"}},{"code_sha256":"e819d89ad4828066","code_sha256_prefix":"e819d89ad4828066","entry":"MCTS_search","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e819d89ad4828066"}},{"code_sha256":"15d94bcdfc2d9d1b","code_sha256_prefix":"15d94bcdfc2d9d1b","entry":"back_propagate","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"15d94bcdfc2d9d1b"}},{"code_sha256":"68319c1da6a20dbd","code_sha256_prefix":"68319c1da6a20dbd","entry":"executeRound","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"68319c1da6a20dbd"}},{"code_sha256":"0f8338c98de6cd72","code_sha256_prefix":"0f8338c98de6cd72","entry":"executeRound","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0f8338c98de6cd72"}},{"code_sha256":"972b9f317f5321f0","code_sha256_prefix":"972b9f317f5321f0","entry":"expand","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/expand","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"972b9f317f5321f0"}},{"code_sha256":"152f75c9b44ec04e","code_sha256_prefix":"152f75c9b44ec04e","entry":"expand","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/expand","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"152f75c9b44ec04e"}},{"code_sha256":"4fd1ea2325d783a5","code_sha256_prefix":"4fd1ea2325d783a5","entry":"get_next_steps_expand","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"4fd1ea2325d783a5"}},{"code_sha256":"a6cb18e8066512b4","code_sha256_prefix":"a6cb18e8066512b4","entry":"get_next_steps_expand","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a6cb18e8066512b4"}},{"code_sha256":"921b11d38034e3e8","code_sha256_prefix":"921b11d38034e3e8","entry":"greedyPolicy","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"921b11d38034e3e8"}},{"code_sha256":"5eb7f8be714f63db","code_sha256_prefix":"5eb7f8be714f63db","entry":"greedyPolicy","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5eb7f8be714f63db"}},{"code_sha256":"f2cd3cffcc558e0c","code_sha256_prefix":"f2cd3cffcc558e0c","entry":"randomPolicy","repo":"THUDM/ReST-MCTS","repo_kind":"official","path":"MCTS/mcts.py","file_url":"https://github.com/THUDM/ReST-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THUDM/ReST-MCTS when it was checked","mcp_get_code":{"code_sha256":"f2cd3cffcc558e0c"}},{"code_sha256":"735d77158ce66113","code_sha256_prefix":"735d77158ce66113","entry":"randomPolicy","repo":"DIRECT-BIT/SRA-MCTS","repo_kind":"listed","path":"MCTS/mcts.py","file_url":"https://github.com/DIRECT-BIT/SRA-MCTS/blob/HEAD/MCTS/mcts.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"735d77158ce66113"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"32e0da3064c1fa942add9f2f3cda8cd11f1031ae5e566f92e45c0279bc1f8874","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}