Marcel Hildebrandt, Volker Tresp, Mitchell Joblin, Martin Ringsquandl, Yunpu Ma, Jorge Andres Quintero Serna
None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 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.00461.json · badge: /api/ran/2001.00461.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 |
|---|---|---|
| m-hildebrandt/R2D2 | canonical (classifier label) classifier basis: census |
0 ran · 1 no recorded run |
| JohnKurian/R2D2 | community Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Agent | Not yet run unverified (harvested, no recorded run) |
JohnKurian/R2D2/code/model/agent.py code served (permissive licence) · get_code("1ca43d242ae5f22c") How it ranno invocation recorded. |
| nell_eval | Not yet run unverified (harvested, no recorded run) |
m-hildebrandt/R2D2/code/model/nell_eval.py code served (permissive licence) · get_code("b370161eb41f096d") How it ranno 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, 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 1 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 |
|---|---|---|---|
| nell_eval | 1 other paper 1 later |
2112.03324 (2021-12) Neuro-Symbolic Inductive Logic Programming with Logical Neural Networks |
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.
We propose a novel method for automatic reasoning on knowledge graphs based on debate dynamics. The main idea is to frame the task of triple classification as a debate game between two reinforcement learning agents which extract arguments -paths in the knowledge graph -with the goal to promote the fact being true (thesis) or the fact being false (antithesis), respectively. Based on these arguments, a binary classifier, called the judge, decides whether the fact is true or false. The two agents can be considered as sparse, adversarial feature generators that present interpretable evidence for either the thesis or the antithesis. In contrast to other black-box methods, the arguments allow users to get an understanding of the decision of the judge. Since the focus of this work is to create an explainable method that maintains a competitive predictive accuracy, we benchmark our method on the triple classification and link prediction task. Thereby, we find that our method outperforms several baselines on the benchmark datasets FB15k-237, WN18RR, and Hetionet. We also conduct a survey and find that the extracted arguments are informative for users.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.00461")
get_code_for_paper("2001.00461")
have("2001.00461")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.00461.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.00461)
Connect an agent — have() is free.