NVIDIA NemoClaw CKG

io.github.Yarmoluk/ckg-nvidia-nemoclawVersion 0.10.3

NVIDIA NemoClaw knowledge graph — 55 nodes, F1 0.576 (+269% vs RAG), 11x fewer tokens. MCP-native.

Status

Responds197 msNov 14, 2026, 14:43 UTCAnswered our handshake without sign-in.

Registry data may be out of date

We could not refresh it, so this page shows the last copy.

Last checked: Nov 14, 2026, 14:43 UTC
Latency: 197 ms
Remotes responding: 1 of 1
Sign-in: No sign-in
Hosting: Hosted outside the EU (detected)
Registry data as of: Nov 14, 2026, 22:14 UTC

Data from the official MCP Registry, checked by run.zero. How we check

Connect

Streamable HTTP

https://ckg-nvidia-nemoclaw.onrender.com/mcpResponds197 msNov 14, 2026, 14:43 UTC

No sign-in

Claude Code

claude mcp add --transport http ckg-nvidia-nemoclaw https://ckg-nvidia-nemoclaw.onrender.com/mcp

Claude Desktop and claude.ai

1
2
3

Settings > Connectors > Add custom connector
Name: ckg-nvidia-nemoclaw
Remote MCP server URL: https://ckg-nvidia-nemoclaw.onrender.com/mcp

Cursor

{
  "mcpServers": {
    "ckg-nvidia-nemoclaw": {
      "url": "https://ckg-nvidia-nemoclaw.onrender.com/mcp"
    }
  }
}

VS Code

code --add-mcp '{"name":"ckg-nvidia-nemoclaw","type":"http","url":"https://ckg-nvidia-nemoclaw.onrender.com/mcp"}'

Streamable HTTP

pypi: ckg-nvidia-nemoclaw 0.10.3

Package only

PyPI (uvx)

claude mcp add ckg-nvidia-nemoclaw -- uvx ckg-nvidia-nemoclaw==0.10.3

Built your own server? run.zero hosts MCP servers on European infrastructure.

Host your own MCP server on run.zero

Tools

8 tools

Tools of NVIDIA NemoClaw CKG
	Description		Read-only	Idempotent	Open world
`ask_nemoclaw`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.	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.	Not declared	Not declared	Not declared	Not declared
`get_prerequisites`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.	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.	Not declared	Not declared	Not declared	Not declared
`list_domains`List available domains in this CKG server.	List available domains in this CKG server.	Not declared	Not declared	Not declared	Not declared
`query_ckg`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).	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).	Not declared	Not declared	Not declared	Not declared
`query_intersect`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.	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.	Not declared	Not declared	Not declared	Not declared
`route_query`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.	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.	Not declared	Not declared	Not declared	Not declared
`search_concepts`Fuzzy search for NemoClaw concepts by name or keyword. Args: query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').	Fuzzy search for NemoClaw concepts by name or keyword. Args: query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').	Not declared	Not declared	Not declared	Not declared
`verify_source`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').	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').	Not declared	Not declared	Not declared	Not declared

Details

Registry status: Active
Published: Jul 29, 2026
Updated: Jul 29, 2026
Website: Not given
Repository: https://github.com/Yarmoluk/ckg-nvidia-nemoclaw⁠ (opens in a new tab)
Categories (suggested): Knowledge and notes DatabasesSuggested categories are assigned automatically from the registry text and may be wrong. Verified operators can correct them.
GDPR: Not declared

Are you the operator? Claim this listing