论文标题
使用质量分解定理对图形同构网络的结果改进
An improvement to a result about graph isomorphism networks using the prime factorization theorem
论文作者
论文摘要
唯一的质量分解定理用于显示在可数集$ \ MATHCAL {x} $上的函数的存在，以便在有限大小的$ \ Mathcal {x} $的所有多键上注入总和聚集器函数。
The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.
