CSP911/routemind

A routing table for an agent, written and kept by people. You split a body of documents into
areas. Each area describes, in one sentence, when someone should come to it. An agent reads that list
of sentences first, chooses, and walks down a tree of short lines to the document. The map shows you
the tree, and one click shows you the exact text the agent is given at each step.
The domain is not in the code. The areas, the lines and the documents are data, kept in your own git
repository. Every change is a commit.
## The bet
RouteMind does not replace retrieval. It makes one bet:
> Where documents resemble each other — revisions of one rule, rows that differ by a code, policies
> that differ by one condition — a routing table that people write and maintain finds the right
> document more reliably than similarity search. The price is several times the cost per question,
> plus the labour of keeping the table true.
The bet is lost if any of these turns out to be true:
Retrieval is already good enough on real documents. Then the walk costs more and buys nothing.
Keeping the map costs more than the wrong answers it prevents. The map is human work, every
week.
A large map loses the agent. Measured once, small: 5 areas against 30, with confusable
neighbours, did not change which area was chosen (eval/scale/). Dozens of real areas
or tens of thousands of documents have not been tried.
None of these has been settled on real data. Everything measured so far is listed below, together
with what it does not show.
## How it works
The idea is borrowed from routing on a network. An area advertises when it is relevant, not
everything it holds. That keeps the first list the same size whether the areas hold 80 documents or
8,000.
BACK-BONE ─ the whole map. Hop 0: one row per area, nothing else,
│ and the only place "it is not here" may be said
├── AS expense "what to do with a receipt · whether the corporate card
│ │ may be used here · how much a business trip pays"
│ ├── AS corp-card ← an area holds areas: the same thing one level
│ │ └── card-limit down, describing itself the same way
│ └── AS evidence
├── AS approval "whom to put in the approval chain · …"
└── AS payroll "what this payslip line means · …"
usewhen is the only text the agent reads before it chooses an area. An area with a title and
no reason is an area nobody picks.
Each table describes only its own area. An area's table says what that area holds, never what
the whole map lacks. Only someone who has read hop 0 may conclude that something is not here.
Every walk starts at hop 0, and every step records why it was taken. The MCP server enforces
this. The map replays any walk from the last six hours.
Writing is a set of decisions. When an agent files a document, it may create a holder and move
siblings under it in the same change. Every line whose table changes must be either kept or
rewritten, or nothing is written. (docs/CHANGE.md)
Two containers and no database. ontology is the API and the only process that touches your git
repository. web serves the map and acts as a proxy. mcp/knowledgemcp.py is the agent's door: a
single stdlib-only file with four tools — read a table, read a document, place a document, read