A new point of NP-hardness for 2-to-1 Label Cover
  We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \eps)$-satisfying assignment. 
Per Austrin and Ryan O'Donnell and John Wright
cs.CC