<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>PageIndex</title>
    <link>https://pageindex.ai</link>
    <description>PageIndex is a vectorless, reasoning-based RAG engine that mirrors how humans read documents. Deliver traceable, explainable, and context-aware retrieval without vector databases or chunking.</description>
    <language>en-us</language>
    <lastBuildDate>Sun, 05 Apr 2026 18:52:55 GMT</lastBuildDate>
    <atom:link href="https://pageindex.ai/feed.xml" rel="self" type="application/rss+xml"/>
    <image>
      <url>https://pageindex.ai/static/images/logo.png</url>
      <title>PageIndex</title>
      <link>https://pageindex.ai</link>
    </image>
    
    <item>
      <title><![CDATA[RAG for Technical Manuals]]></title>
      <link>https://pageindex.ai/blog/technical-manuals</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/technical-manuals</guid>
      <pubDate>Fri, 12 Dec 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[How PageIndex’s vectorless, reasoning-based RAG overcomes the challenges of traditional vector RAG in long, complex technical manuals.]]></description>
      <category>Insights</category>
    </item>
    <item>
      <title><![CDATA[PageIndex vs ChatGPT 5.1]]></title>
      <link>https://pageindex.ai/blog/pageindex-vs-chatgpt</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/pageindex-vs-chatgpt</guid>
      <pubDate>Sun, 30 Nov 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[We benchmarked PageIndex Chat against ChatGPT 5.1 on real-world long documents. PageIndex achieved 100% accuracy compared to ChatGPT 5.1's 59-82%, with faster response times and page-level traceability.]]></description>
      <category>Insights</category>
    </item>
    <item>
      <title><![CDATA[Do We Still Need OCR?]]></title>
      <link>https://pageindex.ai/blog/do-we-need-ocr</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/do-we-need-ocr</guid>
      <pubDate>Mon, 27 Oct 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[We examine the inherent limitations of OCR from an information-theoretic perspective and show why a direct, vision-based approach with PageIndex is more effective.]]></description>
      <category>Insights</category>
    </item>
    <item>
      <title><![CDATA[Introducing PageIndex Chat]]></title>
      <link>https://pageindex.ai/blog/pageindex-chat</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/pageindex-chat</guid>
      <pubDate>Mon, 20 Oct 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[Experience the power of reasoning-based RAG with PageIndex Chat - our new conversational interface for intelligent document understanding.]]></description>
      <category>Product</category>
    </item>
    <item>
      <title><![CDATA[PageIndex: Next-Generation
 Vectorless, Reasoning-based RAG]]></title>
      <link>https://pageindex.ai/blog/pageindex-intro</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/pageindex-intro</guid>
      <pubDate>Fri, 19 Sep 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[PageIndex is a vectorless, reasoning-based retrieval framework that simulates how human experts extract knowledge from complex documents. Instead of relying on vector similarity search, it builds a tree-structured index from documents and enables LLMs to perform agentic reasoning over that structure for context-aware retrieval. The retrieval process is traceable and interpretable, and requires no vector DBs or chunking.]]></description>
      <category>Research</category>
    </item>
    <item>
      <title><![CDATA[From Claude Code to Agentic RAG]]></title>
      <link>https://pageindex.ai/blog/claude-code-agentic-rag</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/claude-code-agentic-rag</guid>
      <pubDate>Mon, 01 Sep 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[We explore the rise of agentic retrieval over vector indexing and how PageIndex can be used to build agentic RAG systems.]]></description>
      <category>Insights</category>
    </item>
    <item>
      <title><![CDATA[PageIndex OCR:
The First Long-Context OCR Model]]></title>
      <link>https://pageindex.ai/blog/ocr</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/ocr</guid>
      <pubDate>Tue, 05 Aug 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[PageIndex OCR is the world's first OCR model that understands documents as a whole — preserving full structure and section hierarchy across pages, instead of treating each page as an independent unit.]]></description>
      <category>Product</category>
    </item>
    <item>
      <title><![CDATA[PageIndex Leads Financial QA Benchmark]]></title>
      <link>https://pageindex.ai/blog/Mafin2.5</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/Mafin2.5</guid>
      <pubDate>Wed, 19 Feb 2025 00:00:00 GMT</pubDate>
      <description><![CDATA[We introduce Mafin2.5, which is built based on PageIndex, with a 98.7% accuracy rate on the finance industry question-answering benchmark.]]></description>
      <category>Insights</category>
    </item>
    <item>
      <title><![CDATA[Enhancing Black-Box Embeddings with Model Augmented Fine-Tuning]]></title>
      <link>https://pageindex.ai/blog/Mafin</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/Mafin</guid>
      <pubDate>Tue, 12 Mar 2024 00:00:00 GMT</pubDate>
      <description><![CDATA[We introduce Model Augmented Fine-tuning (Mafin) — a novel approach for fine-tuning a black-box embedding model by augmenting it with a trainable embedding model.]]></description>
      <category>Research</category>
    </item>
    <item>
      <title><![CDATA[Active Preference Learning for Large Language Models]]></title>
      <link>https://pageindex.ai/blog/ActivePreferenceLearning</link>
      <guid isPermaLink="true">https://pageindex.ai/blog/ActivePreferenceLearning</guid>
      <pubDate>Thu, 08 Feb 2024 00:00:00 GMT</pubDate>
      <description><![CDATA[We propose a practical acquisition function for prompt/completion pairs based on the predictive entropy of the language model and a measure of certainty of the implicit preference model optimized by DPO.]]></description>
      <category>Research</category>
    </item>
  </channel>
</rss>