6 of 9 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; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 4 failures of our instrument; 3 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/1111.4246.json · badge: /api/ran/1111.4246.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 |
|---|---|---|
| mfouesneau/NUTS | reimplementation (classifier label) classifier basis: classifier_2025 |
6 ran · 0 no recorded run |
| JohannesBuchner/PinNUTS | extension (classifier label) classifier basis: classifier_2025 |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| find_reasonable_epsilon | Ran ran; our contract draft was wrong, not the code |
mfouesneau/NUTS/nuts/nuts.py code served (permissive licence) · get_code("20075d35f2319a01") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| grad_logLikelihood | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
mfouesneau/NUTS/examples/imf_examples.py code served (permissive licence) · get_code("537a746770a10e4a") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned ndarray, ndim 1, dtype family float, shape (1,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| leapfrog | Ran ran; our contract draft was wrong, not the code |
mfouesneau/NUTS/nuts/nuts.py code served (permissive licence) · get_code("7475a1db9181c908") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| logLikelihood | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
mfouesneau/NUTS/examples/imf_examples.py code served (permissive licence) · get_code("18842e42f9d6dd71") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned float64, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| random_PowerLaw | Ran ran, honoured the contract we drafted |
mfouesneau/NUTS/examples/imf_examples.py code served (permissive licence) · get_code("cb1a1453761fca1d") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned ndarray, ndim 1, dtype family float, shape (1000,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| stop_criterion | Ran ran, violated the contract we drafted |
mfouesneau/NUTS/nuts/nuts.py code served (permissive licence) · get_code("e6fec7e2a2392138") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned bool, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| build_tree | Not yet run unverified (harvested, no recorded run) |
JohannesBuchner/PinNUTS/pinnuts/pinnuts.py code served (permissive licence) · get_code("4d864798cca4b23b") How it ranno invocation recorded. |
| pinnuts | Not yet run unverified (harvested, no recorded run) |
JohannesBuchner/PinNUTS/pinnuts/pinnuts.py code served (permissive licence) · get_code("4f8a7d049558a7a8") How it ranno invocation recorded. |
| tree_sample | Not yet run unverified (harvested, no recorded run) |
JohannesBuchner/PinNUTS/pinnuts/pinnuts.py code served (permissive licence) · get_code("86a695959d00fddb") How it ranno invocation recorded. |
Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 9 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 6 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 |
|---|---|---|---|
| build_tree | 1 other paper 1 later |
1701.02434 (2017-01) A Conceptual Introduction to Hamiltonian Monte Carlo |
|
| pinnuts | 1 other paper 1 later |
1701.02434 (2017-01) A Conceptual Introduction to Hamiltonian Monte Carlo |
|
| tree_sample | 1 other paper 1 later |
1701.02434 (2017-01) A Conceptual Introduction to Hamiltonian Monte Carlo |
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.
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient information. These features allow it to converge to high-dimensional target distributions much more quickly than simpler methods such as random walk Metropolis or Gibbs sampling. However, HMC's performance is highly sensitive to two user-specified parameters: a step size ε and a desired number of steps L. In particular, if L is too small then the algorithm exhibits undesirable random walk behavior, while if L is too large the algorithm wastes computation. We introduce the No-U-Turn Sampler (NUTS), an extension to HMC that eliminates the need to set a number of steps L. NUTS uses a recursive algorithm to build a set of likely candidate points that spans a wide swath of the target distribution, stopping automatically when it starts to double back and retrace its steps. Empirically, NUTS perform at least as efficiently as and sometimes more efficiently than a well tuned standard HMC method, without requiring user intervention or costly tuning runs. We also derive a method for adapting the step size parameter ε on the fly based on primal-dual averaging. NUTS can thus be used with no hand-tuning at all. NUTS is also suitable for applications such as BUGS-style automatic inference engines that require efficient "turnkey" sampling algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1111.4246")
get_code_for_paper("1111.4246")
have("1111.4246")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1111.4246.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1111.4246)
Connect an agent — have() is free.