Detecting Miscitation on the Scholarly Web through LLM-Augmented Text-Rich Graph Learning
Huidong Wu, Haojia Xiang, Jingtong Gao, Xiangyu Zhao, Dengsheng Wu, Jianping Li
摘要
Scholarly web is a vast network of knowledge connected by citations. However, this system is increasingly compromised by miscitation, where references do not support or even contradict the claims they are cited for. Current miscitation detection methods, which primarily rely on semantic similarity or network anomalies, struggle to capture the nuanced relationship between a citation's context and its place in the wider network. While large language models (LLMs) offer powerful capabilities in semantic reasoning for this task, their deployment is hindered by hallucination risks and high computational costs. In this work, we introduce LLM-Augmented Graph Learning-based Miscitation Detector (LAGMiD), a novel framework that leverages LLMs for deep semantic reasoning over citation graphs and distills this knowledge into graph neural networks (GNNs) for efficient and scalable miscitation detection. Specifically, LAGMiD introduces an evidence-chain reasoning mechanism, which uses chain-of-thought prompting, to perform multi-hop citation tracing and assess semantic fidelity. To reduce LLM inference costs, we design a knowledge distillation method aligning GNN embeddings with intermediate LLM reasoning states. A collaborative learning strategy further routes complex cases to the LLM while optimizing the GNN for structurebased generalization. Experiments on three real-world benchmarks show that LAGMiD achieves state-of-the-art miscitation detection with significantly reduced inference cost. The implementation code is available at: https://github.com/Applied-Machine-Learning- Lab/WWW2026_LAGMiD. CCS Concepts • Information systems → Web mining.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper20
- Chain-of-Thought Prompting Elicits Reasoning in Large Language ModelsJason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma 等NeurIPS 2022 · 被引用 22,562 次
- S2ORC: The Semantic Scholar Open Research CorpusKyle Lo, Lucy Lu Wang, Mark Neumann, Rodney Kinney 等ACL 2020 · 被引用 424 次
- Can Language Models Solve Graph Problems in Natural Language?Heng Wang, Shangbin Feng, Tianxing He, Zhaoxuan Tan 等NeurIPS 2023 · 被引用 420 次
- G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question AnsweringXiaoxin He, Yijun Tian, Yifei Sun, Nitesh V. Chawla 等NeurIPS 2024 · 被引用 384 次
- Talk like a Graph: Encoding Graphs for Large Language ModelsBahare Fatemi, Jonathan Halcrow, Bryan PerozziICLR 2024 · 被引用 194 次
相关 Paper
- DuoKD: Dual Knowledge Distillation from Large Language Models for Robust Graph Neural NetworksCuiying Huo, Xiaotong Huang, Dongxiao He, Yixuan Du 等AAAI 2026
- Large Language Model Meets Graph Neural Network in Knowledge DistillationShengxiang Hu, Guobing Zou, Song Yang, Shiyi Lin 等AAAI 2025 · 被引用 19 次
- Large Language Models are Good Relational LearnersFang Wu, Vijay Prakash Dwivedi, Jure LeskovecACL 2025 · 被引用 10 次
- Court of LLMs: Evidence-Augmented Generation via Multi-LLM Collaboration for Text-Attributed Graph Anomaly DetectionYiming Xu, Jiarun Chen, Zhen Peng, Zihan Chen 等ACM MM 2025 · 被引用 3 次
- Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud DetectionTairan Huang, Yili Wang, Qiutong Li, Changlong He 等ACM MM 2025 · 被引用 10 次
