How to reduce UNSAT problems so that less than $7/8+\epsilon$ of clauses are unsatisfied?
The reference is Håstad's classic paper, Some optimal inapproximability results. It relies on the PCP theorem and on Raz's parallel repetition theorem. The proof is not particularly easy, and even the reduction itself is not so simple to state (if you take into account the PCP component).