{"task":"Node Classification","dataset":"Wiki-CS","metric_names":["Accuracy"],"rows":[{"id":97850,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"CGT","metrics":{"Accuracy":"84.61±0.53"},"paper_url":"https://arxiv.org/abs/2312.16788v1","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","paper_date":"2023-12-28","code_links":[{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97851,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"GraphSAGE","metrics":{"Accuracy":"83.67"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97852,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"HH-GraphSAGE","metrics":{"Accuracy":"82.81"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97853,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"HH-GCN","metrics":{"Accuracy":"82.57"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97854,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"GCN","metrics":{"Accuracy":"81.93"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97855,"task":"Node Classification","parent_task":null,"dataset":"Wiki-CS","model_name":"ScaleNet","metrics":{"Accuracy":"79.3±0.6"},"paper_url":"https://arxiv.org/abs/2411.19392v2","paper_title":"Scale Invariance of Graph Neural Networks","paper_date":"2024-11-28","code_links":[{"title":"qin87/scalenet","url":"https://github.com/qin87/scalenet"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}