Structured citation graphs outperform open-ended research agents by 3x
Source published ·Modelwire updated
Original coverage: arXiv cs.CL ↗·How Modelwire adds context
The development
Researchers have demonstrated that structured, citation-graph-based search substantially outperforms open-ended agentic research loops for scholarly discovery. Crase constrains exploration to explicit, auditable steps: seeding from a single query, expanding through citation neighborhoods, pruning unsupported claims, and ranking via recency-aware walks. The approach achieves 3x better recall than proprietary deep-research agents while cutting inference costs by two-thirds on large academic corpora. This signals a broader shift toward bounded, interpretable alternatives to unbounded agent loops, with implications for how enterprises build trustworthy knowledge retrieval systems.
Modelwire’s AI-generated summary of coverage from arXiv cs.CL.
Modelwire analysis
Analyst takeOur AI-generated reading of the wider context and the next developments to watch.
The paper doesn't just show that structured search works better; it demonstrates that the entire category of open-ended agentic research may be overfit to benchmarks rather than production constraints. The cost reduction (two-thirds) matters more than recall for enterprise adoption.
This directly contradicts the momentum in concurrent work on agent scaling. BrowserForge (same date) invests heavily in training data diversity to make unbounded web agents more capable, while Recuris (also August) solves memory management for long-horizon agent coherence. Both assume agents are the right primitive. Crase instead argues the constraint is the feature: by design, not accident. The financial research paper from this week reinforces the tension: retrieval works, but integration fails at scale. Crase sidesteps integration entirely by pruning unsupported claims upfront, suggesting bounded exploration may be the pragmatic answer to problems the agent community is trying to engineer away.
If enterprise search vendors (Perplexity, Tavily, or internal tools at major cloud providers) ship citation-graph-bounded modes in the next six months and adoption outpaces open-agent deployments in financial or legal workflows, the market has chosen interpretability over capability. If Crase's recall advantage shrinks when tested on proprietary corpora (vs. arXiv), the win is domain-specific and the agent debate remains open.
This interpretation is generated from the summary above and the archive coverage cited below. Our methodology · Report an error
Coverage behind this analysis
These archive entries ground the connection in our analysis. They are ordered by source publication date, with links to our coverage and the original sources.
·arXiv cs.CL
Recuris decouples memory to improve long-horizon agent reasoning
Researchers introduce Recuris, an architecture that tackles a fundamental bottleneck in long-horizon AI agents: how to maintain task focus when execution histories grow unwieldy. The system separates working memory (tracking immediate progress) from experiential memory (storing learned skills), allowing agents to invoke capabilities based on current needs rather than full history. A meta-agent then converts…
MentionsCrase · arXiv · LitSearch
How this coverage is produced
Modelwire uses AI to generate summaries and context from source headlines, snippets, and selected archive coverage. Automated checks do not verify every claim, and items are not routinely reviewed by a person before publication. Zacaria Solis operates the site. Read the linked source for the full evidence and report errors through our corrections process.
Modelwire summarizes, we don’t republish. arXiv cs.CL originally reported this story as “Structurally-bounded Agentic Graph Exploration for Evidence-Grounded Scholarly DeepSearch”. The full content lives on arxiv.org. If you’re a publisher and want a different summarization policy for your work, see our takedown page.