An improvement to a result about graph isomorphism networks using the prime factorization theorem
Machine Learning
2022-05-04 v1
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.
Keywords
Cite
@article{arxiv.2205.01214,
title = {An improvement to a result about graph isomorphism networks using the prime factorization theorem},
author = {Rahul Sarkar},
journal= {arXiv preprint arXiv:2205.01214},
year = {2022}
}
Comments
2 pages