01 / THE WORK
What we admire
Arbor’s graph-native approach values exact symbol relationships over a vague semantic match. That is a principled way to answer questions such as “what calls this function?” and “what might this change affect?”
02 / THE LESSON
The principle that stayed
A graph edge should carry a source location and a defined extraction rule. Determinism makes a result repeatable, although a parser graph still cannot prove the program’s runtime behavior.
03 / OUR BOUNDARY
Where CodeVetter stands
CodeVetter owns a bundled Tree-sitter structural graph and marks extracted links as evidence leads. Arbor’s philosophy informed our evaluation, but its engine is not bundled.