Skip to main content
Glama
Pseudogiant-xr

PseudoLife-MCP

Official

memory_graph

Read-only

Read an entity's graph neighborhood—nodes, typed edges, canonical facts, derived relations, and optional shortest paths—to support persistent memory recall across sessions.

Instructions

Read an entity's graph neighborhood: nodes, typed edges, and each node's canonical facts. Transitive/inverse edges arrive pre-derived (marked derived: true with rule provenance).

Returns: {found, entity, nodes, edges, paths}.

Input Schema

NameRequiredDescriptionDefault
toNoAlso return the shortest path from ``entity`` to this entity under ``paths``; its nodes are folded into the neighborhood.
depthNoHops from the root. Max 3.
entityYesThe root entity to read out from.
include_factsNoFalse omits each node's canonical facts.
relation_filterNoKeep only edges whose relation contains this substring.

Output Schema

NameRequiredDescriptionDefault

No arguments

Schema Changelog

Changes observed during successful MCP inspections.

  1. Changed1 schema field changedv0.18.1
    • addedInput schema / additionalProperties
      Added value: +false
  2. Changed5 schema fields changedv0.15.0
    • addedInput schema / properties / depth / description
      Added value: +"Hops from the root. Max 3."
    • addedInput schema / properties / entity / description
      Added value: +"The root entity to read out from."
    • addedInput schema / properties / include_facts / description
      Added value: +"False omits each node's canonical facts."
    • addedInput schema / properties / relation_filter / description
      Added value: +"Keep only edges whose relation contains this substring."
    • addedInput schema / properties / to / description
      Added value: +"Also return the shortest path from ``entity`` to this entity under ``paths``; its nodes are folded into the neighborhood."
  3. First observedv0.11.0

TDQS

A3.7/5.0
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Annotations already establish the safety profile (readOnly, non-destructive, closed-world), so the description only needs to add read-specific context — and it does: transitive/inverse edges arrive pre-derived, are flagged `derived: true`, and carry rule provenance. That is real behavioral detail an agent cannot get from annotations, though pagination/size limits are unmentioned.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

Tight and front-loaded: purpose first, then the derived-edge behavior, then the return keys. The trailing return-shape sentence partially duplicates the output schema, but it is short enough not to be wasteful.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness4/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

With a 5-parameter schema at full coverage, an output schema, and annotations covering the safety profile, the description supplies the one thing structured data cannot — how edges are derived and flagged. It is nearly complete; a note on result size or the shortest-path behavior would close the remaining gap.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, so depth, to, include_facts, and relation_filter are fully documented in the schema itself. The description adds no parameter-level meaning beyond that, which matches the baseline 3.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb and resource ('Read an entity's graph neighborhood') and enumerates what it returns (nodes, typed edges, canonical facts). It clearly reads as the graph-traversal counterpart to memory_get/memory_search, but it never names or distinguishes itself from those siblings explicitly.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines3/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

The scope ('an entity's graph neighborhood') implies when you'd reach for it, and the mention of a `to`-style shortest path is only in the schema. There is no explicit when-to-use/when-not guidance versus memory_get, memory_recall, or memory_graph_review.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.