4 of 14 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 4 have no contract verdict; 0 failures of our instrument; 10 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/1907.08268.json · badge: /api/ran/1907.08268.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 |
|---|---|---|
| PrincetonLIPS/reversible-inductive-construction | canonical (classifier label) classifier basis: census |
4 ran · 10 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| aggregate_by_incidence | Ran ran on a synthesized input |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/message_passing.py code served (permissive licence) · get_code("7607b89dd113c5d9") 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.
|
| aggregate_by_incidence_impl | Ran ran on a synthesized input |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/message_passing.py code served (permissive licence) · get_code("70f6038f3ec324cb") 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.
|
| minmax | Ran ran on a synthesized input |
PrincetonLIPS/reversible-inductive-construction/code/genric/laman/joint_network.py code served (permissive licence) · get_code("7f42965b0968e4e8") 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 3, dtype family float; 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.
|
| multi_classification_prediction | Ran ran on a synthesized input |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/classification.py code served (permissive licence) · get_code("e578849827120611") 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. 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.
|
| comp_mols | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/molecule_edit.py code served (permissive licence) · get_code("9f98b1761accdc8a") How it ranno invocation recorded. |
| get_mol | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/chemutils.py code served (permissive licence) · get_code("7e083b66cf9e7a92") How it ranno invocation recorded. |
| get_mol_2D | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/chemutils.py code served (permissive licence) · get_code("ba2ac5b259eca2e6") How it ranno invocation recorded. |
| get_smiles_2D | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/chemutils.py code served (permissive licence) · get_code("37b4b9d7aba88ad0") How it ranno invocation recorded. |
| get_vocab | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/data_utils.py code served (permissive licence) · get_code("f8f8fa3bcc697f45") How it ranno invocation recorded. |
| make_action_mpn | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/message_passing.py code served (permissive licence) · get_code("2396d7af408f88fb") How it ranno invocation recorded. |
| multi_classification_coarse_to_fine_loss | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/classification.py code served (permissive licence) · get_code("4672bd596d3a6281") How it ranno invocation recorded. |
| multi_classification_loss | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/model/classification.py code served (permissive licence) · get_code("92535356e9126ff1") How it ranno invocation recorded. |
| my_explicit_valence | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/molecule_edit.py code served (permissive licence) · get_code("d1e046b976a5631c") How it ranno invocation recorded. |
| my_implicit_valence | Not yet run unverified (harvested, no recorded run) |
PrincetonLIPS/reversible-inductive-construction/code/genric/molecule_edit.py code served (permissive licence) · get_code("60a5e5ecfd3deb69") How it ranno invocation recorded. |
Of 14 samples lifted from this paper's linked repositories, 14 carry a function identity and 0 do not. Of the 14 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 14 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The success of generative modeling in continuous domains has led to a surge of interest in generating discrete data such as molecules, source code, and graphs. However, construction histories for these discrete objects are typically not unique and so generative models must reason about intractably large spaces in order to learn. Additionally, structured discrete domains are often characterized by strict constraints on what constitutes a valid object and generative models must respect these requirements in order to produce useful novel samples. Here, we present a generative model for discrete objects employing a Markov chain where transitions are restricted to a set of local operations that preserve validity. Building off of generative interpretations of denoising autoencoders, the Markov chain alternates between producing 1) a sequence of corrupted objects that are valid but not from the data distribution, and 2) a learned reconstruction distribution that attempts to fix the corruptions while also preserving validity. This approach constrains the generative model to only produce valid objects, requires the learner to only discover local modifications to the objects, and avoids marginalization over an unknown and potentially large space of construction histories. We evaluate the proposed approach on two highly structured discrete domains, molecules and Laman graphs, and find that it compares favorably to alternative methods at capturing distributional statistics for a host of semantically relevant metrics.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1907.08268")
get_code_for_paper("1907.08268")
have("1907.08268")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1907.08268.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1907.08268)
Connect an agent — have() is free.