A graph that cannot say no

July 2026 filled the conversation with typed graphs for agents, on a thesis that is correct — an untyped edge carries one bit; a typed one carries meaning — and with independent benchmarks that back it. But those same benchmarks say something their popularisers do not finish: one system collapsed to 6.6 average F1 against 59.8 the moment somebody other than its authors evaluated it, and a five-hop chain at 85% per-hop accuracy is worth 44%. The problem is not missing structure. It is that structure, alone, obliges nothing. And the gap the article itself declares empty — a linter for typed edges — has been running here for a while.