MCP server exposing a mykg knowledge graph session for LLM-powered Q&A. Loads nodes.jsonl, edges.jsonl, and schema.json from a session, builds an in-memory NetworkX DiGraph, and exposes 15 query tools + 2 resources via the Model Context Protocol.
Single tool (mykg_search_nodes) with acceptable naming and reasonable description, but lacks critical parameter descriptions and comprehensive output schema documentation. Tool name follows verb_noun pattern ('search_nodes') which is good, but the input schema is incomplete: 'type' and 'limit' parameters have descriptions but lack explicit type declarations in the visible schema structure. The tool description (153 chars) is adequate but does not fully explain what fields are returned or how results are ranked beyond the brief ranking statement. No error handling guidance is documented. The server relies on STDIO transport which is a hard architectural limitation.
Search for entities in the knowledge graph by name, alias, or attribute value. Matches are ranked: exact > prefix > substring > alias > attribute value. Use this to discover node IDs before calling mykg_get_node or mykg_get_neighbors.
Parameter descriptions exist but type system is unclear in schema; 'type' and 'limit' parameters lack explicit JSON Schema type declarations visible in the provided code
Output schema is not documented. Tool description does not specify what fields are returned (e.g., node_id, name, type, confidence_score, aliases) or how pagination/limits are handled. LLMs cannot plan downstream calls without knowing the response structure.
No error handling or recovery guidance documented. If a query returns no results, or if 'limit' exceeds the maximum allowed, no actionable error message or guidance is provided for the LLM.
Tool description does not explain when to call this tool versus other discovery/lookup tools (if any exist). Rank criteria (exact > prefix > substring > alias > attribute) are mentioned but not explained clearly enough for LLM decision-making.
Inferred effective spec: <=2025-11-25.
| Scored | Grade | Overall | Spec posture | Rubric |
|---|---|---|---|---|
| 2026-09-23 | D | 51 | <=2025-11-25 | v2 |
No indication of performance limits. What happens if a knowledge graph has 100,000 nodes and default limit=20 is requested? What is the maximum allowed limit? No constraints documented.