The reviewed record of science sign in
Pith

arxiv: 2408.15836 · v1 · pith:FXDVQXGM · submitted 2024-08-28 · cs.IR · cs.AI· cs.CL

Knowledge Navigator: LLM-guided Browsing Framework for Exploratory Search in Scientific Literature

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FXDVQXGMrecord.jsonopen to challenge →

classification cs.IR cs.AIcs.CL
keywords knowledgenavigatorscientificsearchbenchmarksbrowsingdocumentseffective
0
0 comments X
read the original abstract

The exponential growth of scientific literature necessitates advanced tools for effective knowledge exploration. We present Knowledge Navigator, a system designed to enhance exploratory search abilities by organizing and structuring the retrieved documents from broad topical queries into a navigable, two-level hierarchy of named and descriptive scientific topics and subtopics. This structured organization provides an overall view of the research themes in a domain, while also enabling iterative search and deeper knowledge discovery within specific subtopics by allowing users to refine their focus and retrieve additional relevant documents. Knowledge Navigator combines LLM capabilities with cluster-based methods to enable an effective browsing method. We demonstrate our approach's effectiveness through automatic and manual evaluations on two novel benchmarks, CLUSTREC-COVID and SCITOC. Our code, prompts, and benchmarks are made publicly available.

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 2 Pith papers

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

  1. A Technical Taxonomy of LLM Agent Communication Protocols

    cs.MA 2026-06 unverdicted novelty 5.0

    Creates a five-dimension taxonomy (counterparty, payload, interaction state, discovery mechanism, schema flexibility) from nine protocols and identifies architectural patterns plus convergence trends.

  2. Task Decomposition for Efficient Annotation

    cs.CL 2026-06 unverdicted novelty 4.0

    Decomposing annotation tasks using centers from centering theory reduces aggregate inferential load via a degrees-of-freedom model and enables better sub-task allocation.