Home › Code › even_quantile_labels

even_quantile_labels

Syntologyentry name in harvested coderead from the graph 2026-09-24

even_quantile_labels appears in the code Syntology harvested for 21 papers, as 9 distinct code bodies found in 21 places (a place is one code body under one paper). At least one of them ran in 6 of the papers; 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named even_quantile_labels do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 4 of the 9 distinct code bodies named even_quantile_labels; 5 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
4ran
5unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 10 of the 21 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

21 papers shown of 21, newest first; 21 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 3 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Graph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs added by Syntology 2026-06 (from id) TakahashiTakutooo/GNN_LCC/utils/third_party.py aa7b67adc8e742a7 ran no licence file found · pointer only
Context-aware Graph Causality Inference for Few-Shot Molecular Property Prediction added by Syntology 2026-01 (from id) NSLab-CUK/CaMol/dataset.py be162bddd27d9fac unverified MIT (permissive)
Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion added by Syntology 2025-10 (from id) CUAI/Non-Homophily-Large-Scale/data_utils.py be162bddd27d9fac unverified no licence file found · pointer only
Bounded and Uniform Energy-based Out-of-distribution Detection for Graphs 18 Apr 2025 ShenzhiYang2000/NODESAFE-Bounded-and-Uniform-Energy-based-Out-of-distribution-Detection-for-Graphs/NODESAFE_main/data_utils.py 919cb6dbf2c173bb unverified MIT (permissive)
One Node One Model: Featuring the Missing-Half for Graph Clustering 13 Dec 2024 xiexuanting/fpgc/FPGC-main/data_utils.py 5c9307a7a17f1a3f unverified no licence file found · pointer only
PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer 19 Jul 2024 air029/polyformer/node_classification_large_graph/dataloader/LINKX_dataset.py 60fa16c14dfd02f0 ran no licence file found · pointer only
Learning Divergence Fields for Shift-Robust Graph Representations 7 Jun 2024 fannie1208/GLIND/observed/data_utils.py 711b5792cfdf73cf unverified no licence file found · pointer only
Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach 12 Mar 2024 kkhuang81/AdaptKry/non-homo/data_utils.py be162bddd27d9fac unverified MIT (permissive)
Graph Out-of-Distribution Generalization via Causal Intervention 18 Feb 2024 fannie1208/canet/data_utils.py 711b5792cfdf73cf unverified no licence file found · pointer only
Subgraph Pooling: Tackling Negative Transfer on Graphs 14 Feb 2024 zehong-wang/subgraph-pooling/data_utils.py 919cb6dbf2c173bb unverified no licence file found · pointer only
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering 22 Dec 2023 uestclbh/pc-conv/data_utils.py 5c9307a7a17f1a3f unverified no licence file found · pointer only
Graph Transformers for Large Graphs 18 Dec 2023 snap-research/largegt/data.py 6f8d749c27e0a47e ran licence not identified · pointer only
Mixture of Weak & Strong Experts on Graphs 9 Nov 2023 facebookresearch/mowst-gnn/hetero_data_utils.py fcf000e263c40916 ran MIT (permissive)
HoloNets: Spectral Convolutions do extend to Directed Graphs 3 Oct 2023 ChristianKoke/HoloNets/src/utils/third_party.py aa7b67adc8e742a7 ran MIT (permissive)
arXiv:2310.00800 2023-10 (from id) qitianwu/GraphOOD-EERM/multigraph/data_utils.py 919cb6dbf2c173bb unverified no licence file found · pointer only
Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity 18 Aug 2023 nslab-cuk/community-aware-graph-transformer/dataset.py be162bddd27d9fac unverified MIT (permissive)
A Simple and Scalable Graph Neural Network for Large Directed Graphs 14 Jun 2023 seijimaekawa/a2dug/src/data_utils.py be162bddd27d9fac unverified MIT (permissive)
Edge Directionality Improves Learning on Heterophilic Graphs 17 May 2023 emalgorithm/directed-graph-neural-network/src/utils/third_party.py aa7b67adc8e742a7 ran MIT (permissive)
Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing 3 Feb 2023 lumia-group/orderedgnn/datasets/datasets_linkx/data_utils.py be162bddd27d9fac unverified MIT (permissive)
Revisiting Heterophily For Graph Neural Networks 14 Oct 2022 SitaoLuan/ACM-GNN/ACM-Geometric/data_utils.py d305673ad3b29c2a unverified MIT (permissive)
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods 27 Oct 2021 CUAI/Non-Homophily-Benchmarks/data_utils.py 919cb6dbf2c173bb unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections