Abstract

We introduce a new method for building models of [Formula: see text], together with [Formula: see text] statements over [Formula: see text], by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only [Formula: see text]-many of them. Using this approach, we build a model in which a very strong form of the negation of Club Guessing at [Formula: see text] known as [Formula: see text] holds together with [Formula: see text], thereby answering a well-known question of Moore. This construction can be described as a finite-support weak forcing iteration with side conditions consisting of suitable graphs of sets of models with markers. The [Formula: see text]-preservation is accomplished through the imposition of copying constraints on the information carried by the condition, as dictated by the edges in the graph.