NVIDIA NemoClaw CKG

Last 30 days

Uptime

100%

Response time

231 ms typical, 231 ms slowest 5%

Last check

5 h ago

Next check

in 34 min

How to call it

Add it to any MCP client that supports remote servers.

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

8 tools

• 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,

• 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).

• 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.

• search_concepts

  Fuzzy search for NemoClaw concepts by name or keyword. Args: query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').

• list_domains

  List available domains in this CKG server.

• 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 h

• 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

• 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

Security scan

• No findings. We scan names, descriptions and tool definitions for hidden instructions and other prompt-injection patterns.

Recent checks