We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach related to game semantics and the Danos–Regnier interpretation of GoI operators as paths in proof nets . We show how we can retrieve from this locative framework both a categorical semantics for Multiplicative Linear Logic with distinct units and a notion of truth. Moreover, we show how a restricted version of our (...) model can be reformulated in the exact same terms as Girardʼs geometry of interaction . This shows that this restriction of our framework gives a combinatorial approach to J.-Y. Girardʼs geometry of interaction in the hyperfinite factor, while using only graph-theoretical notions. (shrink)