Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard. - Andrei Krokhin; Danny Vagnozzi (CoRR, 2025)