Sorting is fundamental to many ML tasks. This paper establishes a nice connection between sorting and optimal transport to derive a generalization of sorting called Kantorovich sorting. It adds entropy regularization to get to a version they call Sinkhorn sorting which turns out to be differentiable in the argument being sorted. Authors are requested to make the changes promised in their rebuttal before submitting the final version.