SlowGuess/NeurIPS_2023_OCR huggingface dataset:
$\sum_{i=1}^{D} 2K^{var} = 2K^{var}D$  correlated variable node pairs. Correspondingly, since the complexity of graph computation is related to the number of edges, the time and space complexity of cross-variable GNN are both  $O(K^{var} \times D)$ . As  $K^{var}$  is a constant that is independent of  $D$ , its complexity is linear (i.e.,  $O(D)$ ).