<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Less is More for RAG: Information Gain Pruning for Generator-Aligned Reranking and Evidence Selection · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2601.17532/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2601.17532/feed.xml" rel="self" type="application/rss+xml" /><item><title>Less is More for RAG: Information Gain Pruning for Generator-Aligned Reranking and Evidence Selection — mentioned by kalpitdixit</title><link>https://news.ycombinator.com/item?id=47125585</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.17532:47125585</guid><pubDate>Mon, 23 Feb 2026 17:33:27 GMT</pubDate><description>&lt;p&gt;The best engineering knowledge is locked in research papers. Paper Lantern unlocks it for your code. Paper Lantern is an MCP server that distills 2M+ CS research papers into the right method for your problem — its tradeoffs, benchmarks, and how to implement it — delivered directly to your coding agent. Works with Claude Code, Cursor, Copilot, any MCP client. Your coding agent can search for papers, but it&amp;#x27;s searching the open web — not a purpose-built research index. And even when it finds papers, the hard questions remain: which methods actually matter for your problem? What are the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.17532/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
