Polymath MCP server
Commit Nov 4, 2026Aggregates 17 free research sources for computer science, engineering, and IT into a single normalized interface for academic papers, code, and hardware.
Also known as Moreti2002/polymath-mcp
- Stars
- 0
- Tools
- 8
- Downloads, 30 days
- —
- Latest version
- —
- Last commit
- Nov 4, 2026
- License
- MIT
What is Polymath MCP?
Polymath aggregates 17 free research sources for computer science, engineering, and IT into a single normalized interface for academic papers, code, and hardware. It exposes 8 tools, such as search_papers, get_paper, search_code.
Summary generated from the project's README
About Polymath MCP server
Accessing academic papers, hardware documentation, and code implementations through a single interface is what polymath-mcp enables for researchers and engineers. This server aggregates seventeen different sources into a normalized format, allowing an AI client to retrieve data from arXiv, GitHub, Hugging Face, and Stack Exchange without needing individual API keys. It works locally via Python 3.11+ and can be integrated into Claude Desktop or Claude Code.
Users can search for academic papers using search_papers, resolve specific documents via get_paper, or find technical discussions through search_trends. The server also provides specialized tools like search_code for finding repositories, search_hub for models and datasets, and search_components for electronic datasheets and KiCad symbols. To improve results from Unpaywall and maintain polite request rates with Crossref, users can optionally provide a contact email via the POLYMATH_EMAIL environment variable.
Because it functions as an aggregator, the server handles partial failures gracefully. If one source like Semantic Scholar is rate-limited, the tool still returns results from other available providers. It manages these various limits through built-in throttling and in-memory caching to ensure stable performance across different data streams.
What you can do with it
- 1Consolidate academic researchFind and merge information about a specific paper from multiple academic databases into one record.
- 2Locate code implementationsSearch for GitHub repositories that implement a specific research paper.
- 3Research electronic componentsRetrieve scanned datasheets and KiCad symbols for hardware design.
- 4Monitor technical discussionsIdentify practitioner interest and relevance signals on platforms like Hacker News or Stack Overflow.
Written from the project's README. Every use case is checked against a quote from it.
Polymath MCP tools 8
Detected from the READMEsearch_papersget_papersearch_codesearch_hubsearch_trendssearch_standardssearch_componentslist_sources
Configuration
POLYMATH_EMAIL
Automated checks
Ran Nov 14, 2026Full report →Not verified yet. A server needs a score of 80, no serious finding, and enough data for us to check. How checks work · What to fix for more points
- Source repository linked and reachablemoreti2002/polymath-mcp is public and reachablegithub.com/moreti2002/polymath-mcp ↗Pass
- Package names this repository as its sourceNot checked
- Build provenance (Sigstore attestation)Not checked
- Open source license (OSI)MITspdx.org/licenses/MIT.html ↗Pass
- Commit or release in the last yearLast commit or release 2026-11-04github.com/moreti2002/polymath-mcp ↗Pass
- OpenSSF ScorecardNot checked
- Package name not close to a popular packageNot checked
- No critical advisory in the package or its dependenciesNot checked
- No hidden instructions to the model8 tool descriptions and the README read; no override phrases, credential paths or hidden charactersPass
- Destructive tools are labelledNo tool named like delete, drop or execPass
- Remote endpoint answers the MCP handshakeNot checked
README
View on GitHubPolymath MCP
An MCP (Model Context Protocol) server that aggregates free, keyless research sources for computer science, computer engineering, electronics and IT.
One server, one normalized output format, seventeen data sources. Every source works without an API key and without payment. Results from different sources are merged and deduplicated by DOI and arXiv id, so the same paper found on arXiv, Crossref and OpenAlex comes back as a single record that combines the best fields of each.
Why
Research data is scattered across many APIs, each with its own format, quirks and rate limits. Existing MCP servers each cover one slice. Polymath gives an agent a single interface where a paper, its open-access PDF, its citation count, its implementation on GitHub, the model trained from it on Hugging Face and the practical discussion around it on Hacker News or Stack Exchange are all one tool call apart.
Tools
| Tool | What it does | Sources |
|---|---|---|
search_papers |
Search academic papers, deduplicated across sources | arXiv, Crossref, DBLP, Europe PMC, OpenAlex, CORE, Zenodo, Semantic Scholar, Hugging Face Papers |
get_paper |
Resolve one paper by DOI or arXiv id, merging every source that knows it, including open-access PDF link and citation counts | the above, plus Unpaywall and OpenCitations |
search_code |
Find repositories, e.g. the implementation of a paper | GitHub |
search_hub |
Search models or datasets, with links back to their papers | Hugging Face Hub |
search_trends |
Practitioner discussions and relevance signals | Hacker News, Stack Overflow, Electronics Stack Exchange |
search_standards |
RFCs and Internet-Drafts | IETF Datatracker |
search_components |
Electronic component documents: scanned datasheets and KiCad symbols | Internet Archive, KiCad libraries |
list_sources |
List every source and its category | - |
Every search response is an envelope with results, sources_ok and
sources_failed. Partial failure is the normal case for an aggregator: when a
source is down or rate-limited, the others still answer and the envelope says
exactly which sources contributed.
Installation
Requires Python 3.11+.
pip install git+https://github.com/Moreti2002/polymath-mcp
Or from a clone:
git clone https://github.com/Moreti2002/polymath-mcp
cd polymath-mcp
pip install .
Claude Code
claude mcp add polymath -- polymath-mcp
Claude Desktop / other MCP clients
{
"mcpServers": {
"polymath": {
"command": "polymath-mcp"
}
}
}
Configuration
No API keys are needed. One optional environment variable:
POLYMATH_EMAIL: a real contact e-mail. Unlocks the Unpaywall source (which requires it) and puts Crossref requests in its polite pool with better rate limits. Without it everything else still works.
{
"mcpServers": {
"polymath": {
"command": "polymath-mcp",
"env": { "POLYMATH_EMAIL": "you@example.com" }
}
}
}
Sources and their limits
All limits below are for keyless access, as observed in practice.
| Source | Role | Keyless limit |
|---|---|---|
| arXiv | CS/EE preprints, primary | 1 request / 3 s (self-imposed politeness) |
| Crossref | DOI metadata, primary | 3 req/s in the polite pool |
| DBLP | Canonical CS bibliography (venues) | ~1 req/s, aggressive blocking on bursts |
| Europe PMC | Full-text biomedical + applied ML | ~10 req/s |
| OpenAlex | Enrichment by DOI (free); text search is credit-rationed (~100 searches/day) | 1000 credits/day/IP |
| CORE | Institutional repository full-text | ~10 req/min |
| Zenodo | Software and datasets with DOIs | 30 req/min |
| Semantic Scholar | Citation graph, best effort only | shared anonymous pool, frequent 429 |
| Unpaywall | Open-access PDF resolution by DOI | 100k/day, requires POLYMATH_EMAIL |
| OpenCitations | Citation counts and references | unthrottled, high latency |
| GitHub | Repository search | 10 req/min |
| Hugging Face | Models, datasets, papers | generous, undocumented |
| Hacker News (Algolia) | Discussion search | ~10k req/h |
| Stack Exchange | Stack Overflow + Electronics SE | 300 req/day/IP |
| IETF Datatracker | RFCs and drafts | unthrottled |
| Internet Archive | Scanned datasheets and databooks | unthrottled |
| KiCad libraries (GitLab) | Component symbol existence | unthrottled |
The server caches responses in memory and throttles each source to stay within these limits. Sources with hard daily budgets (Stack Exchange, OpenAlex search) are cached the longest.
Known coverage gaps
- There is no legitimate keyless API for commercial electronic component
catalogs (Octopart/Nexar, Digi-Key and Mouser all require credentials).
search_componentscovers what keyless sources can: scanned datasheets on the Internet Archive and KiCad symbol libraries. For part selection discussion,search_trendsincludes the Electronics Stack Exchange. - Papers with Code shut down in 2025; its role is covered by the Hugging Face Papers source.
- Semantic Scholar without a key shares a global anonymous pool and fails often. It is wired as best-effort and never blocks a search.
Architecture
src/polymath/
server.py MCP server and tool definitions
models.py normalized result models (Paper, CodeRepo, HubItem, ...)
aggregate.py concurrent fan-out with per-source failure isolation
dedupe.py cross-source paper merging (DOI, arXiv id, title)
http.py shared HTTP client, retries, per-source throttling
cache.py in-memory TTL cache
providers/ one module per source, registered in a plug-in registry
Adding a source is one file: subclass Provider (or PaperLookupProvider),
map the API response to the normalized models, decorate the class with
@register. The aggregator, dedupe and MCP tools pick it up automatically.
Development
python -m venv .venv && source .venv/bin/activate
pip install -e ".[dev]"
pytest -m "not live" # offline tests (mocked HTTP)
pytest -m live # integration tests against the real APIs
Offline tests must always pass. Live tests depend on third-party services and may fail when a source is down or rate-limited; CI runs them as non-blocking.
License
MIT. See LICENSE.
Polymath MCP questions
What tools does Polymath MCP provide?
It exposes 8 tools, including search_papers, get_paper, search_code, search_hub, search_trends.
Do I need an API key to use Polymath?
No, the server aggregates free, keyless research sources that work without an API key or payment.
How does the server handle duplicate results from different sources?
Results from different sources are merged and deduplicated using DOI and arXiv ID to provide a single combined record.
What happens if one of the data sources is down?
The server uses a partial failure model where it returns results from available sources and identifies which ones failed.