4 of 4 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, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 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/1806.01445.json · badge: /api/ran/1806.01445.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 |
|---|---|---|
| francoisluus/KGReasoning | extension (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Identity | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from akirato/perm-gaussiankg pointer only; the stored copy get_code serves, from akirato/perm-gaussiankg, is pointer only (licence: GPL-3.0) · get_code("f44985272d18127a") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. A run is recorded. |
| eval_tuple | Ran ran; our contract draft was wrong, not the code |
francoisluus/KGReasoning/util.py code served (permissive licence) · get_code("08bc9653c017dfb5") 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 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.
|
| list2tuple | Ran ran; our contract draft was wrong, not the code |
francoisluus/KGReasoning/util.py code served (permissive licence) · get_code("8c314b5b308ab1ad") 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.
|
| tuple2list | Ran ran; our contract draft was wrong, not the code |
francoisluus/KGReasoning/util.py code served (permissive licence) · get_code("bbd072fbd86e1541") 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. 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.
|
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 4 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 4 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 |
|---|---|---|---|
| Identity | 7 other papers 7 later |
1909.05311 (2019-09) Graph-Based Reasoning over Heterogeneous External Knowledge for Commonsense Question Answering |
2002.05969 (2020-02) Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings 2006.12862 (2020-06) Automatic Data Augmentation for Generalization in Deep Reinforcement Learning and 4 more not named here |
| eval_tuple | 4 other papers 4 later |
2010.11465 (2020-10) Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs |
2204.12847 (2022-04) Query2Particles: Knowledge Graph Reasoning with Particle Embeddings 2209.14464 (2022-09) Neural Methods for Logical Reasoning Over Knowledge Graphs and 1 more not named here |
| list2tuple | 4 other papers 4 later |
2010.11465 (2020-10) Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs |
2204.12847 (2022-04) Query2Particles: Knowledge Graph Reasoning with Particle Embeddings 2209.14464 (2022-09) Neural Methods for Logical Reasoning Over Knowledge Graphs and 1 more not named here |
| tuple2list | 4 other papers 4 later |
2010.11465 (2020-10) Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs |
2204.12847 (2022-04) Query2Particles: Knowledge Graph Reasoning with Particle Embeddings 2209.14464 (2022-09) Neural Methods for Logical Reasoning Over Knowledge Graphs and 1 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple unobserved edges, entities, and variables. For instance, given an incomplete biological knowledge graph, we might want to predict "em what drugs are likely to target proteins involved with both diseases X and Y?" -- a query that requires reasoning about all possible proteins that {\em might} interact with diseases X and Y. Here we introduce a framework to efficiently make predictions about conjunctive logical queries -- a flexible but tractable subset of first-order logic -- on incomplete knowledge graphs. In our approach, we embed graph nodes in a low-dimensional space and represent logical operators as learned geometric operations (e.g., translation, rotation) in this embedding space. By performing logical operations within a low-dimensional embedding space, our approach achieves a time complexity that is linear in the number of query variables, compared to the exponential complexity required by a naive enumeration-based approach. We demonstrate the utility of this framework in two application studies on real-world datasets with millions of relations: predicting logical relationships in a network of drug-gene-disease interactions and in a graph-based representation of social interactions derived from a popular web forum.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.01445")
get_code_for_paper("1806.01445")
have("1806.01445")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.01445.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.01445)
Connect an agent — have() is free.