3SUM below quadratic time: equivalence of the two WordRAM models

For 3SUM on $n$ integers, where the question is whether three pairwise distinct indices have values summing to zero, solvability in the published signed-pointer EndStatement model at some rational exponent below $2$ is equivalent to solvability in the unsigned-pointer WordRAM model at some rational exponent below $2$. The left side is the published source specification; the right side is the same problem interface transported to the unsigned-pointer model. This is the 3SUM application of the fine-grained transfer theorem: it preserves a positive subquadratic exponent saving, and it does not claim equality of exact exponent bounds.