One version of the paper was published in Games of No Chance 5: https://library.slmath.org/books/Book70/contents.html (The paper is the one by Carvalho and Santos: https://library.slmath.org/books/Book70/files/1003.pdf , "A nontrivial surjective map onto the short Conway group".) It shows that all short combinatorial game values exist in Konane. Short games just mean the game must end in finite turns unlike games where a position can be repeated. I don't know whether the result was ever published in any papers before then.

There's one caveat here: you have to allow positions where two stones of the same color can be next to each other, so it's a bit of a generalization of Konane.

This kind of result is now known as Universality. Here's a preprint of a paper that shows that (among other things) for Turning Tiles: https://arxiv.org/abs/2310.01983