The Carlson-Simpson theorem is a powerful Ramsey-type result about variable words over finite alphabets, and it is known to require substantial set-existence assumptions. Recent work establishes that a restricted 1-variable version satisfies Pi-0-4 conservation over RCA-0, placing it in a specific region of the reverse mathematics zoo. However, it remains open whether this Pi-0-4 bound is tight, meaning whether the 1-variable lemma actually proves Pi-0-4 sentences not provable in the base system, and whether the lemma is equivalent to some already-known combinatorial principle such as a fragment of Hindman's theorem or a restricted form of the Hales-Jewett theorem. The difficulty lies in the interplay between the combinatorial content of variable-word colorings and the syntactic complexity of the statements involved, which makes both upper and lower bound arguments technically intricate. Solving this problem would clarify the fine structure of Ramsey theory in the reverse mathematics hierarchy and would determine whether the 1-variable restriction genuinely buys foundational economy or is merely a surface-level simplification. It would also provide a template for analyzing other parameterized Ramsey theorems by number of variables, potentially revealing a new axis of complexity in combinatorial logic.