SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2103.03642 · AAAI · 2021

Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs

Jie Wang, Jiajun Chen, Feng Wu, Huarui He

arXiv · PDF · Open in the Atlas

Code that ran

4 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (4 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; 2 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/2103.03642.json · badge: /api/ran/2103.03642.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.

RepositoryRoleRan
MIRALab-USTC/KG-TACT marked official in Papers with Code
Papers with Code archive
4 ran · 2 no recorded run
FunctionStatusWhere it lives
Aggregator Ran
ran on a synthesized input · constructed an object; no result was computed
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("b72691639fe6422f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

GRUAggregator Ran
ran on a synthesized input · constructed an object; no result was computed
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("0b9c32ac6686b508")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

MLPAggregator Ran
ran on a synthesized input · constructed an object; no result was computed
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("13710970cf0a5c04")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

SumAggregator Ran
ran on a synthesized input · constructed an object; no result was computed
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("53b01e6ba45b612b")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

RGCN Not yet run
unverified (harvested, no recorded run)
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("501363f5d25987be")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

RGCNLayer Not yet run
unverified (harvested, no recorded run)
MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py
pointer only (licence: NONE) · get_code("bb295f8a7aded734")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, MIRALab-USTC/KG-TACT when it was checked. 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.

Also present in other papers' code

Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 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 2 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.

FunctionAlso present inEarliest-datedOthers named
Aggregator
brick of this paper's assembly: helper
1 other paper
1 later
2208.00850 (2022-08)
Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs
GRUAggregator
brick of this paper's assembly: model
1 other paper
1 later
2208.00850 (2022-08)
Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs
MLPAggregator
brick of this paper's assembly: model
1 other paper
1 later
2208.00850 (2022-08)
Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs
SumAggregator
brick of this paper's assembly: model
1 other paper
1 later
2208.00850 (2022-08)
Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs

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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Inductive link prediction-where entities during training and inference stages can be different-has been shown to be promising for completing continuously evolving knowledge graphs. Existing models of inductive reasoning mainly focus on predicting missing links by learning logical rules. However, many existing approaches do not take into account semantic correlations between relations, which are commonly seen in real-world knowledge graphs. To address this challenge, we propose a novel inductive reasoning approach, namely TACT, which can effectively exploit Topology-Aware CorrelaTions between relations in an entity-independent manner. TACT is inspired by the observation that the semantic correlation between two relations is highly correlated to their topological structure in knowledge graphs. Specifically, we categorize all relation pairs into several topological patterns, and then propose a Relational Correlation Network (RCN) to learn the importance of the different patterns for inductive link prediction. Experiments demonstrate that TACT can effectively model semantic correlations between relations, and significantly outperforms existing state-of-the-art methods on benchmark datasets for the inductive link prediction task.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2103.03642")
get_code_for_paper("2103.03642")
have("2103.03642")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2103.03642.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2103.03642.svg)](https://syntology.ai/paper/2103.03642)

Connect an agent — have() is free.