We consider the lossy one-helper problem for vector-valued
sources. When the sources are jointly Gaussian and the
helper's source is scalar, we determine the rate region
completely and show that a simple coding strategy of
quantization followed by Slepian-Wolf binning is optimal.
For discrete memoryless sources, we show that this
architecture is not optimal, resolving in the negative
a long-standing open question in the area.
