Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence?

The ideas which we developed can also be used to obtain a lower bound based on a safer assumption of NC-SETH, i.e. a version of SETH which talks about NC circuits instead of less expressive CNF formulas.