$k$-graph algebras are iterated Cuntz-Pimsner algebras -- from the bottom up

We introduce a new method of expressing a $k$-graph $C^{\ast }$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our process, on the other hand, starts at the bottom, with Pimsner’s theorem for graph algebras, and iterates upward. We actually work with product systems over ${\mathbb{N}}^k$, and the result for $k$-graphs is a special case. Our iteration step involves a decategorization'' of a recent theorem showing that the Cuntz-Pimsner construction is functorial at the level of enchilada categories’'.