REVIEW 11 cited by
Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs
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), while exhibiting exceptional performance, suffer from hallucinations, especially on knowledge-intensive tasks. Existing works propose to augment LLMs with individual text units retrieved from external knowledge corpora to alleviate the issue. However, in many domains, texts are interconnected (e.g., academic papers in a bibliographic graph are linked by citations and co-authorships) which form a (text-attributed) graph. The knowledge in such graphs is encoded not only in single texts/nodes but also in their associated connections. To facilitate the research of augmenting LLMs with graphs, we manually construct a Graph Reasoning Benchmark dataset called GRBench, containing 1,740 questions that can be answered with the knowledge from 10 domain graphs. Then, we propose a simple and effective framework called Graph Chain-of-thought (Graph-CoT) to augment LLMs with graphs by encouraging LLMs to reason on the graph iteratively. Each Graph-CoT iteration consists of three sub-steps: LLM reasoning, LLM-graph interaction, and graph execution. We conduct systematic experiments with three LLM backbones on GRBench, where Graph-CoT outperforms the baselines consistently. The code is available at https://github.com/PeterGriffinJin/Graph-CoT.
Forward citations
Cited by 11 Pith papers
-
GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval
GraphRunner improves graph-based retrieval by generating and validating a complete traversal plan before executing high-level multi-hop actions, outperforming Graph-CoT on GRBENCH with 10 to 50 percent higher accuracy...
-
ViCrit: A Verifiable Reinforcement Learning Proxy Task for Visual Perception in VLMs
A verifiable RL proxy task that asks VLMs to locate a single injected hallucination in a 200-word caption improves visual perception and transfers to math and abstract reasoning benchmarks.
-
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
RAPL combines LLM-rationalized path labels, line graph transformation, and path-based decoding to improve graph retrieval for KGQA, reporting state-of-the-art results on WebQSP and CWQ.
-
How Significant Are the Real Performance Gains? An Unbiased Evaluation Framework for GraphRAG
A new GraphRAG evaluation framework using graph-grounded questions and bias-correction yields much smaller win rates than earlier reports, casting doubt on reported GraphRAG gains.
-
KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAG
KET-RAG uses a PageRank-selected knowledge graph skeleton plus a text-keyword bipartite graph to lower Graph-RAG indexing cost while achieving comparable or better retrieval and generation quality.
-
GCoT: Chain-of-Thought Prompt Learning for Graphs
GCoT improves few-shot graph classification by iteratively generating node-specific prompts from intermediate encoder states, mimicking chain-of-thought reasoning for text-free graphs.
-
What makes prompts a graph: necessary and sufficient conditions for prompt graph engineering
The paper defines prompt graph engineering via four necessary and sufficient conditions (explicit structure, structure/content separation, executable semantics, first-class artifact) and an inclusion/exclusion test th...
-
Don't Think Longer, Think Wisely: Optimizing Thinking Dynamics for Large Reasoning Models
DTO constructs compressed, ground-truth-curated reasoning trajectories from LRM outputs and uses them as preferred responses in SimPO, yielding up to 12% accuracy gains and roughly 40% token reduction on math benchmarks.
-
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.
-
Graph RAG-Tool Fusion
Graph RAG-Tool Fusion retrieves a tool by vector search, then walks its dependency graph, lifting ToolLinkOS mAP@10 from 0.210 to 0.927 versus naive RAG.
-
Multilevel Analysis of Cryptocurrency News using RAG Approach with Fine-Tuned Mistral Large Language Model
A fine-tuned Mistral 7B model produces graph and text summaries, sentiment scores, and stacked meta-summaries of crypto news, but the paper reports no quantitative evaluation.
Discussion (0). Continue with ORCID to comment.