Path Intersections: Graph-Augmented Vector Recall Explained
Sometimes, the connection between two concepts is not obvious from their vector distance. For example, "Project Atlas" and "port 9091" might have low vector similarity, but they are linked in history because they co-occurred in a debug session.
Spector surfaces these hidden connections by checking Path Intersections in the Hebbian graph.
Intersection Mechanics
When a query is run:
- Retrieval returns a set of seed vector nodes.
- Spreading activation is run on these seeds, generating excitement paths.
- Spector identifies nodes where these paths intersect.
- If two concepts share a common historical node, they receive an activation boost.
This allows the agent to surface context that is structurally related, even if the text embedding models failed to capture any similarity.