3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2406.07394.json · badge: /api/ran/2406.07394.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| trotsky1997/mathblackbox | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| extract_boxed_answer | Ran ran; our contract draft was wrong, not the code |
trotsky1997/mathblackbox/run_with_earlystopping.py pointer only (licence: NONE) · get_code("841780ad150562ae") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, trotsky1997/mathblackbox when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| last_boxed_only_string | Ran ran; our contract draft was wrong, not the code |
trotsky1997/mathblackbox/run_with_earlystopping.py pointer only (licence: NONE) · get_code("90b5c896e5eaea5e") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, trotsky1997/mathblackbox when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| remove_boxed | Ran ran; our contract draft was wrong, not the code |
trotsky1997/mathblackbox/run_with_earlystopping.py pointer only (licence: NONE) · get_code("9a85fff3911bdfa2") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, trotsky1997/mathblackbox when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| last_boxed_only_string | 9 other papers 1 dated earlier, 8 later |
2405.15179 (2024-05) VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks |
2410.02884 (2024-10) LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning 2410.15700 (2024-10) InternLM2.5-StepProver: Advancing Automated Theorem Proving via Critic-Guided Search and 6 more not named here |
| remove_boxed | 5 other papers 5 later |
2410.02884 (2024-10) LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning |
2025.findings-emnlp.598 (2025 (year only)) MMATH: A Multilingual Benchmark for Mathematical Reasoning 2502.12215 (2025-02) Revisiting the Test-Time Scaling of o1-like Models: Do they Truly Possess Test-Time Scaling Capabilities? and 2 more not named here |
| extract_boxed_answer | 2 other papers 2 later |
2410.02884 (2024-10) LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning |
2502.12215 (2025-02) Revisiting the Test-Time Scaling of o1-like Models: Do they Truly Possess Test-Time Scaling Capabilities? |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper introduces the MCT Self-Refine (MCTSr) algorithm, an innovative integration of Large Language Models (LLMs) with Monte Carlo Tree Search (MCTS), designed to enhance performance in complex mathematical reasoning tasks. Addressing the challenges of accuracy and reliability in LLMs, particularly in strategic and mathematical reasoning, MCTSr leverages systematic exploration and heuristic self-refine mechanisms to improve decision-making frameworks within LLMs. The algorithm constructs a Monte Carlo search tree through iterative processes of Selection, self-refine, self-evaluation, and Backpropagation, utilizing an improved Upper Confidence Bound (UCB) formula to optimize the exploration-exploitation balance. Extensive experiments demonstrate MCTSr's efficacy in solving Olympiad-level mathematical problems, significantly improving success rates across multiple datasets, including GSM8K, GSM Hard, MATH, and Olympiad-level benchmarks, including Math Odyssey, AIME, and OlympiadBench. The study advances the application of LLMs in complex reasoning tasks and sets a foundation for future AI integration, enhancing decision-making accuracy and reliability in LLM-driven applications.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.07394")
get_code_for_paper("2406.07394")
have("2406.07394")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.07394.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.07394)
Connect an agent — have() is free.