11 of 22 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 11 have no contract verdict; 0 failures of our instrument; 11 no recorded run), measured 2026-11-21; 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/2001.04555.json · badge: /api/ran/2001.04555.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 |
|---|---|---|
| probcomp/optimal-approximate-sampling | canonical (classifier label) classifier basis: census |
11 ran · 11 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_common_denominator | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/utils.py code served (permissive licence) · get_code("4cf28f8c3eba0421") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned int, ndim 0, dtype family int, 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.
|
| get_common_numerators | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/utils.py code served (permissive licence) · get_code("388e095eeeca2661") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| get_delta_error | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/opt.py code served (permissive licence) · get_code("e716cfd09ac434c7") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) 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.
|
| get_initial_Ms | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/opt.py code served (permissive licence) · get_code("4fa6c82bf596ac2b") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| kernel_hellinger | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/divergences.py code served (permissive licence) · get_code("8e3254232604c04a") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) 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.
|
| kernel_tv | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/divergences.py code served (permissive licence) · get_code("7f88bdd1e0d18ad7") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (2, 4) 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.
|
| lcm | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/utils.py code served (permissive licence) · get_code("9a61b5ea009c49ab") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned int, ndim 0, dtype family int, 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.
|
| make_ddg_tree | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/tree.py code served (permissive licence) · get_code("9473b3dc91b4a9e3") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Node. 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.
|
| make_hamming_vector | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/matrix.py code served (permissive licence) · get_code("3ff5069ec587d49d") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| make_leaf_table | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/tree.py code served (permissive licence) · get_code("599e5c702aea357f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. 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.
|
| pack_tree | Ran ran on a synthesized input |
probcomp/optimal-approximate-sampling/src/packing.py code served (permissive licence) · get_code("97a14f39df6e7aa7") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned int, ndim 0, dtype family int, 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.
|
| construct_sample_ky_encoding | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/construct.py code served (permissive licence) · get_code("7f7a7496ddb342a9") How it ranno invocation recorded. |
| construct_sample_ky_matrix | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/construct.py code served (permissive licence) · get_code("6f620229d6782cd4") How it ranno invocation recorded. |
| construct_sample_ky_matrix_cached | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/construct.py code served (permissive licence) · get_code("8c103a34014ef59a") How it ranno invocation recorded. |
| find_optimal_indexes | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/opt.py code served (permissive licence) · get_code("30463725333b18bb") How it ranno invocation recorded. |
| kernel_pchi2 | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/divergences.py code served (permissive licence) · get_code("b542fca2f1e4b985") How it ranno invocation recorded. |
| make_ddg_matrix | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/matrix.py code served (permissive licence) · get_code("8d3912840cbc2ad0") How it ranno invocation recorded. |
| make_matrix | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/matrix.py code served (permissive licence) · get_code("18fdfd1e058d844d") How it ranno invocation recorded. |
| make_tree | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/tree.py code served (permissive licence) · get_code("4303f40052d64e52") How it ranno invocation recorded. |
| sample_ky_encoding | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/sample.py code served (permissive licence) · get_code("b8308fdb20d40153") How it ranno invocation recorded. |
| sample_ky_matrix | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/sample.py code served (permissive licence) · get_code("f19d056c1eb9addc") How it ranno invocation recorded. |
| sample_ky_matrix_cached | Not yet run unverified (harvested, no recorded run) |
probcomp/optimal-approximate-sampling/src/sample.py code served (permissive licence) · get_code("2ff3534a77da0bc7") How it ranno invocation recorded. |
Of 22 samples lifted from this paper's linked repositories, 22 carry a function identity and 0 do not. Of the 22 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 22 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.
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper addresses a fundamental problem in random variate generation: given access to a random source that emits a stream of independent fair bits, what is the most accurate and entropy-efficient algorithm for sampling from a discrete probability distribution $(p_1, \dots, p_n)$, where the probabilities of the output distribution $(\hat{p}_1, \dots, \hat{p}_n)$ of the sampling algorithm must be specified using at most $k$ bits of precision? We present a theoretical framework for formulating this problem and provide new techniques for finding sampling algorithms that are optimal both statistically (in the sense of sampling accuracy) and information-theoretically (in the sense of entropy consumption). We leverage these results to build a system that, for a broad family of measures of statistical accuracy, delivers a sampling algorithm whose expected entropy usage is minimal among those that induce the same distribution (i.e., is "entropy-optimal") and whose output distribution $(\hat{p}_1, \dots, \hat{p}_n)$ is a closest approximation to the target distribution $(p_1, \dots, p_n)$ among all entropy-optimal sampling algorithms that operate within the specified $k$-bit precision. This optimal approximate sampler is also a closer approximation than any (possibly entropy-suboptimal) sampler that consumes a bounded amount of entropy with the specified precision, a class which includes floating-point implementations of inversion sampling and related methods found in many software libraries. We evaluate the accuracy, entropy consumption, precision requirements, and wall-clock runtime of our optimal approximate sampling algorithms on a broad set of distributions, demonstrating the ways that they are superior to existing approximate samplers and establishing that they often consume significantly fewer resources than are needed by exact samplers.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.04555")
get_code_for_paper("2001.04555")
have("2001.04555")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.04555.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.04555)
Connect an agent — have() is free.