50 questions across 16 scenarios (supersession chains up to depth 3, typed and untyped value conflicts, alias-only references, and as-of boundary reads). The naïve baseline picks the active claim with the most word overlap — it can't see supersession chains, can't surface conflicts, and guesses on every abstention. The graph probe gives typed coverage: abstain when nothing supports the question, escalate on conflict or history, answer cheaply only when the graph is clean. The single router+probe miss is a subject/object inversion ("who works on X" vs "X is owned by who") — a documented vocabulary limitation, not a retrieval error.