NVIDIA NemoClaw CKG
NVIDIA NemoClaw knowledge graph — 55 nodes, F1 0.576 (+269% vs RAG), 11x fewer tokens. MCP-native.
我该使用它吗
质量与安全性
基于对工具定义和协议合规性的自动分析。
上下文开销
这是每次将服务器的工具加载到模型上下文窗口时所消耗的大致 token 数。数值越高,可用于其他任务的注意力就越少。
安装
一键安装
将以下内容添加到你的 `claude_desktop_config.json` 文件中:
{
"mcpServers": {
"ckg-nvidia-nemoclaw": {
"command": "uvx",
"args": [
"ckg-nvidia-nemoclaw"
]
}
}
}可运行的软件包
0.10.3stdio远程端点
https://ckg-nvidia-nemoclaw.onrender.com/mcpstreamable-http它能做什么
工具清单
工具(8)
⚪ask_nemoclaw(question)
Answer a question about NVIDIA NemoClaw by traversing the knowledge graph. Covers: agent runtimes (OpenClaw/Hermes/Deep Agents), OpenShell platform, inference routing, network policy, security layers, deployment paths, progressive tool disclosure, managed MCP servers, snapshots, shields, FOX Blueprint, Nemotron 3 Ultra ecosystem, and platform support. Args: question: Your question about NemoClaw concepts or architecture.
输入模式
{
"type": "object",
"properties": {
"question": {
"title": "Question",
"type": "string"
}
},
"required": [
"question"
],
"title": "ask_nemoclawArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "ask_nemoclawOutput"
}🟢query_ckg(concept, depth)
Return the typed subgraph around a NemoClaw concept. Args: concept: Exact or partial concept label (e.g. 'OpenClaw', 'NetworkPolicy', 'L7Proxy'). depth: Traversal hops (1–5, default 3).
输入模式
{
"type": "object",
"properties": {
"concept": {
"title": "Concept",
"type": "string"
},
"depth": {
"default": 3,
"title": "Depth",
"type": "integer"
}
},
"required": [
"concept"
],
"title": "query_ckgArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "query_ckgOutput"
}🟢get_prerequisites(concept)
Return the full upstream prerequisite chain for a NemoClaw concept. Useful for understanding what a concept depends on end-to-end. Args: concept: Exact or partial concept label.
输入模式
{
"type": "object",
"properties": {
"concept": {
"title": "Concept",
"type": "string"
}
},
"required": [
"concept"
],
"title": "get_prerequisitesArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "get_prerequisitesOutput"
}🟢search_concepts(query)
Fuzzy search for NemoClaw concepts by name or keyword. Args: query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').
输入模式
{
"type": "object",
"properties": {
"query": {
"title": "Query",
"type": "string"
}
},
"required": [
"query"
],
"title": "search_conceptsArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "search_conceptsOutput"
}🟢list_domains
List available domains in this CKG server.
输入模式
{
"type": "object",
"properties": {},
"title": "list_domainsArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "list_domainsOutput"
}🟡verify_source(concept)
Return the authoritative source URL and content hash for a NemoClaw concept node. Every node in the CKG was declared from a specific source document. This tool returns the source URL (where the node came from) and the SHA-256 hash of that document's bytes at extraction time. A hash mismatch on re-fetch means either the source has changed (stale edge — re-extract) or the graph was patched without re-fetching (silent edit — investigate). Audit chain: edge answer → graph commit → source_hash → source_url (fetch hint) Verification: curl -s <source_url> | sha256sum # compare output to source_hash Args: concept: Exact or partial concept label (e.g. 'CorporateCA', 'L7Proxy').
输入模式
{
"type": "object",
"properties": {
"concept": {
"title": "Concept",
"type": "string"
}
},
"required": [
"concept"
],
"title": "verify_sourceArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "verify_sourceOutput"
}🟢route_query(question)
Route a NemoClaw question to the optimal model and reasoning approach via graph depth. The CKG graph IS the router. NemoClaw's dependency chains (e.g. OpenShell → L7Proxy → CorporateCA → mTLS) are deep and typed — hop depth is a deterministic complexity signal. No heuristic: the graph decides which model and reasoning approach to use. Routing table: hop_depth 1 → haiku · direct (single concept lookup) hop_depth 2 → sonnet · generic_cot (moderate chain) hop_depth 3+ → opus · sparql_cot (deep chain, structured reasoning required) Args: question: Concept name or natural language question about NemoClaw / OpenShell. Returns: model_tier + reasoning_approach + why + context subgraph to inject before LLM call.
输入模式
{
"type": "object",
"properties": {
"question": {
"title": "Question",
"type": "string"
}
},
"required": [
"question"
],
"title": "route_queryArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "route_queryOutput"
}🟡query_intersect(branches, depth, direction, mode, limit)
Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B). query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap. Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess. Args: branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes everything within `depth` hops, or an anchor plus an explicit relation path using '>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the frontier. '*' matches any relation. Mix both forms freely. depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths. direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default). mode: 'AND' (default) intersects branches; 'OR' unions them. limit: Max concepts listed, 1-200 (default 40). The true count is always shown. Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
输入模式
{
"type": "object",
"properties": {
"branches": {
"items": {
"type": "string"
},
"title": "Branches",
"type": "array"
},
"depth": {
"default": 2,
"title": "Depth",
"type": "integer"
},
"direction": {
"default": "both",
"title": "Direction",
"type": "string"
},
"mode": {
"default": "AND",
"title": "Mode",
"type": "string"
},
"limit": {
"default": 40,
"title": "Limit",
"type": "integer"
}
},
"required": [
"branches"
],
"title": "query_intersectArguments"
}输出模式
{
"type": "object",
"properties": {
"result": {
"title": "Result",
"type": "string"
}
},
"required": [
"result"
],
"title": "query_intersectOutput"
}社区
证据