Plain top-k vector search answers one question: what is closest to the query in embedding space? That is a fine question, and a poor stopping point. A record can be a near-perfect semantic match and still be the wrong thing to retrieve — because it is two years stale, because it sits far from the query in the causal graph, or because the active persona should not be weighting it heavily.
The WDBX hybrid ranker, which companions our paper on the weighted-backtrace store, answers the harder question by combining four independent factors into a single bounded score. This note walks through that score the way you would read it during an incident review.