pith. sign in

arxiv: 2506.18959 · v3 · pith:O6LNXFLXnew · submitted 2025-06-23 · 💻 cs.IR · cs.CL· cs.LG

From Web Search towards Agentic Deep Research: Incentivizing Search with Reasoning Agents

classification 💻 cs.IR cs.CLcs.LG
keywords searchinformationagenticreasoningresearchdeepbenchmarkimplementations
0
0 comments X
read the original abstract

Information retrieval is a cornerstone of modern knowledge acquisition, enabling billions of queries each day across diverse domains. However, traditional keyword-based search engines are increasingly inadequate for handling complex, multi-step information needs. Our position is that Large Language Models (LLMs), endowed with reasoning and agentic capabilities, are ushering in a new paradigm termed Agentic Deep Research. These systems transcend conventional information search techniques by tightly integrating autonomous reasoning, iterative retrieval, and information synthesis into a dynamic feedback loop. We trace the evolution from static web search to interactive, agent-based systems that plan, explore, and learn. We also introduce a test-time scaling law to formalize the impact of computational depth on reasoning and search. Supported by benchmark results and the rise of open-source implementations, we demonstrate that Agentic Deep Research not only significantly outperforms existing approaches, but is also poised to become the dominant paradigm for future information seeking. All the related resources, including industry products, research papers, benchmark datasets, and open-source implementations, are collected for the community in https://github.com/DavidZWZ/Awesome-Deep-Research.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

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

  1. Multi-Head Recurrent Memory Agents

    cs.LG 2026-07 unverdicted novelty 7.0

    The paper proposes Multi-Head Recurrent Memory (MHM) with a select-then-update strategy to improve memory retention in long-context recurrent agents.

  2. Empowering GUI Agents via Autonomous Experience Exploration and Hindsight Experience Utilization for Task Planning

    cs.CL 2026-06 unverdicted novelty 6.0

    PEEU enables a 7B MLLM to reach 30.6% accuracy on GUI task planning by autonomous exploration and hindsight experience synthesis, outperforming a 32B model through stronger high-level OOD generalization.

  3. CogGen: A Cognitively Inspired Recursive Framework for Deep Research Report Generation

    cs.MA 2026-04 unverdicted novelty 6.0

    CogGen uses a cognitively inspired recursive architecture with AVR for multimodal content to generate deep research reports that achieve SOTA among open-source systems and surpass Gemini Deep Research on a new OWID benchmark.

  4. GAM: Hierarchical Graph-based Agentic Memory for LLM Agents

    cs.AI 2026-04 unverdicted novelty 6.0

    GAM decouples event-level memory encoding from topic-level consolidation in LLM agents using hierarchical graphs to reduce interference and improve long-term coherence and retrieval.

  5. RubricsTree: Scalable and Evolving Open-Ended Evaluation of Personal Health Agents across Health Memory and Medical Skills

    cs.CL 2026-06 unverdicted novelty 5.0

    RubricsTree is a scalable, evolving rubric-based evaluation system with adaptive routing that improves physician alignment for health AI responses and enables performance gains when used as feedback or rewards.

  6. Automated Root-Cause Subclassification and No-Code Fix Generation for Invalid Bug Reports

    cs.SE 2026-05 unverdicted novelty 5.0

    RAG reaches 0.66 weighted F1 on invalid bug report subclassification while agentic web search reaches 68.9% judge success on no-code fix generation, using a new gold-standard benchmark.

  7. Automated Root-Cause Subclassification and No-Code Fix Generation for Invalid Bug Reports

    cs.SE 2026-05 unverdicted novelty 3.0

    Retrieval-augmented generation reaches 0.66 weighted F1 for invalid bug report subclassification while agentic web search reaches 68.9% Judge LLM success for no-code fix generation.