arXiv (All)
open access
Edge-Level Automorphism in GNNs: A Quantitative Framework and Effective Designs For Link Prediction
Graph Neural Networks (GNNs) are effective for learning node and link embeddings through permutation-equivariant aggregation. However, standard GNNs collapse automorphic nodes, i.e., those with identical structural roles (or orbits) into indistinguishable representations, leading to the node automor
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
- Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily#1118837
- Unifying Graph Neural Networks Through a Common Layer Equation#620512
- Graph Neural Networks for Graphs with Heterophily: A Survey#152954
- TGHE: Template-based Graph Homomorphic Encryption for Privacy-Preserving GNN Inference in Edge-Cloud Systems#310751
- Rapid training of Hamiltonian graph networks using random features#144305
Record · ID 1128987
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