Weak Sidorenko expansion conjecture

Let $F$ be a bipartite graph, and let $\mathrm{E}^r(F)$ denote its $r$-uniform expansion: each edge of $F$ is extended to an $r$-edge by adding new vertices. An $r$-graph is Sidorenko if its homomorphism density satisfies the Sidorenko inequality for every $r$-graph. Weak Sidorenko expansion conjecture. For every bipartite graph $F$, there exists an integer $r\geq 2$ such that $\mathrm{E}^r(F)$ is Sidorenko. This is presented as a potentially weaker version of Sidorenko's conjecture, since Sidorenko's conjecture would give the conclusion with $r=2$; the supplied source gives no resolution status.