This work introduces Sieve, a search-inspect-fetch strategy driven by a Boolean Query Language (BQL): it searches webpage fields to filter candidates, uses an interchangeable ranker to order them, presents structure-rich result cards for inspection, and fetches only selected sections.
Abstract
Existing deep-search agents use a Search-Visit workflow that retrieves whole webpages without considering the structure they expose through titles, headings, sections, and metadata. This prevents agents from directly constraining retrieval to parts of a webpage and often carries irrelevant content into their context. We introduce Sieve, a search-inspect-fetch strategy driven by a Boolean Query Language (BQL): it searches webpage fields to filter candidates, uses an interchangeable ranker to order them, presents structure-rich result cards for inspection, and fetches only selected sections. Across three QA collections, Sieve is more accurate than the strongest conventional Search-Visit configuration on each collection while using 20.7-50.6% fewer tokens. Boolean filtering improves every tested ranker, and the accuracy-context advantage persists across retriever choices and agent backbones. Our implementation is included in the SkimSearchAgent library https://github.com/ielab/skim-search-agent.
This work introduces S IEVE, a search–inspect–fetch strategy built around a Boolean Query Language (BQL), which improves accuracy with every tested ranker, and the accuracy–context advantage persists across retriever choices and agent backbones.
Shuai Wang, Hao-Dong Chen, Yu Yin et al.· 0 citations
SearchWiki paired with WikiResearcher-9B demonstrates that learned navigation over structured corpora is a superior alternative to flat retrieval, and optimizing the agent's navigation policy with on-policy reinforcement learning with a multi-component reward function balancing answer correctness, retrieval quality and...
Guransh Singh, Vishwajeet Kumar, Arkadeep Acharya et al.· 0 citations
A policy-aligned retrieval framework that improves offline relevance over a matched-capacity baseline, with gains broadly distributed across facet combinations, and serves this framework with a two-stage GPU architecture.
Dhritiman Das, Chujie Zheng, Ronak Kaoshik et al.· 0 citations
This work introduces SearchAtlas, a framework that converts search trajectories into structured graphs whose edges represent how evidence is propagated across the reasoning trace, from the query that retrieves it to the final answer.
Jia-Cheng Sang, Meng-Yuan Li, Sanxing Chen et al.· 0 citations
Atlas is the first to demonstrate verifiable graph-based search at scale, proving a query in under a second on the SIFT1M benchmark and in 2.0 seconds at 100 million vectors, while maintaining the recall of plaintext HNSW and revealing nothing about the index beyond the result.
Nikolay Avramov, Hidde Lycklama, Alexander Viand et al.· 0 citations
This paper proposes HYSET, short for HYperedge-based SEt-level Tool retrieval, which forms tool retrieval as query-conditioned hyperedge prediction on a tool co-invocation hypergraph, under which the tool set itself becomes the unit of scoring and most existing retrieval paradigms reduce to restricted instances.
Xin Hong, P. Dong, Xinyang Yu et al.· arXiv.org· 0 citations