In assignment problems, the average rank of the objects received is often used as key measure of the quality of the resulting match. The rank-minimizing (RM) mechanism optimizes directly for this objective, by returning an assignment that minimizes the average rank. While a naturally appealing mechanism for practical market design, one shortcoming is that this mechanism fails to be strategyproof. In this paper, I show that, while the RM mechanism is manipulable, it is not obviously manipulable.