Timestamp-sorted CSR storage with binary search reduces per-node temporal sampling cost from O(deg(v) + k) to O(log(deg(v)) + k)

We implement timestamp-sorted CSR storage with binary search, reducing the per-node temporal sampling cost from $O(deg(v) + k)$ to $O(\log(deg(v)) + k)$.

http://arxiv.org/abs/2608.27413v1