Verify graph hits by walking exact identifiers and typed edges.
Graph browsing is a deterministic walk
A graph browse follows typed edges in a fixed order. The highlighted path has 6 nodes from the root to the focus.
path nodes=6
Read search results by walking back to exact IDs
A semantic hit is only an entry point. The exact check is the path through pinned identifiers and typed links.
search hit→exact graph path