A Near Linear Query Lower Bound for Submodular Maximization | Read Paper on Bytez