{"task":"Node Classification","dataset":"Coauthor Physics","metric_names":["Accuracy"],"rows":[{"id":97750,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"NCSAGE","metrics":{"Accuracy":"98.69 ± 0.26"},"paper_url":"https://arxiv.org/abs/2306.02285v6","paper_title":"Clarify Confused Nodes via Separated Learning","paper_date":"2023-06-04","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97751,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"NCGCN","metrics":{"Accuracy":"98.63 ± 0.24"},"paper_url":"https://arxiv.org/abs/2306.02285v6","paper_title":"Clarify Confused Nodes via Separated Learning","paper_date":"2023-06-04","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97752,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"GCN","metrics":{"Accuracy":"97.46 ± 0.10"},"paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_date":"2024-06-13","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97753,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"3ference","metrics":{"Accuracy":"97.22%"},"paper_url":"https://www.mdpi.com/2227-7390/10/8/1262/htm","paper_title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","paper_date":"2022-04-11","code_links":[{"title":"cf020031308/3ference","url":"https://github.com/cf020031308/3ference"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97754,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"CoLinkDist","metrics":{"Accuracy":"97.05%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97755,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"GNNMoE(GAT-like P)","metrics":{"Accuracy":"97.05±0.19"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97756,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"GNNMoE(GCN-like P)","metrics":{"Accuracy":"97.03±0.13"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97757,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"LinkDistMLP","metrics":{"Accuracy":"96.91%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97758,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"Exphormer","metrics":{"Accuracy":"96.89±0.09%"},"paper_url":"https://arxiv.org/abs/2303.06147v2","paper_title":"Exphormer: Sparse Transformers for Graphs","paper_date":"2023-03-10","code_links":[{"title":"hamed1375/exphormer","url":"https://github.com/hamed1375/exphormer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97759,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"CoLinkDistMLP","metrics":{"Accuracy":"96.87%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97760,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"LinkDist","metrics":{"Accuracy":"96.87%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97761,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"GNNMoE(SAGE-like P)","metrics":{"Accuracy":"96.81±0.22"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97762,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"GraphMix (GCN)","metrics":{"Accuracy":"94.49 ± 0.84"},"paper_url":"https://arxiv.org/abs/1909.11715v3","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_date":"2019-09-25","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97763,"task":"Node Classification","parent_task":null,"dataset":"Coauthor Physics","model_name":"DAGNN (Ours)","metrics":{"Accuracy":"94"},"paper_url":"https://arxiv.org/abs/2007.09296v1","paper_title":"Towards Deeper Graph Neural Networks","paper_date":"2020-07-18","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/dagnn"},{"title":"mengliu1998/DeeperGNN","url":"https://github.com/mengliu1998/DeeperGNN"},{"title":"divelab/DeeperGNN","url":"https://github.com/divelab/DeeperGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}