SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2208.00850 · IJCAI · 2022

Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs

Peng Zhang, Xiaohan Xu, Chaoyang Yan, Yongquan He, Chengpeng Chao

arXiv · PDF · Open in the Atlas

Code that ran

7 of 10 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (7 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 7 have no contract verdict; 0 failures of our instrument; 3 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/2208.00850.json · badge: /api/ran/2208.00850.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
Tebmer/SNRI marked official in Papers with Code
Papers with Code archive
7 ran · 3 no recorded run
FunctionStatusWhere it lives
Aggregator Ran
ran on a synthesized input · constructed an object; no result was computed
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("d46dff6f46c30ccc")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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.

BatchGRU Ran
ran on a synthesized input · constructed an object; no result was computed
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("3435ce02c9a39883")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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.

Discriminator Ran
ran on a synthesized input · constructed an object; no result was computed
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("d58499a1c7e73bae")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("8a3af90773c72327")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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.

Identity Ran
ran on a synthesized input · constructed an object; no result was computed
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("df20ae228378ef18")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("82fd85090dac6db9")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("89a158e1fe91f82a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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.

GraphClassifier Not yet run
unverified (harvested, no recorded run)
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("9771c2055d849ed6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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.

RGCN Not yet run
unverified (harvested, no recorded run)
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("73029d39434303a6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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)
Tebmer/SNRI/model/dgl/graph_classifier.py
pointer only (licence: NONE) · get_code("4eab4e0975e40901")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Tebmer/SNRI 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 10 samples lifted from this paper's linked repositories, 10 carry a function identity and 0 do not. Of the 10 distinct functions with an identity, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 1 later) and 5 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
Identity
brick of this paper's assembly: helper
26 other papers
14 dated earlier, 12 later · 22 only as an assembly brick
1512.03385 (2015-12)
Deep Residual Learning for Image Recognition
1806.09055 (2018-06)
DARTS: Differentiable Architecture Search
2002.05709 (2020-02)
A Simple Framework for Contrastive Learning of Visual Representations
and 23 more not named here
Aggregator
brick of this paper's assembly: helper
1 other paper
1 dated earlier
2103.03642 (2021-03)
Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs
GRUAggregator
brick of this paper's assembly: helper
1 other paper
1 dated earlier
2103.03642 (2021-03)
Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs
MLPAggregator
brick of this paper's assembly: helper
1 other paper
1 dated earlier
2103.03642 (2021-03)
Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs
SumAggregator
brick of this paper's assembly: helper
1 other paper
1 dated earlier
2103.03642 (2021-03)
Topology-Aware Correlations Between Relations for Inductive Link Prediction in 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 for knowledge graph aims at predicting missing links between unseen entities, those not shown in training stage. Most previous works learn entity-specific embeddings of entities, which cannot handle unseen entities. Recent several methods utilize enclosing subgraph to obtain inductive ability. However, all these works only consider the enclosing part of subgraph without complete neighboring relations, which leads to the issue that partial neighboring relations are neglected, and sparse subgraphs are hard to be handled. To address that, we propose Subgraph Neighboring Relations Infomax, SNRI, which sufficiently exploits complete neighboring relations from two aspects: neighboring relational feature for node feature and neighboring relational path for sparse subgraph. To further model neighboring relations in a global way, we innovatively apply mutual information (MI) maximization for knowledge graph. Experiments show that SNRI outperforms existing state-of-art methods by a large margin on inductive link prediction task, and verify the effectiveness of exploring complete neighboring relations in a global way to characterize node features and reason on sparse subgraphs.

For agents

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

get_harvested_code_for_paper("2208.00850")
get_code_for_paper("2208.00850")
have("2208.00850")

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

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

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

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

Connect an agent — have() is free.