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