{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/node-classification-on-non-homophilic","name":"Node Classification on Non-Homophilic (Heterophilic) Graphs","slug":"node-classification-on-non-homophilic","description_markdown":"There exists a non-trivial set of graphs where graph-aware models underperform their corresponding graph-agnostic models, e.g. SGC and GCN underperform MLP with 1 layer and 2 layers. Although still controversial, people believe the performance degradation results from heterophily, i.e. there exist much more inter-class edges than inner-class edges. This task aims to evaluate models designed for non-homophilic (heterophilic) datasets.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":29,"papers_with_code":29,"benchmarks":15,"benchmark_tables_in_archive":15,"benchmark_tables_shown":15,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":15,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/node-classification-on-non-homophilic","slug":"node-classification-on-non-homophilic","dataset":"Cornell (60%/20%/20% random splits)","dataset_url":"/dataset/cornell-60-20-20-random-splits","rows_in_archive":33,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACMII-GCN","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-1","slug":"node-classification-on-non-homophilic-1","dataset":"Wisconsin(60%/20%/20% random splits)","dataset_url":"/dataset/wisconsin-60-20-20-random-splits-1","rows_in_archive":32,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-2","slug":"node-classification-on-non-homophilic-2","dataset":"Texas(60%/20%/20% random splits)","dataset_url":"/dataset/texas-60-20-20-random-splits-1","rows_in_archive":32,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-4","slug":"node-classification-on-non-homophilic-4","dataset":"Chameleon(60%/20%/20% random splits)","dataset_url":"/dataset/chameleon-60-20-20-random-splits-1","rows_in_archive":32,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN+","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-11","slug":"node-classification-on-non-homophilic-11","dataset":"Chameleon (48%/32%/20% fixed splits)","dataset_url":"/dataset/chameleon-48-32-20-fixed-splits","rows_in_archive":29,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ScaleNet","paper_title":"Scale Invariance of Graph Neural Networks","paper_url":"/paper/scale-invariance-of-graph-neural-networks","paper_date":"2024-11-28","arxiv_id":"2411.19392","code_links":[{"title":"qin87/scalenet","url":"https://github.com/qin87/scalenet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-non-homophilic-12","slug":"node-classification-on-non-homophilic-12","dataset":"Squirrel (48%/32%/20% fixed splits)","dataset_url":"/dataset/squirrel-48-32-20-fixed-splits","rows_in_archive":29,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ScaleNet","paper_title":"Scale Invariance of Graph Neural Networks","paper_url":"/paper/scale-invariance-of-graph-neural-networks","paper_date":"2024-11-28","arxiv_id":"2411.19392","code_links":[{"title":"qin87/scalenet","url":"https://github.com/qin87/scalenet"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-non-homophilic-13","slug":"node-classification-on-non-homophilic-13","dataset":"Penn94","dataset_url":"/dataset/penn94","rows_in_archive":28,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","slug":"node-classification-on-non-homophilic-6","dataset":"Deezer-Europe","dataset_url":"/dataset/deezer-europe-1","rows_in_archive":28,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACMII-GCN+++","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-7","slug":"node-classification-on-non-homophilic-7","dataset":"Cornell (48%/32%/20% fixed splits)","dataset_url":"/dataset/cornell-48-32-20-fixed-splits","rows_in_archive":27,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"Diag-NSD","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","paper_url":"/paper/neural-sheaf-diffusion-a-topological","paper_date":"2022-02-09","arxiv_id":"2202.04579","code_links":[{"title":"twitter-research/neural-sheaf-diffusion","url":"https://github.com/twitter-research/neural-sheaf-diffusion"}],"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/neural-sheaf-diffusion-a-topological#ran","syntology_url":"https://syntology.ai/paper/2202.04579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04579"}},"official":{"repos":["twitter-research/neural-sheaf-diffusion"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-10","slug":"node-classification-on-non-homophilic-10","dataset":"Film(48%/32%/20% fixed splits)","dataset_url":"/dataset/film-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"NLMLP","paper_title":"Non-Local Graph Neural Networks","paper_url":"/paper/non-local-graph-neural-networks","paper_date":"2020-05-29","arxiv_id":"2005.14612","code_links":[{"title":"divelab/Non-Local-GNN","url":"https://github.com/divelab/Non-Local-GNN"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/non-local-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.14612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14612"}},"official":{"repos":["divelab/Non-Local-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-14","slug":"node-classification-on-non-homophilic-14","dataset":"genius","dataset_url":"/dataset/genius","rows_in_archive":26,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ClenshawGCN","paper_title":"Clenshaw Graph Neural Networks","paper_url":"/paper/clenshaw-graph-neural-networks","paper_date":"2022-10-29","arxiv_id":"2210.16508","code_links":[{"title":"yuziGuo/ClenshawGNN","url":"https://github.com/yuziGuo/ClenshawGNN"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-non-homophilic-15","slug":"node-classification-on-non-homophilic-15","dataset":"twitch-gamers","dataset_url":"/dataset/twitch-gamers","rows_in_archive":26,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"GESN","paper_title":"Addressing Heterophily in Node Classification with Graph Echo State Networks","paper_url":"/paper/addressing-heterophily-in-node-classification","paper_date":"2023-05-14","arxiv_id":"2305.08233","code_links":[{"title":"dtortorella/addressing-heterophily-gesn","url":"https://github.com/dtortorella/addressing-heterophily-gesn"}],"syntology":null}},{"leaderboard":"/sota/node-classification-on-non-homophilic-8","slug":"node-classification-on-non-homophilic-8","dataset":"Wisconsin (48%/32%/20% fixed splits)","dataset_url":"/dataset/wisconsin-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"O(d)-NSD","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","paper_url":"/paper/neural-sheaf-diffusion-a-topological","paper_date":"2022-02-09","arxiv_id":"2202.04579","code_links":[{"title":"twitter-research/neural-sheaf-diffusion","url":"https://github.com/twitter-research/neural-sheaf-diffusion"}],"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/neural-sheaf-diffusion-a-topological#ran","syntology_url":"https://syntology.ai/paper/2202.04579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04579"}},"official":{"repos":["twitter-research/neural-sheaf-diffusion"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-9","slug":"node-classification-on-non-homophilic-9","dataset":"Texas (48%/32%/20% fixed splits)","dataset_url":"/dataset/texas-48-32-20-fixed-splits","rows_in_archive":26,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN+","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_url":"/paper/revisiting-heterophily-for-graph-neural","paper_date":"2022-10-14","arxiv_id":"2210.07606","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/node-classification-on-non-homophilic-16","slug":"node-classification-on-non-homophilic-16","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["F1-Score","NMI"],"first_row_in_archive_order":{"model":"GAT","paper_title":"Graph Attention Networks","paper_url":"/paper/graph-attention-networks","paper_date":"2017-10-30","arxiv_id":"1710.10903","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}],"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}}],"datasets":[{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/penn94","name":"Penn94","full_name":"","num_papers_in_archive":60},{"url":"/dataset/genius","name":"genius","full_name":"","num_papers_in_archive":37},{"url":"/dataset/twitch-gamers","name":"twitch-gamers","full_name":"","num_papers_in_archive":24},{"url":"/dataset/chameleon-48-32-20-fixed-splits","name":"Chameleon (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":20},{"url":"/dataset/deezer-europe-1","name":"Deezer-Europe","full_name":"","num_papers_in_archive":19},{"url":"/dataset/squirrel-48-32-20-fixed-splits","name":"Squirrel (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":19},{"url":"/dataset/wisconsin-60-20-20-random-splits-1","name":"Wisconsin(60%/20%/20% random splits)","full_name":"","num_papers_in_archive":18},{"url":"/dataset/chameleon-60-20-20-random-splits-1","name":"Chameleon(60%/20%/20% random splits)","full_name":"","num_papers_in_archive":17},{"url":"/dataset/cornell-48-32-20-fixed-splits","name":"Cornell (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/cornell-60-20-20-random-splits","name":"Cornell (60%/20%/20% random splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/texas-60-20-20-random-splits-1","name":"Texas(60%/20%/20% random splits)","full_name":"","num_papers_in_archive":16},{"url":"/dataset/wisconsin-48-32-20-fixed-splits","name":"Wisconsin (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":15},{"url":"/dataset/film-48-32-20-fixed-splits","name":"Film(48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14},{"url":"/dataset/texas-48-32-20-fixed-splits","name":"Texas (48%/32%/20% fixed splits)","full_name":"","num_papers_in_archive":14}],"subtasks":[],"parent_tasks":[{"url":"/task/node-classification","name":"Node Classification"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":29,"of":29,"of_with_code":29,"tagged_in_all":29,"counts":{"archive_papers_tagged":29,"with_a_code_link":29,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":29,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/combining-label-propagation-and-simple-models-1","slug":"combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.13993","repositories_listed":7,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combining-label-propagation-and-simple-models-1#ran","syntology_url":"https://syntology.ai/paper/2010.13993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13993"}},"official":{"repos":["CUAI/CorrectAndSmooth"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simplifying-graph-convolutional-networks","slug":"simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","arxiv_id":"1902.07153","repositories_listed":7,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplifying-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1902.07153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07153"}},"official":{"repos":["Tiiiger/SGC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-learning-on-non-homophilous","slug":"large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":15,"n_constructed":5,"n_ran_checked":10,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/large-scale-learning-on-non-homophilous#ran","syntology_url":"https://syntology.ai/paper/2110.14446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14446"}},"official":{"repos":["cuai/non-homophily-large-scale"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/predict-then-propagate-graph-neural-networks","slug":"predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","arxiv_id":"1810.05997","repositories_listed":5,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predict-then-propagate-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05997"}},"official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}},"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/generalizing-graph-neural-networks-beyond","slug":"generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","arxiv_id":"2006.11468","repositories_listed":4,"syntology":{"n":21,"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_honours":4,"n_violates":2,"n_no_contract":7,"n_pointer_only":13,"phrase":"16 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/generalizing-graph-neural-networks-beyond#ran","syntology_url":"https://syntology.ai/paper/2006.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11468"}},"official":{"repos":["GemsLab/H2GCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/geom-gcn-geometric-graph-convolutional-1","slug":"geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","arxiv_id":"2002.05287","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}},"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mixhop-higher-order-graph-convolution","slug":"mixhop-higher-order-graph-convolution","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","date":"2019-04-30","arxiv_id":"1905.00067","repositories_listed":3,"syntology":null},{"url":"/paper/scale-invariance-of-graph-neural-networks","slug":"scale-invariance-of-graph-neural-networks","title":"Scale Invariance of Graph Neural Networks","date":"2024-11-28","arxiv_id":"2411.19392","repositories_listed":1,"syntology":null},{"url":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}},"official":{"repos":["emalgorithm/directed-graph-neural-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-heterophily-in-node-classification","slug":"addressing-heterophily-in-node-classification","title":"Addressing Heterophily in Node Classification with Graph Echo State Networks","date":"2023-05-14","arxiv_id":"2305.08233","repositories_listed":1,"syntology":null},{"url":"/paper/gcnh-a-simple-method-for-representation","slug":"gcnh-a-simple-method-for-representation","title":"GCNH: A Simple Method For Representation Learning On Heterophilous Graphs","date":"2023-04-21","arxiv_id":"2304.10896","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-learnable-and","slug":"graph-neural-networks-with-learnable-and","title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","date":"2023-02-24","arxiv_id":"2302.12432","repositories_listed":1,"syntology":null},{"url":"/paper/clenshaw-graph-neural-networks","slug":"clenshaw-graph-neural-networks","title":"Clenshaw Graph Neural Networks","date":"2022-10-29","arxiv_id":"2210.16508","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-heterophily-for-graph-neural","slug":"revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","arxiv_id":"2210.07606","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/finding-global-homophily-in-graph-neural","slug":"finding-global-homophily-in-graph-neural","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","date":"2022-05-15","arxiv_id":"2205.07308","repositories_listed":1,"syntology":null},{"url":"/paper/neural-sheaf-diffusion-a-topological","slug":"neural-sheaf-diffusion-a-topological","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","date":"2022-02-09","arxiv_id":"2202.04579","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/neural-sheaf-diffusion-a-topological#ran","syntology_url":"https://syntology.ai/paper/2202.04579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04579"}},"official":{"repos":["twitter-research/neural-sheaf-diffusion"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/deformable-graph-convolutional-networks","slug":"deformable-graph-convolutional-networks","title":"Deformable Graph Convolutional Networks","date":"2021-12-29","arxiv_id":"2112.14438","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deformable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2112.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14438"}},"official":{"repos":["mlvlab/DeformableGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bernnet-learning-arbitrary-graph-spectral","slug":"bernnet-learning-arbitrary-graph-spectral","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","date":"2021-06-21","arxiv_id":"2106.10994","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/bernnet-learning-arbitrary-graph-spectral#ran","syntology_url":"https://syntology.ai/paper/2106.10994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10994"}},"official":{"repos":["ivam-he/BernNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/breaking-the-limit-of-graph-neural-networks","slug":"breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","arxiv_id":"2106.06586","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/breaking-the-limit-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.06586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06586"}},"official":{"repos":["susheels/gnns-and-local-assortativity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/new-benchmarks-for-learning-on-non","slug":"new-benchmarks-for-learning-on-non","title":"New Benchmarks for Learning on Non-Homophilous Graphs","date":"2021-04-03","arxiv_id":"2104.01404","repositories_listed":1,"syntology":null},{"url":"/paper/two-sides-of-the-same-coin-heterophily-and","slug":"two-sides-of-the-same-coin-heterophily-and","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","date":"2021-02-12","arxiv_id":"2102.06462","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-low-frequency-information-in-graph","slug":"beyond-low-frequency-information-in-graph","title":"Beyond Low-frequency Information in Graph Convolutional Networks","date":"2021-01-04","arxiv_id":"2101.00797","repositories_listed":1,"syntology":null},{"url":"/paper/joint-adaptive-feature-smoothing-and-topology","slug":"joint-adaptive-feature-smoothing-and-topology","title":"Adaptive Universal Generalized PageRank Graph Neural Network","date":"2020-06-14","arxiv_id":"2006.07988","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/joint-adaptive-feature-smoothing-and-topology#ran","syntology_url":"https://syntology.ai/paper/2006.07988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07988"}},"official":{"repos":["jianhao2016/GPRGNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/non-local-graph-neural-networks","slug":"non-local-graph-neural-networks","title":"Non-Local Graph Neural Networks","date":"2020-05-29","arxiv_id":"2005.14612","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/non-local-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.14612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14612"}},"official":{"repos":["divelab/Non-Local-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/break-the-ceiling-stronger-multi-scale-deep","slug":"break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","arxiv_id":"1906.02174","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/break-the-ceiling-stronger-multi-scale-deep#ran","syntology_url":"https://syntology.ai/paper/1906.02174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02174"}},"official":{"repos":["PwnerHarry/Stronger_GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}}],"syntology_records":19,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":16,"papers_where_code_ran_first_page":"/task/node-classification-on-non-homophilic/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/node-classification-on-non-homophilic/papers/ran/1","json":"/task/node-classification-on-non-homophilic/papers/ran/1.json","rows":16}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"11c473f7f1970971b9677e1896b90c264cd442b33a3c7872968713f1b2fc31e4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}