1 of 2 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, 1 violated it and 0 have no contract verdict; 0 failures of our instrument; 1 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/2003.03190.json · badge: /api/ran/2003.03190.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 |
|---|---|---|
| zguo235/bayesian_retro | canonical (classifier label) classifier basis not recorded on the link |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_sru_requirement | Ran ran, violated the contract we drafted |
zguo235/bayesian_retro/onmt/models/sru.py code served (permissive licence) · get_code("0c93830510f645a3") 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. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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.
|
| seq_linear | Not yet run unverified (harvested, no recorded run) |
zguo235/bayesian_retro/onmt/modules/conv_multi_step_attention.py pointer only (licence: BSD-3-Clause); the stored copy get_code serves, from Alex-Fabbri/Multi-News, is pointer only (licence: NOASSERTION) · get_code("0c3bddd7d3eaba02") How it ranThe body of this sample is withheld: this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from Alex-Fabbri/Multi-News, and GitHub could not classify the licence of that repository (NOASSERTION). 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. No invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| check_sru_requirement | 8 other papers 6 dated earlier, 1 later, 1 same year, order not determinable |
1709.02755 (2017-09) Simple Recurrent Units for Highly Parallelizable Recurrence |
1805.11462 (2018-05) OpenNMT: Neural Machine Translation Toolkit 1906.06253 (2019-06) A Simple and Effective Approach to Automatic Post-Editing with Transfer Learning and 5 more not named here |
| seq_linear | 8 other papers 5 dated earlier, 2 later, 1 same year, order not determinable |
1805.11462 (2018-05) OpenNMT: Neural Machine Translation Toolkit |
1906.06253 (2019-06) A Simple and Effective Approach to Automatic Post-Editing with Transfer Learning 1906.07651 (2019-06) Scheduled Sampling for Transformers and 5 more not named here |
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.
The identification of synthetic routes that end with a desired product has been an inherently time-consuming process that is largely dependent on expert knowledge regarding a limited fraction of the entire reaction space. At present, emerging machine-learning technologies are overturning the process of retrosynthetic planning. The objective of this study is to discover synthetic routes backwardly from a given desired molecule to commercially available compounds. The problem is reduced to a combinatorial optimization task with the solution space subject to the combinatorial complexity of all possible pairs of purchasable reactants. We address this issue within the framework of Bayesian inference and computation. The workflow consists of two steps: a deep neural network is trained that forwardly predicts a product of the given reactants with a high level of accuracy, following which this forward model is inverted into the backward one via Bayes' law of conditional probability. Using the backward model, a diverse set of highly probable reaction sequences ending with a given synthetic target is exhaustively explored using a Monte Carlo search algorithm. The Bayesian retrosynthesis algorithm could successfully rediscover 80.3% and 50.0% of known synthetic routes of single-step and two-step reactions within top-10 accuracy, respectively, thereby outperforming state-of-the-art algorithms in terms of the overall accuracy. Remarkably, the Monte Carlo method, which was specifically designed for the presence of diverse multiple routes, often revealed a ranked list of hundreds of reaction routes to the same synthetic target. We investigated the potential applicability of such diverse candidates based on expert knowledge from synthetic organic chemistry.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.03190")
get_code_for_paper("2003.03190")
have("2003.03190")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.03190.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.03190)
Connect an agent — have() is free.