{"total":18,"rows":[{"id":"2406.18380","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","created":"2024-06-26","cited_by_count":49,"area":null},{"id":"2308.16800","title":"Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks","created":"2023-08-31","cited_by_count":18,"area":null},{"id":"2310.07235","title":"Are GATs Out of Balance?","created":"2023-10-11","cited_by_count":10,"area":null},{"id":"2404.17947","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","created":"2024-04-27","cited_by_count":9,"area":null},{"id":"2410.05499","title":"Unitary convolutions for learning on graphs and groups","created":"2024-10-07","cited_by_count":8,"area":null},{"id":"2403.09171","title":"ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks","created":"2024-03-14","cited_by_count":7,"area":null},{"id":"2405.08540","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","created":"2024-05-14","cited_by_count":7,"area":null},{"id":"2406.13137","title":"Efficient Sharpness-Aware Minimization for Molecular Graph Transformer Models","created":"2024-06-19","cited_by_count":7,"area":null},{"id":"2411.10000","title":"DuSEGO: Dual Second-order Equivariant Graph Ordinary Differential Equation","created":"2024-11-15","cited_by_count":6,"area":null},{"id":"2403.11199","title":"Graph Unitary Message Passing","created":"2024-03-17","cited_by_count":5,"area":null},{"id":"2405.15564","title":"Rethinking Independent Cross-Entropy Loss For Graph-Structured Data","created":"2024-05-24","cited_by_count":5,"area":null},{"id":"2305.06102","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","created":"2023-05-10","cited_by_count":4,"area":null},{"id":"2312.02646","title":"SAMSGL: Series-Aligned Multi-Scale Graph Learning for Spatio-Temporal Forecasting","created":"2023-12-05","cited_by_count":1,"area":null},{"id":"2601.13569","title":"DRGW: Learning Disentangled Representations for Robust Graph Watermarking","created":"2026-01-20","cited_by_count":1,"area":null},{"id":"2211.15081","title":"Mitigating Overfitting in Graph Neural Networks via Feature and Hyperplane Perturbation","created":"2022-11-28","cited_by_count":0,"area":null},{"id":"2304.10045","title":"ID-MixGCL: Identity Mixup for Graph Contrastive Learning","created":"2023-04-20","cited_by_count":0,"area":null},{"id":"2407.11358","title":"SES: Bridging the Gap Between Explainability and Prediction of Graph Neural Networks","created":"2024-07-16","cited_by_count":0,"area":null},{"id":"2608.12514","title":"Exploring Oversmoothing with Householder Matrices","created":"2026-08-12","cited_by_count":0,"area":null}],"next_cursor":null}