原型 · 预览版:收录官方注册中心里的全部服务器,每 30 分钟同步一次。评价和账户功能将在后续阶段推出。
PopNx MCP为使用 AI 的人准备的 MCP 服务器 · 用大白话讲清楚

Keystone

作者:Srikarmk版本 0.1.0i★ –i在云端运行
注册名称io.github.Srikarmk/keystone

安装

概览

作者提供的说明(英文原文)

What an arXiv paper builds on, disputes and assumes, read verbatim from its LaTeX. No LLM.

PopNx MCP 的三大支柱

这三项永远不会合并成一个分数:意见、测量和人气是不同的东西。

它能帮你做什么

我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。

  • 连接方式: 在云端运行
  • 传输方式: Streamable HTTP
  • 分类: 搜索与 AI 记忆

安装

选择你使用的 AI 应用,然后复制设置。

安装之前

你需要

你用的是哪个应用?

在上方选择你的应用。我们会记住它,下次按钮会显示“安装到 …”。

适用于网页版、桌面版和手机版 Claude:

  1. 打开 Settings → Connectors
  2. 点击 Add custom connector
  3. 粘贴下面的地址,然后点击 Add
  4. 如果要求登录,请登录作者的服务
SettingsConnectors1+ Add2https://…3
https://keystone-research.vercel.app/api/mcp

在终端中运行这条命令

claude mcp add --transport http keystone https://keystone-research.vercel.app/api/mcp

在 Cursor 中打开

或者自己复制设置

粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json

{
  "mcpServers": {
    "keystone": {
      "url": "https://keystone-research.vercel.app/api/mcp"
    }
  }
}

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

在 VS Code 中打开

或者自己复制设置

粘贴到项目中的 .vscode/mcp.json

{
  "servers": {
    "keystone": {
      "type": "http",
      "url": "https://keystone-research.vercel.app/api/mcp"
    }
  }
}

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

ChatGPT 只能连接互联网上的服务器:

  1. 打开网页版 ChatGPT → Settings → Connectors (Apps)
  2. 点击 Create 或 Add(部分套餐需要先在 Advanced 中开启 Developer mode)
  3. 粘贴下面的地址,起个名字,然后保存
  4. 如果要求登录,请登录作者的服务
SettingsConnectors1+ Create2https://…3
https://keystone-research.vercel.app/api/mcp

菜单名称可能因套餐和版本不同而略有差异。

你的选择通过 Cookie 保存在这台设备上,无需账户。

这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同,请以 README 为准。

它能做什么

我们还没有读取这个服务器的工具列表;我们会轮流检查各个端点。

基础检查i

我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月7日

  • ✓ 通过

    作者与仓库一致

    注册名称已通过 GitHub 账户 Srikarmk 验证,该账户拥有此仓库

  • … 尚未检查

    仍在维护

    我们还没有从 GitHub 读取这个仓库

  • … 尚未检查

    有许可证

    我们还没有从 GitHub 读取这个仓库

  • … 尚未检查

    端点有响应

    尚未检查;我们会轮流检查各个端点

  • … 尚未检查

    使用 OAuth 登录

    尚未检查;我们会轮流检查各个端点

  • … 尚未检查

    工具描述中没有隐藏指令

    尚未检查;我们会在检查端点时读取工具列表

与“搜索与 AI 记忆”中的其他服务器比较i

  • 星标数多于此分类中其他 7274 个服务器的 0%
  • 发布到注册中心的时间比此分类中其他 7274 个服务器的 69% 更新
  • 基础检查结果等于或优于此分类中其他 7274 个服务器的 100%

与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。

常见问题

Keystone 安全吗?

它在 1 项适用的基础检查中通过了 1 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。

它需要哪些密钥或代码?

注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。

它在我的电脑上运行还是在云端?

它在作者的云端运行。通过互联网连接,无需安装,但你发送的内容会经过作者的服务器。

它还在维护吗?

GitHub 仓库最后更新于–,最新版本(0.1.0)于17天前进入注册中心。

哪些应用可以使用它?

支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。它通过 URL 连接,所以接受远程 MCP 服务器的应用也可以使用,例如开启开发者模式的 ChatGPT。

有什么可以替代它?

同一分类中有:Context7, Codebase Memory, Exa

替代选择

同一分类中其他作者的服务器,按星标数排序。

如何看卡片:★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i

Context7

作者:upstash

Up-to-date docs for AI agents

电脑或云端★ 64,224MIT昨天更新
安装

Codebase Memory

作者:DeusData

Codebase knowledge graph for AI agents — 162 languages, sub-ms queries, 99% fewer tokens.

在你的电脑上运行★ 48,148MIT21天前更新
安装

Exa

作者:exa-labs

Connect AI agents to Exa for web search, content fetching, and multi-step research.

