Pith. sign in

REVIEW 1 cited by

WINELL: Wikipedia Never-Ending Updating with LLM Agents

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 2508.03728 v1 pith:UAOSPWKC submitted 2025-07-30 cs.CL

classification cs.CL
keywords wikipediahumanknowledgeagentseditingupdatingwinellcontinuously
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Wikipedia, a vast and continuously consulted knowledge base, faces significant challenges in maintaining up-to-date content due to its reliance on manual human editors. Inspired by the vision of continuous knowledge acquisition in NELL and fueled by advances in LLM-based agents, this paper introduces WiNELL, an agentic framework for continuously updating Wikipedia articles. Our approach employs a multi-agent framework to aggregate online information, select new and important knowledge for a target entity in Wikipedia, and then generate precise edit suggestions for human review. Our fine-grained editing models, trained on Wikipedia's extensive history of human edits, enable incorporating updates in a manner consistent with human editing behavior. Our editor models outperform both open-source instruction-following baselines and closed-source LLMs (e.g., GPT-4o) in key information coverage and editing efficiency. End-to-end evaluation on high-activity Wikipedia pages demonstrates WiNELL's ability to identify and suggest timely factual updates. This opens up a promising research direction in LLM agents for automatically updating knowledge bases in a never-ending fashion.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. RADAR: Defending RAG Dynamically against Retrieval Corruption

    cs.CR 2026-05 unverdicted novelty 6.0 of 10

    RADAR defends RAG systems in dynamic settings by framing reliable context selection as a Max-Flow Min-Cut graph problem with Bayesian memory updates, claiming superior robustness, response quality, and low storage on ...

Pith tools