activity
20192026
most citedEfficient Top-k Vulnerable Nodes Detection in Uncertain Graphs

33 citations · 34 across the 10 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

cs.CL2026

Answer-then-Edit: Reasoning Skeleton Editing for Anti-Distillation with Preserved Utility

Fan Li, Mengting Pan, Sijia Xu +3

Proprietary large language models (LLMs) entail substantial intellectual and financial investment, making them valuable intellectual property (IP). However, even when deployed via…

cs.CL2026

Trace Only What You Need: Structure-Aware On-Demand Hypergraph Memory for Long-Document Question Answering

Xiangjun Zai, Xingyu Tan, Chen Chen +2

Long-document question answering (QA) requires large language models (LLMs) to reason over evidence scattered across lengthy documents, where answers often depend on event order, s…

cs.LG2026

Provably Communication-Efficient and Privacy-Preserving Federated Graph Neural Networks

Zhishuai Guo, Wenhan Wu, Chen Chen +3

Graph neural networks (GNNs) achieve strong performance on relational data, but real-world graphs are often distributed across organizations that cannot share raw data due to priva…

cs.CR2026

Universal Graph Backdoor Defense: A Feature-based Homophily Perspective

Mengting Pan, Fan Li, Chen Chen +1

Graph neural networks (GNNs) have achieved remarkable success in relational learning. However, their vulnerability to graph backdoor attacks (GBAs) poses a significant barrier to b…

cs.LG2026

Anchor-guided Hypergraph Condensation with Dual-level Discrimination

Fan Li, Xiaoyang Wang, Chen Chen +1

The increasing prevalence of large-scale hypergraphs poses significant computational challenges for hypergraph neural network (HNN) training. To address this, hypergraph condensati…