An improvement to a result about graph isomorphism networks using the prime factorization theorem
The unique prime factorization theorem is used to show the existence of a function on a countable set π³ so that the sum aggregator function is injective on all multisets of π³ of finite size.
READ FULL TEXT