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; 0 honoured the contract we drafted, 0 violated it and 6 have no contract verdict; 0 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/1911.12809.json · badge: /api/ran/1911.12809.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 |
|---|---|---|
| georgedeath/egreedy | canonical (classifier label) classifier basis: census |
6 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| EI | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/standard_acq_funcs_minimize.py code served (permissive licence) · get_code("200d26a3d7ada429") 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 ndarray, ndim 2, dtype family float, shape (4, 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.
|
| PFRandom | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/egreedy_acq_funcs_minimize.py code served (permissive licence) · get_code("b678c5f9f5359435") 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 ndarray, ndim 1, dtype family float, shape (3,) 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.
|
| PI | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/standard_acq_funcs_minimize.py code served (permissive licence) · get_code("68a3c0db517ad373") 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 ndarray, ndim 2, dtype family float, shape (4, 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.
|
| UCB | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/standard_acq_funcs_minimize.py code served (permissive licence) · get_code("065426747a4fd65a") 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 ndarray, ndim 1, dtype family float, shape (5,) 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.
|
| eFront | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/egreedy_acq_funcs_minimize.py code served (permissive licence) · get_code("8ceb86a31b462cf2") 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 ndarray, ndim 1, dtype family float, shape (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.
|
| eRandom | Ran ran on a synthesized input |
georgedeath/egreedy/egreedy/acquisition_functions/egreedy_acq_funcs_minimize.py code served (permissive licence) · get_code("9c15aa08b0ecead0") 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 ndarray, ndim 1, dtype family float, shape (3,) 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_1thing | Not yet run unverified (harvested, no recorded run) |
georgedeath/egreedy/egreedy/test_problems/push_world.py code served (permissive licence) · get_code("080e6f7ac4e38524") How it ranno invocation recorded. |
| make_base | Not yet run unverified (harvested, no recorded run) |
georgedeath/egreedy/egreedy/test_problems/push_world.py code served (permissive licence) · get_code("e5b288345afd0b4a") How it ranno invocation recorded. |
| simu_push_4D | Not yet run unverified (harvested, no recorded run) |
georgedeath/egreedy/egreedy/test_problems/push_world.py code served (permissive licence) · get_code("16ec59f1c3ac5771") 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, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 8 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 |
|---|---|---|---|
| simu_push_4D | 1 other paper 1 later |
2004.08349 (2020-04) What do you Mean? The Role of the Mean Function in Bayesian Optimisation |
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.
The performance of acquisition functions for Bayesian optimisation to locate the global optimum of continuous functions is investigated in terms of the Pareto front between exploration and exploitation. We show that Expected Improvement (EI) and the Upper Confidence Bound (UCB) always select solutions to be expensively evaluated on the Pareto front, but Probability of Improvement is not guaranteed to do so and Weighted Expected Improvement does so only for a restricted range of weights. We introduce two novel $ε$-greedy acquisition functions. Extensive empirical evaluation of these together with random search, purely exploratory, and purely exploitative search on 10 benchmark problems in 1 to 10 dimensions shows that $ε$-greedy algorithms are generally at least as effective as conventional acquisition functions (e.g., EI and UCB), particularly with a limited budget. In higher dimensions $ε$-greedy approaches are shown to have improved performance over conventional approaches. These results are borne out on a real world computational fluid dynamics optimisation problem and a robotics active learning problem. Our analysis and experiments suggest that the most effective strategy, particularly in higher dimensions, is to be mostly greedy, occasionally selecting a random exploratory solution.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.12809")
get_code_for_paper("1911.12809")
have("1911.12809")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.12809.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.12809)
Connect an agent — have() is free.