Let $\pi(x)$ be the prime-counting function, I'm curious about if a suitable variant of the second Hardy–Littlewood conjecture (this corresponding Wikipedia) $$\pi(x^a+y^b)^\alpha\leq \pi(x^c)^\beta+\pi(y^d)^\gamma\tag{1}$$ can be proved, where the constants $0<a,b,c,d\leq 1$ and the constants $0< \alpha,\beta,\gamma\leq 1$ are very close to our upper limit $1$, for all real numbers $x<y$ with $L<x$ for a suitable choice of a constant $L$.
Question. Is it possible to prove any statement of the type $(1)$ under the cited requirements, for constants $0<a,b,c,d\leq 1$ and constants $0< \alpha,\beta,\gamma\leq 1$ all these (all together/ simultaneously) very close to $1$, for all real numbers $x<y$ for a suitable $L<x$? Many thanks.
I don't know if this type of proposals $(1)$ are in the literature, or are essentially the same original second Hardy–Littlewood conjecture, when we require that those constants are very close to $1$.
If there is relevant literature answer my question as a reference request and I try to search and read those statements from the literature.
References:
[1] G. H. Hardy and J. E. Littlewood, Some problems of ‘Partitio numerorum’ III: On the expression of a number as a sum of primes, Acta Math. (44): 1–70 (1923).