Review for NeurIPS paper: Universal Function Approximation on Graphs

Additional Feedback: page 1, last para: this is confusing to read. The reference cited here is Babai's paper. Why is the slowness of current graph isomorphism algorithms relevant to the problem of producing isomorphism-injective graph representations? Definition 3: a minor point, but it is useful to say what is meant by size (e.g., #edges, or size of description of the graph) After definition 7, it is useful to formally define the notion of "universal function approximator", as this could be interpreted in different ways The notation of multi-function in Definition 6 uses a double arrow, but it doesn't seem to get used consistently like that. It is used with a single arrow in Definition 7. Also the notion is confusing, since it is not a function into the range but into its power set.