One of the basic concepts for the transformation of graphs is node replacement, in particular the NCE approach. As graphs do not offer a sufficiently rich model for certain applications, NCE rewriting has been generalized to directed hypergraphs where an edge may be incident to an arbitrarily long sequence of nodes. At the same time, pullback rewriting has been proposed as a generic mechanism for node replacement which allows to study this concept independently of any concrete graph (or hypergraph) model. This paper shows how node rewriting in directed hypergraphs fits in the abstract framework of the pullback approach.