REVIEW 10 cited by
GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarking
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large language models~(LLM) like ChatGPT have become indispensable to artificial general intelligence~(AGI), demonstrating excellent performance in various natural language processing tasks. In the real world, graph data is ubiquitous and an essential part of AGI and prevails in domains like social network analysis, bioinformatics and recommender systems. The training corpus of large language models often includes some algorithmic components, which allows them to achieve certain effects on some graph data-related problems. However, there is still little research on their performance on a broader range of graph-structured data. In this study, we conduct an extensive investigation to assess the proficiency of LLMs in comprehending graph data, employing a diverse range of structural and semantic-related tasks. Our analysis encompasses 10 distinct tasks that evaluate the LLMs' capabilities in graph understanding. Through our study, we not only uncover the current limitations of language models in comprehending graph structures and performing associated reasoning tasks but also emphasize the necessity for further advancements and novel approaches to enhance their graph processing capabilities. Our findings contribute valuable insights towards bridging the gap between language models and graph understanding, paving the way for more effective graph mining and knowledge extraction.
Forward citations
Cited by 10 Pith papers
-
Agentic Graph Token Reasoning
Agentic Graph Token (AGT) reasoning lets an LLM iteratively select graph views, encode them as tokens, and reason step-by-step, beating static graph-token and text-agent baselines on seven graph domains.
-
GABench: A Comprehensive Benchmark for Evaluating LLM Agents on Graph Analysis Tasks
GABench provides the first agentic graph-analysis benchmark with 10,400 executable tasks, and finds existing LLM agents succeed on under 40% of complex graph tasks.
-
Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs
LG-Plug mines pseudo-OOD exposures from clustered unlabeled nodes via iterative LLM prompting and regularizes topology-driven graph OOD detectors, cutting FPR95 by ≥7% across six TAG benchmarks.
-
Harnessing Adaptive Topology Representations for Zero-Shot Graph Question Answering
DynamicTRF learns question-level preferences over eight graph representations and routes each query to the best one, improving zero-shot graph QA accuracy and output brevity on seven algorithmic and two downstream tasks.
-
Quantizing Text-attributed Graphs for Semantic-Structural Integration
STAG quantizes fused graph-structure and text embeddings into discrete tokens from a frozen LLM vocabulary, enabling competitive few-shot and zero-shot node classification with or without an LLM.
-
Generalizable LLM Learning of Graph Synthetic Data with Post-training Alignment
Post-training alignment on synthetic graph data yields statistically significant gains on some real-world implicit-graph tasks, but gains are inconsistent and multi-step reasoning remains fragile.
-
CS-Agent: LLM-based Community Search via Dual-agent Collaboration
CS-Agent, a Solver-Validator two-agent dialogue with a Decider selector, improves LLM community search on synthetic graphs, and GraphCS is a new benchmark for measuring it.
-
Walk&Retrieve: Simple Yet Effective Zero-shot Retrieval-Augmented Generation via Knowledge Graph Walks
Offline walks over a knowledge graph, verbalized into text and retrieved by embedding similarity, let a single LLM call answer multi-hop questions competitively without any fine-tuning.
-
Capabilities of GPT-5 on Multimodal Medical Reasoning
A benchmark study reports GPT-5 outperforming GPT-4o and pre-licensed human experts on most medical QA tasks, but not consistently on VQA-RAD.
-
LLMs Between the Nodes: Community Discovery Beyond Vectors
CommLLM, a two-step graph-to-text plus LLM prompting method, reports high NMI on six small networks, but its evaluation omits standard community-detection baselines and relies on a prompt tuned on one test set.
Discussion (0). Sign in to comment.