在云端运行★ 5,213MIT上个月更新
安装

作者的 README

打开 README

按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。

Keystone

What is this paper standing on?

Live: https://keystone-research.vercel.app

No paper stands by itself. Each one adopts a method from somebody, argues with somebody else, and takes a handful of things on faith without flagging them. Keystone reads all three out of the paper's own LaTeX — not a summary, not a retrieval index, no model in the loop — and pins each one to the pixels on the page where the paper says it.

The name is the thesis, and it took a pivot to earn it. A keystone is the one stone an arch collapses without, and for almost every paper that stone belongs to somebody else.

Three things, all quoted rather than inferred:

  • What it stands on. A citation is not a neutral pointer. "Following \cite{ba2016layer} we normalise each layer" and "Unlike \cite{ba2016layer}, we normalise across the batch" are opposite statements about the same paper, and the difference is written down. Every citation site is classified from its cue phrase, and the cue is shown, so the reading is something you can disagree with.
  • What it takes on faith. Authors announce their assumptions because the genre requires it — "we hypothesize", "for simplicity", "it is well known that". Each is quoted next to what the paper offers in the same sentence: a citation, a pointer to its own evidence, or nothing at all.
  • The graph. Where a cited paper is also in the library the edge is walkable in both directions, so a paper shows both what it stands on and who stands on it. Across 234 papers that is 548 links, each carrying the sentence that placed it, and the chain is the real one: VGG → ResNet → Transformer → BERT / ViT / LLaMA, with batch and layer normalisation feeding in.

The library grows along its own citations. keystone expand reads every reference the library already resolves to arXiv, ranks them by how many papers take a stance on each, and fetches the top of that list — so each new paper arrives with at least one edge already attached rather than as an isolated node.

ResNet's central hypothesis — that residual mappings are easier to optimise than

unreferenced ones — is stated once, in the introduction, with nothing offered for it.

Page 2.

And it is often silent, and sometimes wrong. A cue read out of position produces a confident opposite rather than a vague answer, so the error rate is published rather than implied — and measured on somebody else's labels, because a rate measured on the same papers the rules were written against is not a rate, it is a restatement.

Scored against SciCite (11,014 citation contexts, Cohan et al. 2019) and ACL-ARC (1,941, Jurgens et al. 2018), neither of which contributed a single cue phrase:

citationsreadof those, right
SciCite11,0144.0%80.0% [76–84%]
ACL-ARC1,9418.3%68.9% [61–76%]

Both numbers matter. Keystone is built to refuse: no cue phrase written down, no stance reported, nothing shown. On a broad corpus that means it declines most citations — "using CMet cardiac metric software [12]" is a real adoption whose only evidence is knowing what CMet is. Its macro-F1 is 0.325 and 0.204, below the 0.273 a cue-phrase system from 2000 scores on ACL-ARC and far below the 0.84–0.889 of trained neural classifiers, because macro-F1 punishes silence exactly as hard as error. That figure is published too; leaving it out would be the convenient choice.

On 90 citations from this library labelled by hand, accuracy is 87% [78–92%] and macro-F1 0.84, against 0.59 for a bag-of-words classifier over the same sentences. That sample says the rules are self-consistent, not that they travel — see eval/corpora/README.md, which also records the three real defects scoring against public labels found and fixed. Roughly one reading in five is wrong either way, which is why every row shows the sentence and the cue it keyed on.

Why not audit the arithmetic? That was the first version, and it shipped. A paper's numbers can only be reported as an *absence* of errors, and careful papers have none: across nine foundational papers the check suite correctly produced zero findings, so its best possible output was a blank page. The numeric analysis is still here — claims traced to table cells, every number indexed, baselines checked against the papers they cite — but below the lineage, where a detail belongs. See RELEASE.md for the pivot.

Landscape

Two things are true and worth stating plainly.

The mainstream tools — SciSpace, ChatPDF, Elicit, Paperguide, NotebookLM — are all the same pipeline: chunk, embed, retrieve, answer, cite a page number. They compete on corpus size and polish, not capability.

But Keystone is *not* the first tool to pin paper criticism to the page. Loupe (Apache 2.0) reviews scientific papers in a cheap triage pass followed by an opt-in deep dive, and pins every finding to a bounding box verified by a vision model. Someone converging independently on pixel-pinned findings is evidence the direction is right. Where Keystone differs:

LoupeKeystone
VerdictsLLM judgementDeterministic code — statcheck/GRIM recompute, arithmetic re-derivation, abstract↔table tracing
LocalizationMinerU → markdown, vision pass confirms the boxWord geometry, measured: 99.94% verified, 0/359 fabrications anchored
Source of truthOCR'd markdownarXiv LaTeX source — exact equations, table numbers, \cite keys
Citationsflags "citation required"fetches the cited paper and checks entailment
Finding structureflat severity-ranked listclaim DAG with load-bearing ranking
Emphasisproof and reasoning defectsempirical defects — baseline fairness, leakage, variance, SOTA scope

