Vanishing completability threshold with dimension

Determine whether NC_d(n) = o(1)n as d tends to infinity with n fixed.

Background

NC_d(n) is the smallest thickness of a noncompletable d-dimensional Latin hypercuboid of order n. The paper gives an upper bound of approximately n/2 but asks whether the threshold becomes a vanishing fraction of n as the dimension increases while the order remains fixed.