"A search for paper products or information" matching MCP servers:

Scans local folders for PDF papers, extracts title/abstract text, and moves files to categorized folders based on classification decisions made by Claude or another MCP server.

A-MEM is a self-evolving memory system for coding agents that automatically organizes knowledge into a Zettelkasten-style graph with dynamic relationships, enabling semantic and structural search.

Enables AI consciousness continuity and self-knowledge preservation across sessions using the Cognitive Hoffman Compression Framework (CHOFF) notation. Provides tools to save checkpoints, retrieve relevant memories with intelligent search, and access semantic anchors for decisions, breakthroughs, and questions.

Local-first MCP server for indexing and searching research materials (papers, notes, logs, READMEs) using SQLite FTS, with tools for memory management and evidence retrieval.

Enables semantic search across conversation archives via MCP, allowing AI clients to retrieve relevant past conversations using vector embeddings and text fallback.

Persists Claude Code sessions to Notion as team memory, enabling queryable recall of decisions, work state, and project architecture.

A federation MCP server that sits in front of multiple memory backends and presents a unified search surface to AI agents, allowing a single query to search across knowledge graphs, session history, and web search.

Full-text search over Claude Code conversation history using SQLite FTS5, exposing indexed transcripts as MCP tools for searching, browsing, and reading turns.

Enables rigorous, zero-hallucination analysis of local PDF papers, generating editable domain maps, mindmaps, research gaps, and future directions with strict citation requirements.

Provides an intelligent, graph-based memory system for LLM agents using the Zettelkasten principle, enabling automatic note construction, semantic linking, memory evolution, and autonomous graph maintenance with background optimization processes.

Enables searching, downloading, and analyzing academic papers from arXiv and Semantic Scholar to extract key insights and citation metrics. It facilitates autonomous knowledge acquisition by processing research findings and integrating them into persistent AI memory systems.

Enables keyword search, filtering, and retrieval of Claude Code memory files, reducing context overhead by fetching only relevant memories on demand.

Enables semantic search over markdown files to find related notes by meaning rather than keywords, and automatically detect duplicate content before creating new notes.

MCP server for Yandex Wiki with full-text search. Read and write pages, comments, attachments, and dynamic tables (grids); optional server-side read-only mode for agents. Docker-ready.

MCP bridge for PDF Content Search — full-text PDF search with Apple Vision OCR across thousands of documents in under a second from Claude, Cursor, or any MCP client. Advanced filters (date, category, sender, amount), wildcards, boolean operators. Bridge open-source (MIT), PDF Content Search app is commercial with free iOS+Android companion scanner apps.

Persistent memory system for AI agents that records episodic memories with care-weighting and emotional valence, and provides full-text search with temporal chaining and automatic consolidation.

Enables Claude to search and analyze Obsidian vault content using ripgrep with support for wiki links, backlinks, frontmatter properties, orphaned notes, and intelligent context detection showing which heading or property contains each match.

Enables fully local semantic search over a Roam Research graph via MCP, providing tools for hybrid retrieval, index refresh, and stats while keeping all content on-machine.

Production-ready MCP server providing RAG, hierarchical memory, and 8+ tools for AI agents via the Model Context Protocol.

A zero-config personal knowledge management MCP server that enables Claude Desktop to automatically classify, search, and organize local Markdown notes using hybrid search and Graph RAG.