Jev graph walk Code & experiments

AN OPEN RETRIEVAL EXPERIMENT

Follow an edge.
Carry the evidence.

A small judgment at each hop. Several paths kept alive. Watch what happens when the next decision can use what the graph just revealed.

Recorded Jev calls · Synthetic graphs · No key needed

Loading recordings…

Loading the experiment…

Where the walk goes

RetrievedCurrent hopNot yet visitedSelect a node to inspect its sources
0 / 0

SAME GRAPH, DIFFERENT WALKS

What changes?

StrategyRequired evidenceNodes readModel callsInput tokensStopped because

Required evidence is scored against separate authored labels. It measures retrieval, not answer correctness. Token counts include reused recordings. Select a row to replay that strategy.

THE MECHANISM

The context moves
with the path.

  1. Read

    Fetch an entity's source records. Keep their IDs and assertion status.

  2. Judge

    Score each outgoing edge against the question and that path's evidence.

  3. Branch

    Keep useful alternatives within a fixed budget. Repeat with new evidence.