REVIEW 2 cited by
Beyond Text: A Deep Dive into Large Language Models' Ability on Understanding Graph Data
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 (LLMs) have achieved impressive performance on many natural language processing tasks. However, their capabilities on graph-structured data remain relatively unexplored. In this paper, we conduct a series of experiments benchmarking leading LLMs on diverse graph prediction tasks spanning node, edge, and graph levels. We aim to assess whether LLMs can effectively process graph data and leverage topological structures to enhance performance, compared to specialized graph neural networks. Through varied prompt formatting and task/dataset selection, we analyze how well LLMs can interpret and utilize graph structures. By comparing LLMs' performance with specialized graph models, we offer insights into the strengths and limitations of employing LLMs for graph analytics. Our findings provide insights into LLMs' capabilities and suggest avenues for further exploration in applying them to graph analytics.
Forward citations
Cited by 2 Pith papers
-
Large Language Models for Cryptocurrency Transaction Analysis: A Bitcoin Case Study
LLMs using the new LLM4TG format and CETraS sampling can analyze Bitcoin transaction graphs, achieving high node-level accuracy and 72.43% top-3 few-shot classification accuracy, but remain behind engineered classifiers.
-
CG-RAG: Research Question Answering by Citation Graph Retrieval-Augmented LLMs
A citation-graph retrieval framework that entangles sparse and dense relevance signals in a GNN over paper chunks reports state-of-the-art Hit@1 and answer accuracy on two research QA benchmarks.
Discussion (0). Continue with ORCID to comment.