Galois Theory of Algorithms (2018) [pdf] (opens in new tab)

Galois theory investigates the way a subobject sits inside an object. This paper examines the way different programs sit inside the same algorithm, and the way different algorithms (mergesort, quicksort, etc.) sit inside the same class (sorting algorithm).

Sorry for being off topic, but what is going on with the timestamps of this paper?

The latest version (version 2) has 2018-05-28 as the date above the abstract, but it was added to arxiv on 2014-12-15. Version 1 has the date 2022-05-18, but was added to arxiv on 2010-10-29. I briefly skimmed the .tex source file, but I couldn't find any explanation of the date in there. Did someone mess with the clock on the build server?

See https://news.ycombinator.com/item?id=41255456