Most of the paper was quite good and the results seem promising. One of the simpler ideas is to represent the set of offsets as a bitvector with a select structure which I didn’t think of and I think it’s a nice idea. It works under the assumption that the difference between offsets is typically less than the size in bits of an offset but I think this could reasonably be true in many cases.

Other approaches involve permuting vertex ids (which can potentially be quite slow) which makes me a bit sad although I’m not really sure why.

The mathematical notation is ugly and mangled in some places and in a few places wrong but this is sadly common with computer science papers so I can’t really complain much about it.

The diagram on page 2 is completely bonkers. I sympathise a bit in that it can be amusing to create crazy graphics in TIKZ but this one doesn’t really serve its purpose (of explaining what the sections of the paper are) at all.