In this section, we present a general \( G \) -block that spreads information through a network in a distributed fashion.
Originally provided in [1]} using the language of field calculus, we translate it here to one more appropriate of this journal.
Section REF  describes a special case shown to be GUAS in [2]}, with proofs omitted, plus examples and a shortcoming.
Section REF  then presents a more general algorithm that removes this deficiency, and Section REF  provides assumptions and definitions that will be used for proofs in subsequent sections.
