arXiv (All)
open access
Edge-Girth as a Structural Edge Feature for Graph Neural Networks
Graph neural networks (GNN) based on message passing are provably no more powerful than the one-dimensional Weisfeiler--Leman colour-refinement test (1-WL): two graphs it cannot tell apart receive identical representations, however deep or wide the network. A common remedy augments node or edge feat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degraded but Not Entirely Ineffective: PE-Based Deformable Graph Neural Networks#1071474
- Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily#1118837
- NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption#630167
- NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption#628305
- GriNNder: Breaking the Memory Capacity Wall in Full-Graph GNN Training with Storage Offloading#178849
Record · ID 821374
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive