The Carlson-Simpson lemma describes a Ramsey-type structural result about colorings of variable words over finite alphabets. The paper establishes that a specific instance of this lemma for 1-variable words is Pi-0-4 conservative over the base system RCA-0, meaning it cannot prove any new statements of a certain syntactic complexity beyond what RCA-0 already proves. The open question is whether this conservation bound is sharp: could the result actually be Pi-0-3 conservative, which would place it in a strictly weaker and more tractable logical category, or does some Pi-0-4 statement genuinely require the lemma for its proof, confirming that Pi-0-4 is the exact threshold?