Research map / Graph learning / GNN architectures
Logical Characterizations of GNNs with Mean Aggregation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Sound Logical Explanations for Mean Aggregation Graph Neural Networks (NeurIPS 2025 · similarity 0.91)
- Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization (NeurIPS 2025 · similarity 0.89)
- Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness (ICLR 2024 · similarity 0.88)
- Logical characterizations of recurrent graph neural networks with reals and floats (NeurIPS 2024 · similarity 0.88)
- Recurrent Graph Neural Networks and Their Connections to Bisimulation and Logic (AAAI 2024 · similarity 0.88)
- Almost Surely Asymptotically Constant Graph Neural Networks (NeurIPS 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
