Pith. sign in

REVIEW 2 cited by

GraphReader: Building Graph-based Agent to Enhance Long-Context Abilities of Large Language Models

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

arxiv 2406.14550 v2 pith:OBORFK45 submitted 2024-06-20 cs.CL cs.AI

classification cs.CLcs.AI
keywords agentgraphgraphreaderlargelongcontextexplorationgraph-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Long-context capabilities are essential for large language models (LLMs) to tackle complex and long-input tasks. Despite numerous efforts made to optimize LLMs for long contexts, challenges persist in robustly processing long inputs. In this paper, we introduce GraphReader, a graph-based agent system designed to handle long texts by structuring them into a graph and employing an agent to explore this graph autonomously. Upon receiving a question, the agent first undertakes a step-by-step analysis and devises a rational plan. It then invokes a set of predefined functions to read node content and neighbors, facilitating a coarse-to-fine exploration of the graph. Throughout the exploration, the agent continuously records new insights and reflects on current circumstances to optimize the process until it has gathered sufficient information to generate an answer. Experimental results on the LV-Eval dataset reveal that GraphReader, using a 4k context window, consistently outperforms GPT-4-128k across context lengths from 16k to 256k by a large margin. Additionally, our approach demonstrates superior performance on four challenging single-hop and multi-hop benchmarks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MM-BrowseComp: A Comprehensive Benchmark for Multimodal Browsing Agents

    cs.CL 2025-08 unverdicted novelty 6.0 of 10

    MM-BrowseComp is a multimodal browsing benchmark on which the best evaluated model, OpenAI o3 with tools, achieves 29.02% accuracy.

  2. Can Past Experience Accelerate LLM Reasoning?

    cs.LG 2025-05 conditional novelty 5.0 of 10

    LLMs can cut reasoning compute by up to 56% on similar questions when memory of past correct solutions is combined with adaptive early stopping, though the benchmark is small and synthetic.

Pith tools