A Proof of Theorem 1 Let f be a layer of SMP: f (U, Y, A)[i,:,: ] = u(U

Neural Information Processing Systems 

We prove the claim by induction. We now shift to the case of SMP . We use an inductive argument. B.3 Extension for attributed graphs It was proven in Theorem 3 that, under the corollary's conditions, the local context (Algorithm 1). We will prove by induction that any Fast SMP layer can be approximated by two blocks of PPGN.