Loupe's issue taxonomy (logic, quantifier scope, missing step) is oriented at proofs. Keystone's is oriented at experiments, which is where ML/CS papers actually go wrong.

Status

Live at https://keystone-research.vercel.app. The numbers below are read from the generated JSON the build writes, so they cannot drift from the run that produced them.

Papers analysed234
Citation readings1524, 90.7% anchored to the page
Assumptions973, of which 838 state nothing in support
Walkable paper-to-paper edges548
Tests274 Python, 49 JavaScript

The anchor layer. Tight anchors survive an independent geometric round-trip through MuPDF rather than through the matcher's own index; the gate is ≥99% and the suite refuses to build below it. Real spans are never rejected and fabricated quotes are never anchored — both are gated at zero. Roughly 93% of a paper's LaTeX sentences can be found in its PDF, and a source that matches its PDF on fewer than a quarter of sampled sentences is refused outright rather than published.

The cue rules, scored on somebody else's labels. Against SciCite (11,014 citation contexts) the rules report a stance for 4% of citations and are right about 80% of those, 95% CI 76–84%. Macro-F1 is 0.325 against neural classifiers near 0.84, and that gap is the deliberate trade: macro-F1 punishes silence exactly as hard as error, and this is built to be silent where a sentence carries no cue. See /method on the site.

What runs. The reader with pixel-anchored highlights, highlights and notes for signed-in readers, Google sign-in with cross-device sync, search and a library guide, library-wide views (/timeline, /contested, /assumptions), a feed of new work (/news), on-demand analysis of any arXiv paper that ships LaTeX source, an MCP server at /api/mcp, and cookieless analytics.

Deliberately not built. Per-visitor tracking, and any claim the parser cannot anchor. The deterministic numeric checks were largely retired: on carefully reviewed papers their best case was a blank page, and the project's value turned out to be lineage rather than arithmetic. See RELEASE.md.

Why the anchor layer got this much attention

Every downstream claim depends on it. A finding that says "the abstract reports 94.2% but Table 3 says 93.8%" is worthless unless the reader can click it and land on both numbers. Getting there took several rounds of measurement, and the interesting part was that the first three failures were in the *test*, not the code:

  • Round-trip started at 67.6%. Cause: a tall ( from a display formula legitimately clips into a body line, breaking exact string containment.
  • Union bounding boxes let one tall glyph (→∞) stretch a line's highlight over the whole of the *next* line. Real defect; fixed with median line boxes.
  • Content-stream word order and clipped-text order genuinely differ across columns and table rows, so any whole-span ordering assertion is invalid. Now checked per rectangle, where order is unambiguous — a stricter test, not a looser one.
  • Fuzzy matching accepted 5.9% of fabricated quotes while matching zero of 1846 real spans. partial_ratio scores the best window, so a single substituted word barely moves it: "Trade, feature 9-50" scored 93.6 against "Trade, pages 9-50". For a tool whose job is verifying what a paper says, that is the worst possible failure mode. Fuzzy is now opt-in, with a word-substitution guard.

Anchors self-report precision (tight / approximate), and verification holds each to its own contract. In stacked geometry — a fraction's numerator over its denominator — no axis-aligned rectangle can be tight, so an anchor says so instead of implying a precision it does not have.

What the checks taught us

Every false positive the suite has ever produced was a *trigger* error, not an arithmetic error — which is the specific danger of deterministic checking. A check that computes correctly but fires on the wrong premise asserts nonsense with certainty, and is worse than a model's hedged guess. The four that reached real papers:

  • Substring label matching. "sum" in "summarization" and "avg" in "avg pool" turned a method name and a layer name into aggregate rows, producing 21 high-severity findings on correct tables. Labels are now matched whole.
  • Assumed orientation. Bold marks the best down a column in some tables and across a row in others. Assuming the first produced 31 confident findings on one correct InstructGPT table. Orientation is now inferred per table and validated.
  • Ignored band structure. A results table is banded — prior work, a rule, then the authors' rows — and "best" is a claim about a band. Judging the Transformer's Table 2 down the whole column reported the best *ensemble* as a middling value. \midrule is now kept as structure rather than stripped as formatting.
  • Comparing unlike quantities. A ResNet row holding mAP@.5 and mAP@[.5,.95] for two datasets was compared end to end, reporting the smaller metric as failing to be best. Row comparisons now group by the innermost column header when those headers repeat.

The common remedy is the same in each case: a check must validate its own premise before stating its conclusion. A total row is only reported as wrong if it adds up correctly in some other column; emphasis is only read as "best" if that reading explains the paper'

只显示了开头部分;其余内容请在仓库中阅读

问 PopNx