Papers › Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods
Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods
Shuming Liang, Yu Ding, Zhidong Li, Bin Liang, Siqi Zhang, Yang Wang, Fang Chen
This paper explores the ability of Graph Neural Networks (GNNs) in learning various forms of information for link prediction, alongside a brief review of existing link prediction methods. Our analysis reveals that GNNs cannot effectively learn structural information related to the number of common neighbors between two nodes, primarily due to the nature of set-based pooling of the neighborhood aggregation scheme. Also, our extensive experiments indicate that trainable node embeddings can improve the performance of GNN-based link prediction models. Importantly, we observe that the denser the graph, the greater such the improvement. We attribute this to the characteristics of node embeddings, where the link state of each link sample could be encoded into the embeddings of nodes that are involved in the neighborhood aggregation of the two nodes in that link sample. In denser graphs, every node could have more opportunities to attend the neighborhood aggregation of other nodes and encode states of more link samples to its embedding, thus learning better node embeddings for link prediction. Lastly, we demonstrate that the insights gained from our research carry important implications in identifying the limitations of existing link prediction methods, which could guide the future development of more robust algorithms.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2411.14711")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2411.14711", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2411.14711")
Code
Syntology 3 code samples harvested from 1 repository linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 3 samples from 1 repository, 3 ran (1 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
3 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 0 of the 3 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from astroming/GNNHE. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.
3a770ee50f27e1b9 · report
fixture: signature args:Args/0/? · returned dict · level recorded 2026-09-25 79fa2feaacf5673e · report
fixture: signature args:Args/0/?, paras:generator/0/? · returned Adam · level recorded 2026-09-25 76ea6d8c225e28b7 · report
fixture: signature edge_index:Tensor/2/int, num_nodes:int/0/int · returned int · level recorded 2026-09-25 Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Link Property Prediction | ogbl-citation2 | GCN + Heuristic Encoding | Ext. data | No | #6 of 23 | Archive leaderboard | report |
| Link Property Prediction | ogbl-citation2 | GCN + Heuristic Encoding | Number of params | 372674 | #6 of 23 | Archive leaderboard | report |
| Link Property Prediction | ogbl-citation2 | GCN + Heuristic Encoding | Test MRR | 0.8891 ± 0.0005 | #6 of 23 | Archive leaderboard | report |
| Link Property Prediction | ogbl-citation2 | GCN + Heuristic Encoding | Validation MRR | 0.8892 ± 0.0005 | #6 of 23 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ddi | GCN (node embedding) | Ext. data | No | #3 of 31 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ddi | GCN (node embedding) | Number of params | 5125250 | #3 of 31 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ddi | GCN (node embedding) | Test Hits@20 | 0.9549 ± 0.0073 | #3 of 31 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ddi | GCN (node embedding) | Validation Hits@20 | 0.9098 ± 0.0294 | #3 of 31 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ppa | GCN (node embedding) | Ext. data | No | #5 of 26 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ppa | GCN (node embedding) | Number of params | 148144898 | #5 of 26 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ppa | GCN (node embedding) | Test Hits@100 | 0.6354 ± 0.0121 | #5 of 26 | Archive leaderboard | report |
| Link Property Prediction | ogbl-ppa | GCN (node embedding) | Validation Hits@100 | 0.6524 ± 0.0096 | #5 of 26 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections