Skip to main content

Spreading Activation Retrieval

Hystersis’s proprietary spreading activation retrieval improves multi-hop reasoning by 23% over pure vector similarity search by propagating activation signals through the knowledge graph.

How It Works

Based on the Synapse paper (arXiv:2601.02744), spreading activation combines vector search with graph traversal:

Algorithm Steps

  1. Initial Activation — Convert query to embedding and find top-K similar nodes via Qdrant vector search
  2. Graph Propagation — Propagate activation through Neo4j graph with per-hop decay
  3. Threshold Filtering — Keep nodes above activation threshold
  4. Hybrid Ranking — Score results by combining activation level with vector similarity

Propagation Parameters

Example

API Usage

cURL

Search Modes

Benchmark Results

Configuration

When to Use Spreading Activation

  • Multi-hop questions — “What tools does Alice’s team use?”
  • Relationship queries — “Who works with Bob on similar projects?”
  • Exploratory search — “Tell me about the tech stack at TechCorp”
  • Context-rich queries — Questions that require connecting multiple facts

See Also