An improvement to a result about graph isomorphism networks using the prime factorization theorem
Not on the map. Why?
Abstract (arXiv)
The unique prime factorization theorem is used to show the existence of a function on a countable set X so that the sum aggregator function is injective on all multisets of X of finite size.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 1 references that are in the map. First posted on arXiv 2 May 2022.
Builds on
1 of 1 references.
References · 1
- 2018How Powerful are Graph Neural Networks?cited by 4,393
Built on by
Not cited yet.