Prove that there exist infinitely many integers $x$ such that integer $P(x)=x^6-4$ is a sum of two squares of integers.
Equivalently, prove that $x^3-2$ and $x^3+2$ are simultaneously sums of two squares for infinitely many integers $x$.
This is an extension of my previous question about $P(x)=x^3-2$.
The methods in the answers to that question are sufficient to resolve this problem for all examples of cubic and quartic polynomials $P(x)$ with small coefficients (although I do not have any general theorem that they always work). However, I do not see how to apply such methods for higher degree polynomials, and $P(x)=x^6-4$ is one of the nicest examples.
By Schinzel's hypothesis H, $x^3-2$ and $x^3+2$ are simultaneously primes infinitely often. If $x$ is $3$ modulo $4$, these primes are both $1$ modulo $4$, and the claim follows.
But Schinzel's hypothesis H is out of reach. There are many papers proving that values of certain polynomials are the products of a bounded number of primes, but I never saw results of this type when the primes are restricted to be $1$ modulo $4$.