It should also be noticed that we have put two identical lines in Table 1. One should have been for SLink and the other for LCA. The complexities are identical.
In Sect. 8.1 it is said that RePair compresses the differential SA and LCP arrays to O(R log(n/R) log n) bits. This is inherited from previous publications, where it is not properly proved, and most likely to be incorrect; see Appendix A in https://arxiv.org/pdf/1705.10382.pdf. An alternative grammar compressor achieving this space is given in that arxiv paper.