# An improvement to a result about graph isomorphism networks using the prime factorization theorem

arXiv: https://arxiv.org/abs/2205.01214 · HTML: https://mlsanity.com/paper/2205.01214/

## 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 (most cited first, 1 of 1)

- [How Powerful are Graph Neural Networks?](https://mlsanity.com/paper/1810.00826/) (2018)

## 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.