Localized hypergraph clique-weight conjecture

Let $\mathcal{H}$ be a $q$-uniform hypergraph with $m$ edges, let $\K(\mathcal{H})$ denote its collection of cliques, and let $t\geq q>i\geq 1$. For each $I\in\binom{V(\mathcal{H})}{i}$, define $x(I)\geq q-i-1$ by

$$d(I)=\binom{x(I)-i}{q-i},$$

and for each $T\in\K(\mathcal{H})$ define

$$x(T)=\max\{x(I):I\in\binom{T}{i}\},\qquad s'(T)=\frac{1}{\binom{x(T)-q}{t-q}}.$$

Localized hypergraph clique-weight conjecture. One has

$$\sum_{T\in\K(\mathcal{H})}s'(T)\leq\frac{m}{\binom{t}{q}}.$$

This is proposed as a localized version of a theorem of Kirsch and Radcliffe for hypergraphs, paralleling the paper's localized clique bounds. The supplied text gives no evidence that it has been proved or refuted.