SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2302.01524 · ICLR · 2023

Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing

Yunchong Song, Chenghu Zhou, Xinbing Wang, Zhouhan Lin

arXiv · PDF · Open in the Atlas

Code that ran

6 of 10 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 6 failures of our instrument; 4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2302.01524.json · badge: /api/ran/2302.01524.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
lumia-group/orderedgnn canonical (classifier label)
classifier basis not recorded on the link
6 ran · 4 no recorded run
FunctionStatusWhere it lives
compat_matrix Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
lumia-group/orderedgnn/datasets/datasets_linkx/homophily.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("606e13d2f58cd737")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

edge_homophily Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
lumia-group/orderedgnn/datasets/datasets_linkx/homophily.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("07270c9ae73d7519")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

load_twitch_gamer Ran
ran; our contract draft was wrong, not the code
lumia-group/orderedgnn/datasets/datasets_linkx/load_data.py
pointer only (licence: MIT); the stored copy get_code serves, from jlinki/jdr, is pointer only (licence: NONE) · get_code("d4e6fd9f6cd8a3ad")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jlinki/jdr, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

node_homophily Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
lumia-group/orderedgnn/datasets/datasets_linkx/homophily.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("42ea8a2b9adf3c0e")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

rand_train_test_idx Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
lumia-group/orderedgnn/datasets/datasets_linkx/data_utils.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("13234652741e2264")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

to_planetoid Ran
ran; our contract draft was wrong, not the code
lumia-group/orderedgnn/datasets/datasets_linkx/data_utils.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("01e5c1887f86d840")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

even_quantile_labels Not yet run
unverified (harvested, no recorded run)
lumia-group/orderedgnn/datasets/datasets_linkx/data_utils.py
code served (permissive licence) · get_code("be162bddd27d9fac")
How it ran

no invocation recorded.

get_metric Not yet run
unverified (harvested, no recorded run)
lumia-group/orderedgnn/task_node.py
code served (permissive licence) · get_code("c63f69f76b82bf84")
How it ran

no invocation recorded.

load_fb100 Not yet run
unverified (harvested, no recorded run)
lumia-group/orderedgnn/datasets/datasets_linkx/load_data.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("0765a875204d931d")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

load_twitch Not yet run
unverified (harvested, no recorded run)
lumia-group/orderedgnn/datasets/datasets_linkx/load_data.py
pointer only (licence: MIT); the stored copy get_code serves, from CUAI/Non-Homophily-Large-Scale, is pointer only (licence: NONE) · get_code("563a5ce4dce55a17")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 10 samples lifted from this paper's linked repositories, 10 carry a function identity and 0 do not. Of the 10 distinct functions with an identity, 9 are also present in other papers whose code we hold (9 with at least one paper dated earlier, 0 the same month, 9 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
rand_train_test_idx 14 other papers
1 dated earlier, 13 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2306.08274 (2023-06)
A Simple and Scalable Graph Neural Network for Large Directed Graphs
2306.10759 (2023-06)
SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations
and 11 more not named here
even_quantile_labels 8 other papers
1 dated earlier, 7 later
2210.07606 (2022-10)
Revisiting Heterophily For Graph Neural Networks
2306.08274 (2023-06)
A Simple and Scalable Graph Neural Network for Large Directed Graphs
2308.09517 (2023-08)
Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity
and 5 more not named here
load_fb100 8 other papers
2 dated earlier, 6 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2210.07606 (2022-10)
Revisiting Heterophily For Graph Neural Networks
2306.10759 (2023-06)
SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations
and 5 more not named here
load_twitch_gamer 8 other papers
1 dated earlier, 7 later
2210.07606 (2022-10)
Revisiting Heterophily For Graph Neural Networks
2310.09202 (2023-10)
Graph Distillation with Eigenbasis Matching
2312.14438 (2023-12)
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
and 5 more not named here
to_planetoid 8 other papers
1 dated earlier, 7 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2306.08274 (2023-06)
A Simple and Scalable Graph Neural Network for Large Directed Graphs
2310.00800 (2023-10)
GRAPHPATCHER: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation
and 5 more not named here
load_twitch 4 other papers
1 dated earlier, 3 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2312.14438 (2023-12)
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
2412.09902 (2024-12)
One Node One Model: Featuring the Missing-Half for Graph Clustering
and 1 more not named here
compat_matrix 3 other papers
1 dated earlier, 2 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2312.14438 (2023-12)
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
2510.10849 (2025-10)
Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion
edge_homophily 3 other papers
1 dated earlier, 2 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2312.14438 (2023-12)
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
2510.10849 (2025-10)
Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion
node_homophily 3 other papers
1 dated earlier, 2 later
2110.14446 (2021-10)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
2312.14438 (2023-12)
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
2510.10849 (2025-10)
Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Most graph neural networks follow the message passing mechanism. However, it faces the over-smoothing problem when multiple times of message passing is applied to a graph, causing indistinguishable node representations and prevents the model to effectively learn dependencies between farther-away nodes. On the other hand, features of neighboring nodes with different labels are likely to be falsely mixed, resulting in the heterophily problem. In this work, we propose to order the messages passing into the node representation, with specific blocks of neurons targeted for message passing within specific hops. This is achieved by aligning the hierarchy of the rooted-tree of a central node with the ordered neurons in its node representation. Experimental results on an extensive set of datasets show that our model can simultaneously achieve the state-of-the-art in both homophily and heterophily settings, without any targeted design. Moreover, its performance maintains pretty well while the model becomes really deep, effectively preventing the over-smoothing problem. Finally, visualizing the gating vectors shows that our model learns to behave differently between homophily and heterophily settings, providing an explainable graph neural model. 1

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2302.01524")
get_code_for_paper("2302.01524")
have("2302.01524")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2302.01524.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2302.01524.svg)](https://syntology.ai/paper/2302.01524)

Connect an agent — have() is free.