{"task":"Node Classification","dataset":"Wisconsin","metric_names":["Accuracy"],"rows":[{"id":96109,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"5-HiGCN","metrics":{"Accuracy":"94.99±0.65"},"paper_url":"https://arxiv.org/abs/2309.12971v2","paper_title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","paper_date":"2023-09-22","code_links":[{"title":"yiminghh/higcn","url":"https://github.com/yiminghh/higcn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96110,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"RDGNN-I","metrics":{"Accuracy":"93.72 ± 4.59"},"paper_url":"https://arxiv.org/abs/2406.10871v1","paper_title":"Graph Neural Reaction Diffusion Models","paper_date":"2024-06-16","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96111,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"DJ-GNN","metrics":{"Accuracy":"\t92.54±3.70"},"paper_url":"https://arxiv.org/abs/2306.16976v1","paper_title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","paper_date":"2023-06-29","code_links":[{"title":"AhmedBegggaUA/TFM","url":"https://github.com/AhmedBegggaUA/TFM"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96112,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"H2GCN-RARE (λ=1.0)","metrics":{"Accuracy":"90.00±2.97"},"paper_url":"https://arxiv.org/abs/2312.09708v2","paper_title":"GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy","paper_date":"2023-12-15","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96113,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"O(d)-NSD","metrics":{"Accuracy":"89.41 ± 4.74"},"paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","paper_date":"2022-02-09","code_links":[{"title":"twitter-research/neural-sheaf-diffusion","url":"https://github.com/twitter-research/neural-sheaf-diffusion"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96114,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Gen-NSD","metrics":{"Accuracy":"89.21 ± 3.84"},"paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","paper_date":"2022-02-09","code_links":[{"title":"twitter-research/neural-sheaf-diffusion","url":"https://github.com/twitter-research/neural-sheaf-diffusion"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96115,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"M2M-GNN","metrics":{"Accuracy":"89.01 ± 4.1"},"paper_url":"https://arxiv.org/abs/2405.20652v1","paper_title":"Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs","paper_date":"2024-05-31","code_links":[{"title":"Jinx-byebye/m2mgnn","url":"https://github.com/Jinx-byebye/m2mgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96116,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"HDP","metrics":{"Accuracy":"88.82 ± 3.40"},"paper_url":"https://arxiv.org/abs/2405.20640v1","paper_title":"Heterophilous Distribution Propagation for Graph Neural Networks","paper_date":"2024-05-31","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96117,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"MGNN + Hetero-S (6 layers)","metrics":{"Accuracy":"88.77"},"paper_url":"https://arxiv.org/abs/2406.12539v1","paper_title":"The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs","paper_date":"2024-06-18","code_links":[{"title":"bingreeky/heterosnoh","url":"https://github.com/bingreeky/heterosnoh"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96118,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Conn-NSD","metrics":{"Accuracy":"88.73±4.47"},"paper_url":"https://arxiv.org/abs/2206.08702v1","paper_title":"Sheaf Neural Networks with Connection Laplacians","paper_date":"2022-06-17","code_links":[{"title":"antoniopurificato/sheaf4rec","url":"https://github.com/antoniopurificato/sheaf4rec"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96119,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Diag-NSD","metrics":{"Accuracy":"88.63 ± 2.75"},"paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","paper_date":"2022-02-09","code_links":[{"title":"twitter-research/neural-sheaf-diffusion","url":"https://github.com/twitter-research/neural-sheaf-diffusion"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96120,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"SADE-GCN","metrics":{"Accuracy":"88.63±4.54"},"paper_url":"https://arxiv.org/abs/2305.18385v2","paper_title":"Self-attention Dual Embedding for Graphs with Heterophily","paper_date":"2023-05-28","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96121,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"FSGNN (3-hop)","metrics":{"Accuracy":"88.43±3.22"},"paper_url":"https://arxiv.org/abs/2105.07634v1","paper_title":"Improving Graph Neural Networks with Simple Architecture Design","paper_date":"2021-05-17","code_links":[{"title":"sunilkmaurya/FSGNN","url":"https://github.com/sunilkmaurya/FSGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96122,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACM-GCN","metrics":{"Accuracy":"88.43 ± 3.22"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96123,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACM-GCN+","metrics":{"Accuracy":"88.43 ± 2.39"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96124,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACMII-GCN++","metrics":{"Accuracy":"88.43 ± 3.66"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96125,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"LHS","metrics":{"Accuracy":"88.32±2.3"},"paper_url":"https://arxiv.org/abs/2312.16418v1","paper_title":"Refining Latent Homophilic Structures over Heterophilic Graphs for Robust Graph Convolution Networks","paper_date":"2023-12-27","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96126,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACM-GCN++","metrics":{"Accuracy":"88.24 ± 3.16"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96127,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GloGNN++","metrics":{"Accuracy":"88.04±3.22"},"paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","paper_date":"2022-05-15","code_links":[{"title":"recklessronan/glognn","url":"https://github.com/recklessronan/glognn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96128,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACMII-GCN+","metrics":{"Accuracy":"88.04 ± 3.66"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96129,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Ordered GNN","metrics":{"Accuracy":"88.04±3.63"},"paper_url":"https://arxiv.org/abs/2302.01524v1","paper_title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","paper_date":"2023-02-03","code_links":[{"title":"lumia-group/orderedgnn","url":"https://github.com/lumia-group/orderedgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96130,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"UniG-Encoder","metrics":{"Accuracy":"88.03±4.42"},"paper_url":"https://arxiv.org/abs/2308.01650v1","paper_title":"UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification","paper_date":"2023-08-03","code_links":[{"title":"minhzou/unig-encoder","url":"https://github.com/minhzou/unig-encoder"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96131,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"CoED","metrics":{"Accuracy":"87.84±3.70"},"paper_url":"https://arxiv.org/abs/2410.14109v1","paper_title":"Improving Graph Neural Networks by Learning Continuous Edge Directions","paper_date":"2024-10-18","code_links":[{"title":"hormoz-lab/coed-gnn","url":"https://github.com/hormoz-lab/coed-gnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96132,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"H2GCN + UniGAP","metrics":{"Accuracy":"87.73 ± 4.8"},"paper_url":"https://arxiv.org/abs/2407.19420v1","paper_title":"UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks","paper_date":"2024-07-28","code_links":[{"title":"wangxiaotang0906/unigap","url":"https://github.com/wangxiaotang0906/unigap"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96133,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GRADE-GAT","metrics":{"Accuracy":"87.7±3.7"},"paper_url":"https://arxiv.org/abs/2403.20221v1","paper_title":"Graph Neural Aggregation-diffusion with Metastability","paper_date":"2024-03-29","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96134,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GCNH","metrics":{"Accuracy":"\t87.65±3.59"},"paper_url":"https://arxiv.org/abs/2304.10896v1","paper_title":"GCNH: A Simple Method For Representation Learning On Heterophilous Graphs","paper_date":"2023-04-21","code_links":[{"title":"smartdata-polito/gcnh","url":"https://github.com/smartdata-polito/gcnh"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96135,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"UDGNN (GCN)","metrics":{"Accuracy":"87.64±3.74"},"paper_url":"https://arxiv.org/abs/2205.15127v1","paper_title":"Universal Deep GNNs: Rethinking Residual Connection in GNNs from a Path Decomposition Perspective for Preventing the Over-smoothing","paper_date":"2022-05-30","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96136,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACMII-GCN","metrics":{"Accuracy":"87.45 ± 3.74"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96137,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"TE-GCNN","metrics":{"Accuracy":"87.45 ± 3.70"},"paper_url":"https://arxiv.org/abs/2406.06632v1","paper_title":"Transfer Entropy in Graph Convolutional Neural Networks","paper_date":"2024-06-08","code_links":[{"title":"avmoldovan/Heterophily_and_oversmoothing-forked","url":"https://github.com/avmoldovan/Heterophily_and_oversmoothing-forked"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96138,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"NLMLP ","metrics":{"Accuracy":"87.3 ± 4.3"},"paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","paper_date":"2020-05-29","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96139,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GloGNN","metrics":{"Accuracy":"87.06±3.53"},"paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","paper_date":"2022-05-15","code_links":[{"title":"recklessronan/glognn","url":"https://github.com/recklessronan/glognn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96140,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"WRGAT","metrics":{"Accuracy":"86.98 ± 3.78"},"paper_url":"https://arxiv.org/abs/2101.00797v1","paper_title":"Beyond Low-frequency Information in Graph Convolutional Networks","paper_date":"2021-01-04","code_links":[{"title":"bdy9527/FAGCN","url":"https://github.com/bdy9527/FAGCN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96141,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"LW-GCN","metrics":{"Accuracy":"86.9±2.2"},"paper_url":"https://arxiv.org/abs/2110.08128v4","paper_title":"Label-Wise Graph Convolutional Network for Heterophilic Graphs","paper_date":"2021-10-15","code_links":[{"title":"enyandai/lwgcn","url":"https://github.com/enyandai/lwgcn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96142,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GGCN","metrics":{"Accuracy":"86.86 ± 3.29"},"paper_url":"https://arxiv.org/abs/2102.06462v8","paper_title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","paper_date":"2021-02-12","code_links":[{"title":"yujun-yan/heterophily_and_oversmoothing","url":"https://github.com/yujun-yan/heterophily_and_oversmoothing"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96143,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"HLP Concat","metrics":{"Accuracy":"86.67±4.22"},"paper_url":"https://arxiv.org/abs/2106.12807v1","paper_title":"Simple Truncated SVD based Model for Node Classification on Heterophilic Graphs","paper_date":"2021-06-24","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96144,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"CNMPGNN","metrics":{"Accuracy":"86.63 ± 3.57"},"paper_url":"https://ieeexplore.ieee.org/document/9606682","paper_title":"CN-Motifs Perceptive Graph Neural Networks","paper_date":"2021-11-15","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96145,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACM-SGC-1","metrics":{"Accuracy":"86.47 ± 3.77"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96146,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ACM-SGC-2","metrics":{"Accuracy":"86.47 ± 3.77"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96147,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"FDGATII","metrics":{"Accuracy":"86.2745"},"paper_url":"https://arxiv.org/abs/2110.11464v2","paper_title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","paper_date":"2021-10-21","code_links":[{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96148,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"MbaGCN","metrics":{"Accuracy":"86.27±2.16 "},"paper_url":"https://arxiv.org/abs/2501.15461v2","paper_title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","paper_date":"2025-01-26","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96149,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"HiGNN","metrics":{"Accuracy":"85.88 ± 3.18"},"paper_url":"https://arxiv.org/abs/2403.17351v2","paper_title":"Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Network","paper_date":"2024-03-26","code_links":[{"title":"zylMozart/HiGNN","url":"https://github.com/zylMozart/HiGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96150,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"CATv3-sup","metrics":{"Accuracy":"85.6±2.1"},"paper_url":"https://arxiv.org/abs/2312.08672v3","paper_title":"CAT: A Causally Graph Attention Network for Trimming Heterophilic Graph","paper_date":"2023-12-14","code_links":[{"title":"geox-lab/cat","url":"https://github.com/geox-lab/cat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96151,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"TDGNN-w","metrics":{"Accuracy":"85.57 ± 3.78 (0, 3-5)"},"paper_url":"https://arxiv.org/abs/2108.11022v1","paper_title":"Tree Decomposed Graph Neural Network","paper_date":"2021-08-25","code_links":[{"title":"YuWVandy/TDGNN","url":"https://github.com/YuWVandy/TDGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96152,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"H2GCN DHGR","metrics":{"Accuracy":"85.01±5.51"},"paper_url":"https://arxiv.org/abs/2209.08264v1","paper_title":"Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach","paper_date":"2022-09-17","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96153,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"H2GCN-1","metrics":{"Accuracy":"84.31 ± 3.70"},"paper_url":"https://arxiv.org/abs/2006.11468v2","paper_title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","paper_date":"2020-06-20","code_links":[{"title":"GemsLab/H2GCN","url":"https://github.com/GemsLab/H2GCN"},{"title":"GitEventhandler/H2GCN-PyTorch","url":"https://github.com/GitEventhandler/H2GCN-PyTorch"},{"title":"sxwee/GNNsIMPL","url":"https://github.com/sxwee/GNNsIMPL/tree/main/H2GCN"},{"title":"kdd-submitter/on_local_aggregation","url":"https://github.com/kdd-submitter/on_local_aggregation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96154,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Graph ESN","metrics":{"Accuracy":"83.3±3.8"},"paper_url":"https://arxiv.org/abs/2210.15731v1","paper_title":"Beyond Homophily with Graph Echo State Networks","paper_date":"2022-10-27","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96155,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"H2GCN-2","metrics":{"Accuracy":"83.14 ± 4.26"},"paper_url":"https://arxiv.org/abs/2006.11468v2","paper_title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","paper_date":"2020-06-20","code_links":[{"title":"GemsLab/H2GCN","url":"https://github.com/GemsLab/H2GCN"},{"title":"GitEventhandler/H2GCN-PyTorch","url":"https://github.com/GitEventhandler/H2GCN-PyTorch"},{"title":"sxwee/GNNsIMPL","url":"https://github.com/sxwee/GNNsIMPL/tree/main/H2GCN"},{"title":"kdd-submitter/on_local_aggregation","url":"https://github.com/kdd-submitter/on_local_aggregation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96156,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GPRGCN","metrics":{"Accuracy":"82.55 ± 6.23"},"paper_url":"https://arxiv.org/abs/2006.07988v6","paper_title":"Adaptive Universal Generalized PageRank Graph Neural Network","paper_date":"2020-06-14","code_links":[{"title":"jianhao2016/GPRGNN","url":"https://github.com/jianhao2016/GPRGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96157,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"UGT","metrics":{"Accuracy":"81.6 ±8.24"},"paper_url":"https://arxiv.org/abs/2308.09517v1","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","paper_date":"2023-08-18","code_links":[{"title":"nslab-cuk/unified-graph-transformer","url":"https://github.com/nslab-cuk/unified-graph-transformer"},{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"},{"title":"nslab-cuk/literalkg","url":"https://github.com/nslab-cuk/literalkg"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96158,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"ADPA","metrics":{"Accuracy":"81.6±3.5"},"paper_url":"https://arxiv.org/abs/2312.04111v2","paper_title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","paper_date":"2023-12-07","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96159,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"GCNII","metrics":{"Accuracy":"80.39 ± 3.40"},"paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","paper_date":"2020-07-04","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96160,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"DeltaGNN linear","metrics":{"Accuracy":"80.00±0.88"},"paper_url":"https://arxiv.org/abs/2501.06002v1","paper_title":"DeltaGNN: Graph Neural Network with Information Flow Control","paper_date":"2025-01-10","code_links":[{"title":"basiralab/deltagnn","url":"https://github.com/basiralab/deltagnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96161,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"FAGCN","metrics":{"Accuracy":"79.61 ± 1.58"},"paper_url":"https://arxiv.org/abs/2101.00797v1","paper_title":"Beyond Low-frequency Information in Graph Convolutional Networks","paper_date":"2021-01-04","code_links":[{"title":"bdy9527/FAGCN","url":"https://github.com/bdy9527/FAGCN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96162,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"CT-Layer","metrics":{"Accuracy":"79.05"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96163,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"MixHop","metrics":{"Accuracy":"75.88 ± 4.90"},"paper_url":"https://arxiv.org/abs/1905.00067v3","paper_title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","paper_date":"2019-04-30","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/mixhop"},{"title":"benedekrozemberczki/MixHop-and-N-GCN","url":"https://github.com/benedekrozemberczki/MixHop-and-N-GCN"},{"title":"samihaija/mixhop","url":"https://github.com/samihaija/mixhop"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96164,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"LINKX","metrics":{"Accuracy":"75.49 ± 5.72"},"paper_url":"https://arxiv.org/abs/2110.14446v1","paper_title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","paper_date":"2021-10-27","code_links":[{"title":"cuai/non-homophily-large-scale","url":"https://github.com/cuai/non-homophily-large-scale"},{"title":"CUAI/Non-Homophily-Benchmarks","url":"https://github.com/CUAI/Non-Homophily-Benchmarks"},{"title":"ivam-he/chebnetii","url":"https://github.com/ivam-he/chebnetii"},{"title":"kkhuang81/UniFilter","url":"https://github.com/kkhuang81/UniFilter"},{"title":"kkhuang81/AdaptKry","url":"https://github.com/kkhuang81/AdaptKry"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96165,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"CT-Layer (PE)","metrics":{"Accuracy":"69.25"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96166,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Geom-GCN-P","metrics":{"Accuracy":"64.12"},"paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_date":"2020-02-13","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96167,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"NLGCN ","metrics":{"Accuracy":"60.2 ± 5.3"},"paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","paper_date":"2020-05-29","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96168,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Geom-GCN-I","metrics":{"Accuracy":"58.24"},"paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_date":"2020-02-13","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96169,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"NLGAT ","metrics":{"Accuracy":"56.9 ± 7.3"},"paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","paper_date":"2020-05-29","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96170,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"Geom-GCN-S","metrics":{"Accuracy":"56.67"},"paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_date":"2020-02-13","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96171,"task":"Node Classification","parent_task":null,"dataset":"Wisconsin","model_name":"SDRF","metrics":{"Accuracy":"55.51±0.27"},"paper_url":"https://arxiv.org/abs/2111.14522v3","paper_title":"Understanding over-squashing and bottlenecks on graphs via curvature","paper_date":"2021-11-29","code_links":[{"title":"jctops/understanding-oversquashing","url":"https://github.com/jctops/understanding-oversquashing"},{"title":"josephjwilson/cayley_graph_propagation","url":"https://github.com/josephjwilson/cayley_graph_propagation"},{"title":"harel147/REFine","url":"https://github.com/harel147/REFine"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}