{"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":"/sota/node-classification-on-texas","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Texas","url":"/dataset/webkb"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**Node Classification** is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.\r\n\r\n**Node Classification** models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like [Cora](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":62,"rows_with_code":48,"rows_with_paper_page":62,"rows_dated":62,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"RDGNN-S","metrics":{"Accuracy":"94.59 ± 5.97"},"uses_additional_data":false,"paper_date":"2024-06-16","paper":"/paper/graph-neural-reaction-diffusion-models","paper_url":"https://arxiv.org/abs/2406.10871v1","paper_title":"Graph Neural Reaction Diffusion Models","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"RDGNN-I","metrics":{"Accuracy":"93.51 ± 5.93"},"uses_additional_data":false,"paper_date":"2024-06-16","paper":"/paper/graph-neural-reaction-diffusion-models","paper_url":"https://arxiv.org/abs/2406.10871v1","paper_title":"Graph Neural Reaction Diffusion Models","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"MGNN + Hetero-S (8 layers)","metrics":{"Accuracy":"93.09"},"uses_additional_data":false,"paper_date":"2024-06-18","paper":"/paper/the-heterophilic-snowflake-hypothesis","paper_url":"https://arxiv.org/abs/2406.12539v1","paper_title":"The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs","code":"https://github.com/bingreeky/heterosnoh","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":4,"model":"2-HiGCN","metrics":{"Accuracy":"92.45±0.73"},"uses_additional_data":false,"paper_date":"2023-09-22","paper":"/paper/higher-order-graph-convolutional-network-with","paper_url":"https://arxiv.org/abs/2309.12971v2","paper_title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","code":"https://github.com/yiminghh/higcn","n_code_links":1,"official":{"repos":["yiminghh/higcn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/higher-order-graph-convolutional-network-with#ran","syntology_url":"https://syntology.ai/paper/2309.12971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12971"}}}},{"rank_in_archive_order":5,"model":"DJ-GNN","metrics":{"Accuracy":"92.43±3.15"},"uses_additional_data":false,"paper_date":"2023-06-29","paper":"/paper/diffusion-jump-gnns-homophiliation-via","paper_url":"https://arxiv.org/abs/2306.16976v1","paper_title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","code":"https://github.com/AhmedBegggaUA/TFM","n_code_links":1,"official":{"repos":["AhmedBegggaUA/TFM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/diffusion-jump-gnns-homophiliation-via#ran","syntology_url":"https://syntology.ai/paper/2306.16976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16976"}}}},{"rank_in_archive_order":6,"model":"M2M-GNN","metrics":{"Accuracy":"89.19 ± 4.5"},"uses_additional_data":false,"paper_date":"2024-05-31","paper":"/paper/sign-is-not-a-remedy-multiset-to-multiset","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","code":"https://github.com/Jinx-byebye/m2mgnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":7,"model":"ACM-GCN+","metrics":{"Accuracy":"88.38 ± 3.64"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":8,"model":"ACM-GCN++","metrics":{"Accuracy":"88.38 ±  3.43"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":9,"model":"ACMII-GCN++","metrics":{"Accuracy":"88.38 ± 3.43"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":10,"model":"GRADE-GAT","metrics":{"Accuracy":"88.3±3.5"},"uses_additional_data":false,"paper_date":"2024-03-29","paper":"/paper/graph-neural-aggregation-diffusion-with","paper_url":"https://arxiv.org/abs/2403.20221v1","paper_title":"Graph Neural Aggregation-diffusion with Metastability","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"ACMII-GCN+","metrics":{"Accuracy":"88.11 ± 3.24"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":12,"model":"ACM-GCN","metrics":{"Accuracy":"87.84 ± 4.4"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":13,"model":"GCNH","metrics":{"Accuracy":"87.84±3.87"},"uses_additional_data":false,"paper_date":"2023-04-21","paper":"/paper/gcnh-a-simple-method-for-representation","paper_url":"https://arxiv.org/abs/2304.10896v1","paper_title":"GCNH: A Simple Method For Representation Learning On Heterophilous Graphs","code":"https://github.com/smartdata-polito/gcnh","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"HLP Concat","metrics":{"Accuracy":"87.57 ± 5.44"},"uses_additional_data":false,"paper_date":"2021-06-24","paper":"/paper/simple-truncated-svd-based-model-for-node","paper_url":"https://arxiv.org/abs/2106.12807v1","paper_title":"Simple Truncated SVD based Model for Node Classification on Heterophilic Graphs","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":15,"model":"FSGNN","metrics":{"Accuracy":"87.30 ± 5.55"},"uses_additional_data":false,"paper_date":"2021-05-17","paper":"/paper/improving-graph-neural-networks-with-simple","paper_url":"https://arxiv.org/abs/2105.07634v1","paper_title":"Improving Graph Neural Networks with Simple Architecture Design","code":"https://github.com/sunilkmaurya/FSGNN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":16,"model":"ACMII-GCN","metrics":{"Accuracy":"86.76 ± 4.75"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":17,"model":"H2GCN-RARE (λ=1.0)","metrics":{"Accuracy":"86.76±5.80"},"uses_additional_data":false,"paper_date":"2023-12-15","paper":"/paper/graphrare-reinforcement-learning-enhanced","paper_url":"https://arxiv.org/abs/2312.09708v2","paper_title":"GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":18,"model":"UGT","metrics":{"Accuracy":"86.67 ±8.31"},"uses_additional_data":false,"paper_date":"2023-08-18","paper":"/paper/transitivity-preserving-graph-representation","paper_url":"https://arxiv.org/abs/2308.09517v1","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","code":"https://github.com/nslab-cuk/unified-graph-transformer","n_code_links":3,"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_samples":26,"n_pointer_only_licence":0,"sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}}}},{"rank_in_archive_order":19,"model":"GraphSAGE + UniGAP","metrics":{"Accuracy":"86.52 ± 4.8"},"uses_additional_data":false,"paper_date":"2024-07-28","paper":"/paper/unigap-a-universal-and-adaptive-graph","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","code":"https://github.com/wangxiaotang0906/unigap","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":20,"model":"SADE-GCN","metrics":{"Accuracy":"86.49±5.12"},"uses_additional_data":false,"paper_date":"2023-05-28","paper":"/paper/self-attention-dual-embedding-for-graphs-with","paper_url":"https://arxiv.org/abs/2305.18385v2","paper_title":"Self-attention Dual Embedding for Graphs with Heterophily","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":21,"model":"LHS","metrics":{"Accuracy":"86.32±4.5"},"uses_additional_data":false,"paper_date":"2023-12-27","paper":"/paper/refining-latent-homophilic-structures-over","paper_url":"https://arxiv.org/abs/2312.16418v1","paper_title":"Refining Latent Homophilic Structures over Heterophilic Graphs for Robust Graph Convolution Networks","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"Ordered GNN","metrics":{"Accuracy":"86.22±4.12"},"uses_additional_data":false,"paper_date":"2023-02-03","paper":"/paper/ordered-gnn-ordering-message-passing-to-deal","paper_url":"https://arxiv.org/abs/2302.01524v1","paper_title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","code":"https://github.com/lumia-group/orderedgnn","n_code_links":1,"official":{"repos":["lumia-group/orderedgnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":8,"sample_list":"/paper/ordered-gnn-ordering-message-passing-to-deal#ran","syntology_url":"https://syntology.ai/paper/2302.01524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01524"}}}},{"rank_in_archive_order":23,"model":"HiGNN","metrics":{"Accuracy":"86.22 ± 4.67"},"uses_additional_data":false,"paper_date":"2024-03-26","paper":"/paper/learn-from-heterophily-heterophilous","paper_url":"https://arxiv.org/abs/2403.17351v2","paper_title":"Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Network","code":"https://github.com/zylMozart/HiGNN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":24,"model":"Conn-NSD","metrics":{"Accuracy":"86.16±2.24 "},"uses_additional_data":false,"paper_date":"2022-06-17","paper":"/paper/sheaf-neural-networks-with-connection","paper_url":"https://arxiv.org/abs/2206.08702v1","paper_title":"Sheaf Neural Networks with Connection Laplacians","code":"https://github.com/antoniopurificato/sheaf4rec","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":25,"model":"O(d)-NSD","metrics":{"Accuracy":"85.95 ± 5.51"},"uses_additional_data":false,"paper_date":"2022-02-09","paper":"/paper/neural-sheaf-diffusion-a-topological","paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","code":"https://github.com/twitter-research/neural-sheaf-diffusion","n_code_links":1,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":26,"model":"IIE-GNN","metrics":{"Accuracy":"85.84±4.23"},"uses_additional_data":false,"paper_date":"2022-11-20","paper":"/paper/enhancing-intra-class-information-extraction","paper_url":"https://arxiv.org/abs/2211.10990v1","paper_title":"Enhancing Intra-class Information Extraction for Heterophilous Graphs: One Neural Architecture Search Approach","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":27,"model":"CNMPGNN","metrics":{"Accuracy":"85.68±5.28"},"uses_additional_data":false,"paper_date":"2021-11-15","paper":"/paper/cn-motifs-perceptive-graph-neural-networks","paper_url":"https://ieeexplore.ieee.org/document/9606682","paper_title":"CN-Motifs Perceptive Graph Neural Networks","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":28,"model":"Diag-NSD","metrics":{"Accuracy":"85.67 ± 6.95"},"uses_additional_data":false,"paper_date":"2022-02-09","paper":"/paper/neural-sheaf-diffusion-a-topological","paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","code":"https://github.com/twitter-research/neural-sheaf-diffusion","n_code_links":1,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":29,"model":"NLMLP","metrics":{"Accuracy":"85.4 ± 3.8"},"uses_additional_data":false,"paper_date":"2020-05-29","paper":"/paper/non-local-graph-neural-networks","paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","code":"https://github.com/divelab/Non-Local-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"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"}}}},{"rank_in_archive_order":30,"model":"UniG-Encoder","metrics":{"Accuracy":"85.40±5.3"},"uses_additional_data":false,"paper_date":"2023-08-03","paper":"/paper/unig-encoder-a-universal-feature-encoder-for","paper_url":"https://arxiv.org/abs/2308.01650v1","paper_title":"UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification","code":"https://github.com/minhzou/unig-encoder","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":31,"model":"GGCN","metrics":{"Accuracy":"84.86 ± 4.55"},"uses_additional_data":false,"paper_date":"2021-02-12","paper":"/paper/two-sides-of-the-same-coin-heterophily-and","paper_url":"https://arxiv.org/abs/2102.06462v8","paper_title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","code":"https://github.com/yujun-yan/heterophily_and_oversmoothing","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":32,"model":"H2GCN+DHGR","metrics":{"Accuracy":"84.86±5.01"},"uses_additional_data":false,"paper_date":"2022-09-17","paper":"/paper/make-heterophily-graphs-better-fit-gnn-a","paper_url":"https://arxiv.org/abs/2209.08264v1","paper_title":"Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"TE-GCNN","metrics":{"Accuracy":"84.86 ± 4.55"},"uses_additional_data":false,"paper_date":"2024-06-08","paper":"/paper/transfer-entropy-in-graph-convolutional","paper_url":"https://arxiv.org/abs/2406.06632v1","paper_title":"Transfer Entropy in Graph Convolutional Neural Networks","code":"https://github.com/avmoldovan/Heterophily_and_oversmoothing-forked","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"UDGNN (GCN)","metrics":{"Accuracy":"84.60±5.32"},"uses_additional_data":false,"paper_date":"2022-05-30","paper":"/paper/universal-deep-gnns-rethinking-residual","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","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":35,"model":"CoED","metrics":{"Accuracy":"\t84.59±4.53"},"uses_additional_data":false,"paper_date":"2024-10-18","paper":"/paper/improving-graph-neural-networks-by-learning","paper_url":"https://arxiv.org/abs/2410.14109v1","paper_title":"Improving Graph Neural Networks by Learning Continuous Edge Directions","code":"https://github.com/hormoz-lab/coed-gnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":36,"model":"GloGNN","metrics":{"Accuracy":"84.32±4.15"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":37,"model":"Graph ESN","metrics":{"Accuracy":"84.3±4.4"},"uses_additional_data":false,"paper_date":"2022-10-27","paper":"/paper/beyond-homophily-with-graph-echo-state-1","paper_url":"https://arxiv.org/abs/2210.15731v1","paper_title":"Beyond Homophily with Graph Echo State Networks","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":38,"model":"GloGNN++","metrics":{"Accuracy":"84.05±4.90"},"uses_additional_data":false,"paper_date":"2022-05-15","paper":"/paper/finding-global-homophily-in-graph-neural","paper_url":"https://arxiv.org/abs/2205.07308v1","paper_title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","code":"https://github.com/recklessronan/glognn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"ChebNet+Bregman","metrics":{"Accuracy":"84.05 ± 5.47"},"uses_additional_data":false,"paper_date":"2023-09-12","paper":"/paper/bregman-graph-neural-network","paper_url":"https://arxiv.org/abs/2309.06645v1","paper_title":"Bregman Graph Neural Network","code":"https://github.com/jiayuzhai1207/bregmangnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":40,"model":"ADPA","metrics":{"Accuracy":"\t83.8±2.7"},"uses_additional_data":false,"paper_date":"2023-12-07","paper":"/paper/breaking-the-entanglement-of-homophily-and","paper_url":"https://arxiv.org/abs/2312.04111v2","paper_title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":41,"model":"WRGAT","metrics":{"Accuracy":"83.62 ± 5.50"},"uses_additional_data":false,"paper_date":"2021-06-11","paper":"/paper/breaking-the-limit-of-graph-neural-networks","paper_url":"https://arxiv.org/abs/2106.06586v1","paper_title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","code":"https://github.com/susheels/gnns-and-local-assortativity","n_code_links":1,"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"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_samples":12,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":42,"model":"H2GCN-1","metrics":{"Accuracy":"83.24 ± 7.07"},"uses_additional_data":false,"paper_date":"2020-06-20","paper":"/paper/generalizing-graph-neural-networks-beyond","paper_url":"https://arxiv.org/abs/2006.11468v2","paper_title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","code":"https://github.com/GemsLab/H2GCN","n_code_links":4,"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"]},"syntology":{"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_samples":21,"n_pointer_only_licence":13,"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"}}}},{"rank_in_archive_order":43,"model":"TDGNN-w","metrics":{"Accuracy":"83.00 ± 4.50"},"uses_additional_data":false,"paper_date":"2021-08-25","paper":"/paper/tree-decomposed-graph-neural-network","paper_url":"https://arxiv.org/abs/2108.11022v1","paper_title":"Tree Decomposed Graph Neural Network","code":"https://github.com/YuWVandy/TDGNN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":44,"model":"CATv3-sup","metrics":{"Accuracy":"83.0±2.5"},"uses_additional_data":false,"paper_date":"2023-12-14","paper":"/paper/cat-a-causally-graph-attention-network-for","paper_url":"https://arxiv.org/abs/2312.08672v3","paper_title":"CAT: A Causally Graph Attention Network for Trimming Heterophilic Graph","code":"https://github.com/geox-lab/cat","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":45,"model":"Gen-NSD","metrics":{"Accuracy":"82.97 ± 5.13"},"uses_additional_data":false,"paper_date":"2022-02-09","paper":"/paper/neural-sheaf-diffusion-a-topological","paper_url":"https://arxiv.org/abs/2202.04579v4","paper_title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","code":"https://github.com/twitter-research/neural-sheaf-diffusion","n_code_links":1,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":46,"model":"ACM-SGC-1","metrics":{"Accuracy":"81.89 ± 4.53"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":47,"model":"ACM-SGC-2","metrics":{"Accuracy":"81.89 ± 4.53"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/revisiting-heterophily-for-graph-neural","paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","code":"https://github.com/SitaoLuan/ACM-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":48,"model":"GPRGCN","metrics":{"Accuracy":"81.35 ± 5.32"},"uses_additional_data":false,"paper_date":"2020-06-14","paper":"/paper/joint-adaptive-feature-smoothing-and-topology","paper_url":"https://arxiv.org/abs/2006.07988v6","paper_title":"Adaptive Universal Generalized PageRank Graph Neural Network","code":"https://github.com/jianhao2016/GPRGNN","n_code_links":1,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2,"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"}}}},{"rank_in_archive_order":49,"model":"FDGATII","metrics":{"Accuracy":"80.5405"},"uses_additional_data":false,"paper_date":"2021-10-21","paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","paper_url":"https://arxiv.org/abs/2110.11464v2","paper_title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","code":"https://github.com/gayanku/FDGATII","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":50,"model":"H2GCN-2","metrics":{"Accuracy":"80.00 ± 6.77"},"uses_additional_data":false,"paper_date":"2020-06-20","paper":"/paper/generalizing-graph-neural-networks-beyond","paper_url":"https://arxiv.org/abs/2006.11468v2","paper_title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","code":"https://github.com/GemsLab/H2GCN","n_code_links":4,"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"]},"syntology":{"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_samples":21,"n_pointer_only_licence":13,"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"}}}},{"rank_in_archive_order":51,"model":"MixHop","metrics":{"Accuracy":"77.84 ± 7.73"},"uses_additional_data":false,"paper_date":"2019-04-30","paper":"/paper/mixhop-higher-order-graph-convolution","paper_url":"https://arxiv.org/abs/1905.00067v3","paper_title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/mixhop","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":52,"model":"GCNII","metrics":{"Accuracy":"77.57 ± 3.83"},"uses_additional_data":false,"paper_date":"2020-07-04","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","code":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv","n_code_links":4,"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"]},"syntology":{"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":4,"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"}}}},{"rank_in_archive_order":53,"model":"FAGCN","metrics":{"Accuracy":"76.49 ± 2.87"},"uses_additional_data":false,"paper_date":"2021-01-04","paper":"/paper/beyond-low-frequency-information-in-graph","paper_url":"https://arxiv.org/abs/2101.00797v1","paper_title":"Beyond Low-frequency Information in Graph Convolutional Networks","code":"https://github.com/bdy9527/FAGCN","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":54,"model":"LINKX","metrics":{"Accuracy":"74.60 ± 8.37"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/large-scale-learning-on-non-homophilous","paper_url":"https://arxiv.org/abs/2110.14446v1","paper_title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","code":"https://github.com/cuai/non-homophily-large-scale","n_code_links":5,"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"]},"syntology":{"n_ran":15,"n_constructed":5,"n_ran_checked":10,"n_instrument":5,"n_unverified":6,"n_samples":21,"n_pointer_only_licence":11,"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"}}}},{"rank_in_archive_order":55,"model":"DeltaGNN constant","metrics":{"Accuracy":"74.05±3.08"},"uses_additional_data":false,"paper_date":"2025-01-10","paper":"/paper/deltagnn-graph-neural-network-with","paper_url":"https://arxiv.org/abs/2501.06002v1","paper_title":"DeltaGNN: Graph Neural Network with Information Flow Control","code":"https://github.com/basiralab/deltagnn","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":56,"model":"Geom-GCN-P","metrics":{"Accuracy":"67.57"},"uses_additional_data":false,"paper_date":"2020-02-13","paper":"/paper/geom-gcn-geometric-graph-convolutional-1","paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","code":"https://github.com/bingzhewei/geom-gcn","n_code_links":4,"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"]},"syntology":{"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7,"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"}}}},{"rank_in_archive_order":57,"model":"NLGCN","metrics":{"Accuracy":"65.5 ± 6.6"},"uses_additional_data":false,"paper_date":"2020-05-29","paper":"/paper/non-local-graph-neural-networks","paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","code":"https://github.com/divelab/Non-Local-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"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"}}}},{"rank_in_archive_order":58,"model":"SDRF","metrics":{"Accuracy":"64.46±0.38"},"uses_additional_data":false,"paper_date":"2021-11-29","paper":"/paper/understanding-over-squashing-and-bottlenecks-1","paper_url":"https://arxiv.org/abs/2111.14522v3","paper_title":"Understanding over-squashing and bottlenecks on graphs via curvature","code":"https://github.com/jctops/understanding-oversquashing","n_code_links":4,"official":{"repos":["jctops/understanding-oversquashing"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0,"sample_list":"/paper/understanding-over-squashing-and-bottlenecks-1#ran","syntology_url":"https://syntology.ai/paper/2111.14522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14522"}}}},{"rank_in_archive_order":59,"model":"NLGAT","metrics":{"Accuracy":"62.6 ± 7.1"},"uses_additional_data":false,"paper_date":"2020-05-29","paper":"/paper/non-local-graph-neural-networks","paper_url":"https://arxiv.org/abs/2005.14612v2","paper_title":"Non-Local Graph Neural Networks","code":"https://github.com/divelab/Non-Local-GNN","n_code_links":1,"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"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3,"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"}}}},{"rank_in_archive_order":60,"model":"Geom-GCN-S","metrics":{"Accuracy":"59.73"},"uses_additional_data":false,"paper_date":"2020-02-13","paper":"/paper/geom-gcn-geometric-graph-convolutional-1","paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","code":"https://github.com/bingzhewei/geom-gcn","n_code_links":4,"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"]},"syntology":{"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7,"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"}}}},{"rank_in_archive_order":61,"model":"Geom-GCN-I","metrics":{"Accuracy":"57.58"},"uses_additional_data":false,"paper_date":"2020-02-13","paper":"/paper/geom-gcn-geometric-graph-convolutional-1","paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","code":"https://github.com/bingzhewei/geom-gcn","n_code_links":4,"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"]},"syntology":{"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7,"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"}}}},{"rank_in_archive_order":62,"model":"LINKX+CausalMP","metrics":{"Accuracy":"57.36±0.60"},"uses_additional_data":false,"paper_date":"2024-11-21","paper":"/paper/heterophilic-graph-neural-networks","paper_url":"https://arxiv.org/abs/2411.13821v2","paper_title":"Heterophilic Graph Neural Networks Optimization with Causal Message-passing","code":null,"n_code_links":0,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 35 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,573 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 9 proposed a result; of those 9, 7 gave no cell that passed the extractor's own checks, 1 was rejected by the independent check, 0 await a verdict and 1 was placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":62,"metric_columns":1,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1573,"candidates":35,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":9,"no_cell_passed_checks":7,"rejected_by_independent_check":1,"accepted_not_placed":0,"awaiting_verdict":0,"placed":1,"placed_entries_listed":1,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): 1 placed; 9 newer papers judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables Claude Sonnet 4.5 judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"a_record_without_a_model":false,"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","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":9,"shown_on_page":9,"no_cell_split":{"no_cell_passed_checks_in_ledger":7,"rows_refused_by_rule":7,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2609.26310","outcome":"rejected","reason":null},{"arxiv_id":"2607.17272","outcome":"refused_by_rule","reason":"the row is an ablation variant, not the method itself"},{"arxiv_id":"2606.22325","outcome":"refused_by_rule","reason":"the value is not on the scale of the leaderboard column's archive values"},{"arxiv_id":"2605.05759","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2603.24291","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2601.22943","outcome":"placed","reason":null},{"arxiv_id":"2601.02451","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2510.18363","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2510.17457","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"}]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":["Accuracy"],"entries":[{"paper":"/paper/arxiv-2601-22943","paper_title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","arxiv_id":"2601.22943","model":"STPGC","row_label":"STPGC","configuration":null,"configuration_in_model":false,"configuration_not_shown_because":null,"values":{"Accuracy":"57.8"},"date":"2026-01-30","month_from_arxiv_id":null,"where_in_paper":"Table 7, row “STPGC”","table_label":"7","table_label_from":"the caption's own label","table_position_1based":7,"caption_head":"Table 7 : Node classification accuracy on heterophilic graphs with GPRGNN (…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"57.8","column_header":"Texas","value":57.8,"table_index_0based":6,"row":2,"col":1}],"code":"held, no recorded run","samples_harvested":1,"sample_list":"/paper/arxiv-2601-22943#ran","syntology":{"syntology_url":"https://syntology.ai/paper/2601.22943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2601.22943"}}}}]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":28,"rows_with_any_sample_ran":24,"rows_with_a_run_with_no_instrument_failure":18,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":28,"rows_whose_official_repository_has_a_sample_that_ran":20,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":14,"rows_community_repositories_only":4,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology 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","distinct_papers_with_graph_line":14,"distinct_papers_with_any_sample_ran":12,"distinct_papers_with_a_run_with_no_instrument_failure":8,"samples_over_distinct_papers":{"n_ran":87,"n_constructed":14,"n_ran_checked":55,"n_instrument":32,"n_unverified":37,"n_samples":124,"n_pointer_only_licence":52,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":151,"n_constructed":20,"n_ran_checked":88,"n_instrument":63,"n_unverified":65,"n_samples":216,"n_pointer_only_licence":99,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"81f17f722a03e7f09e20dc020a3fc2c1c7d17880a47471e251373ed633933bd4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}