AWhat changed
Learns soft node-to-cluster assignments and coarsens features and adjacency through S-transpose Z and S-transpose A S, enabling hierarchical graph neural networks.
Scientific scope
Learns soft node-to-cluster assignments and coarsens features and adjacency through S-transpose Z and S-transpose A S, enabling hierarchical graph neural networks. Six original authors. Learned hierarchical pooling is not exact graph isomorphism, ground-truth community recovery or universally sparse coarsened graphs; assignment and dense coarsening introduce costs. The generic graph-learning evaluations do not establish arbitrary downstream application benefits.
Evidence
The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Six original authors. Learned hierarchical pooling is not exact graph isomorphism, ground-truth community recovery or universally sparse coarsened graphs; assignment and dense coarsening introduce costs. The generic graph-learning evaluations do not establish arbitrary downstream application benefits.
Contributors
- Source-listed authors and technical contributors · SCIENCE: Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction