Tao's shifted convolution conjecture for generalised divisor functions

Let $d_k(n)$ denote the number of ordered factorizations of $n$ into $k$ positive integers, and let $d_l(n)$ be defined similarly. Let $\boldsymbol{\epsilon>0}$ and $k,l\ge 2$. For $1\le h\le x^{1-\epsilon}$, Tao's shifted convolution conjecture.

$$\sum_{n\le x}d_k(n+h)d_l(n) \sim \frac{c_{k,l}(h)}{(k-1)!(l-1)!}x(\log x)^{k+l-2}$$

as $x\to\infty$, for an explicit constant $c_{k,l}(h)$. This extends the conjectural asymptotic of Conrey and Gonek for equal indices and remains open in the stated range; Ng and Thom proved a lower bound of the correct order.