Pretentious multiplicative functions and the prime number theorem for   arithmetic progressions
  Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions. 
Dimitris Koukoulopoulos
math.NT