Partition regularity of the three-term reciprocal pattern

A finite coloring of $\mathbb{Q}$ is a coloring using finitely many colors. A pattern is partition regular over $\mathbb{Q}$ if every finite coloring of $\mathbb{Q}$ admits parameters making all entries of the pattern the same color.

Three-term reciprocal-pattern conjecture. The pattern

$$\left\{x,\ x+d,\ x+\frac{1}{d}\right\}$$

is partition regular over $\mathbb{Q}$.

This is weaker than the reciprocal parallelogram conjecture, since it omits $x+d+1/d$, but the paper states that even this weaker pattern is not known.