Research map / Graph learning / GNN architectures

SignFlow Bipartite Subgraph Network For Large-Scale Graph Link Sign Prediction

NeurIPS 2025 · Graph learning › GNN architectures · approach: Graph rewiring and scalable message passing

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes SignFlow, a bipartite subgraph network for scalable link sign prediction in large signed bipartite graphs, addressing space and time complexity.

Problem

Link sign prediction in signed bipartite graphs (e.g., social networks, recommender systems) faces prohibitive space and time complexity when scaled to large graphs.

Approach

A subgraph-based network for signed bipartite graphs that aims to reduce the space and time costs of sign prediction at scale; specific mechanism not stated in the available abstract.

Closest papers by meaning

• Self-Explainable Graph Transformer for Link Sign Prediction (AAAI 2025 · similarity 0.88)
• Structure Balance and Gradient Matching-Based Signed Graph Condensation (AAAI 2025 · similarity 0.87)
• DropEdge not Foolproof: Effective Augmentation Method for Signed Graph Neural Networks (NeurIPS 2024 · similarity 0.86)
• GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction (NeurIPS 2026 · similarity 0.86)
• An Efficient Subgraph-Inferring Framework for Large-Scale Heterogeneous Graphs (AAAI 2024 · similarity 0.85)
• Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs (ICML 2024 · similarity 0.85)