An improvement to a result about graph isomorphism networks using the prime factorization theorem
arXiv:2205.01214
Abstract
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.
2 pages