Browse State-of-the-Art › Link Sign Prediction
Link Sign Prediction
9 papers with code · 3 benchmarks · 2 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
3 leaderboard tables shown for this task, 3 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology 1 newer paper was judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 0 placed): Bitcoin-Alpha (1 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| Bitcoin-Alpha (2 rows) | SiGAT | Signed Graph Attention Networks | code | — | Compare |
| Epinions (2 rows) | SiGAT | Signed Graph Attention Networks | code | — | Compare |
| Slashdot (2 rows) | SiGAT | Signed Graph Attention Networks | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 21 · with a code link: 9 · where Syntology ran a sample: 3 (1 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (3 of 21 tagged: 1 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 21 of 21, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
10 Oct 2024 1 repository listedPositive and negative association prediction between gene and phenotype helps to illustrate the underlying mechanism of complex traits in organisms.
-
16 Aug 2024 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified (of 9 harvested samples) · 9 pointer-only (licence)Our goal is to address the explainability of decision-making for the downstream task of link sign prediction specific to signed graph neural networks.
-
17 Oct 2023 1 repository listedThe prevailing training approach feeds samples (edges) to models in a random order, resulting in equal contributions from each sample during the training process, but fails to account for varying learning difficulties…
-
13 Oct 2021 1 repository listed Syntology official (archive's flag): 10 ran · 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 13 harvested samples)Node embeddings are a powerful tool in the analysis of networks; yet, their full potential for the important task of node clustering has not been fully exploited.
-
22 Aug 2021 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)Signed bipartite networks are different from classical signed networks, which contain two different node sets and signed links between two node sets.
-
28 Aug 2020 1 repository listedComprehensive results on both link sign prediction and node recommendation task demonstrate the effectiveness of DVE.
-
2 Jun 2020 1 repository listedIn this work we propose an inference mechanism for fitting a generative, agent-like model of opinion dynamics to real-world social traces.
-
26 Jun 2019 1 repository listedWe evaluate the proposed SiGAT method by applying it to the signed link prediction task.
-
7 Jan 2019 1 repository listedAs an effective approach to solve graph mining problems, network embedding aims to learn a low-dimensional feature vector representation for each node of a given network.
-
KAN KAN Buff Signed Graph Neural Networks?1 Jan 2025 0 repositories listedGraph Representation Learning aims to create effective embeddings for nodes and edges that encapsulate their features and relationships.
-
Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs25 Dec 2024 0 repositories listedHow can we effectively and efficiently learn node representations in signed bipartite graphs?
-
Graph Spring Neural ODEs for Link Sign Prediction17 Dec 2024 0 repositories listedSigned graphs allow for encoding positive and negative relations between nodes and are used to model various online activities.
-
DropEdge not Foolproof: Effective Augmentation Method for Signed Graph Neural Networks29 Sep 2024 0 repositories listedThe paper discusses signed graphs, which model friendly or antagonistic relationships using edges marked with positive or negative signs, focusing on the task of link sign prediction.
-
Adversarial Robustness of Link Sign Prediction in Signed Graphs19 Jan 2024 0 repositories listedSigned graphs serve as fundamental data structures for representing positive and negative relationships in social networks, with signed graph neural networks (SGNNs) emerging as the primary tool for their analysis.
-
SGA: A Graph Augmentation Method for Signed Graph Neural Networks15 Oct 2023 0 repositories listedSigned Graph Neural Networks (SGNNs) are vital for analyzing complex patterns in real-world signed graphs containing positive and negative links.
-
A Signed Subgraph Encoding Approach via Linear Optimization for Link Sign Prediction17 May 2023 0 repositories listedIn this paper, we consider the problem of inferring the sign of a link based on limited sign data in signed networks.
-
A Graph Convolution for Signed Directed Graphs23 Aug 2022 0 repositories listedA signed directed graph is a graph with sign and direction information on the edges.
-
Signed Graph Neural Networks: A Frequency Perspective15 Aug 2022 0 repositories listedGraph convolutional networks (GCNs) and its variants are designed for unsigned graphs containing only positive links.
-
Representation Learning in Continuous-Time Dynamic Signed Networks7 Jul 2022 0 repositories listedSigned networks allow us to model conflicting relationships and interactions, such as friend/enemy and support/oppose.
-
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction21 Sep 2021 0 repositories listedGraph Neural Networks (GNNs) have been widely used to learn representations on graphs and tackle many real-world problems from a wide range of domains.
-
Signed Graph Diffusion Network28 Dec 2020 0 repositories listedGiven a signed social graph, how can we learn appropriate node representations to infer the signs of missing edges?
Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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