{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/even-quantile-labels","entry":"even_quantile_labels","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":21,"n_papers_ran":6,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":9,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":10,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.07475","paper":"/paper/arxiv-2606-07475","title":"Graph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"TakahashiTakutooo/GNN_LCC","path":"utils/third_party.py","file_url":"https://github.com/TakahashiTakutooo/GNN_LCC/blob/HEAD/utils/third_party.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aa7b67adc8e742a7","mcp_get_code":{"code_sha256":"aa7b67adc8e742a7"}},{"arxiv_id":"2601.11135","paper":"/paper/arxiv-2601-11135","title":"Context-aware Graph Causality Inference for Few-Shot Molecular Property Prediction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NSLab-CUK/CaMol","path":"dataset.py","file_url":"https://github.com/NSLab-CUK/CaMol/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2510.10849","paper":"/paper/arxiv-2510-10849","title":"Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"CUAI/Non-Homophily-Large-Scale","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Large-Scale/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2504.13429","paper":"/paper/bounded-and-uniform-energy-based-out-of","title":"Bounded and Uniform Energy-based Out-of-distribution Detection for Graphs","date":"2025-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenzhiYang2000/NODESAFE-Bounded-and-Uniform-Energy-based-Out-of-distribution-Detection-for-Graphs","path":"NODESAFE_main/data_utils.py","file_url":"https://github.com/ShenzhiYang2000/NODESAFE-Bounded-and-Uniform-Energy-based-Out-of-distribution-Detection-for-Graphs/blob/HEAD/NODESAFE_main/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"919cb6dbf2c173bb","mcp_get_code":{"code_sha256":"919cb6dbf2c173bb"}},{"arxiv_id":"2412.09902","paper":"/paper/one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiexuanting/fpgc","path":"FPGC-main/data_utils.py","file_url":"https://github.com/xiexuanting/fpgc/blob/HEAD/FPGC-main/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c9307a7a17f1a3f","mcp_get_code":{"code_sha256":"5c9307a7a17f1a3f"}},{"arxiv_id":"2407.14459","paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification_large_graph/dataloader/LINKX_dataset.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification_large_graph/dataloader/LINKX_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60fa16c14dfd02f0","mcp_get_code":{"code_sha256":"60fa16c14dfd02f0"}},{"arxiv_id":"2406.04963","paper":"/paper/learning-divergence-fields-for-shift-robust","title":"Learning Divergence Fields for Shift-Robust Graph Representations","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fannie1208/GLIND","path":"observed/data_utils.py","file_url":"https://github.com/fannie1208/GLIND/blob/HEAD/observed/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"711b5792cfdf73cf","mcp_get_code":{"code_sha256":"711b5792cfdf73cf"}},{"arxiv_id":"2403.07954","paper":"/paper/optimizing-polynomial-graph-filters-a-novel","title":"Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/AdaptKry","path":"non-homo/data_utils.py","file_url":"https://github.com/kkhuang81/AdaptKry/blob/HEAD/non-homo/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2402.11494","paper":"/paper/graph-out-of-distribution-generalization-via","title":"Graph Out-of-Distribution Generalization via Causal Intervention","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fannie1208/canet","path":"data_utils.py","file_url":"https://github.com/fannie1208/canet/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"711b5792cfdf73cf","mcp_get_code":{"code_sha256":"711b5792cfdf73cf"}},{"arxiv_id":"2402.08907","paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"data_utils.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"919cb6dbf2c173bb","mcp_get_code":{"code_sha256":"919cb6dbf2c173bb"}},{"arxiv_id":"2312.14438","paper":"/paper/pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uestclbh/pc-conv","path":"data_utils.py","file_url":"https://github.com/uestclbh/pc-conv/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c9307a7a17f1a3f","mcp_get_code":{"code_sha256":"5c9307a7a17f1a3f"}},{"arxiv_id":"2312.11109","paper":"/paper/graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/largegt","path":"data.py","file_url":"https://github.com/snap-research/largegt/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6f8d749c27e0a47e","mcp_get_code":{"code_sha256":"6f8d749c27e0a47e"}},{"arxiv_id":"2311.05185","paper":"/paper/mixture-of-weak-strong-experts-on-graphs","title":"Mixture of Weak & Strong Experts on Graphs","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/mowst-gnn","path":"hetero_data_utils.py","file_url":"https://github.com/facebookresearch/mowst-gnn/blob/HEAD/hetero_data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fcf000e263c40916","mcp_get_code":{"code_sha256":"fcf000e263c40916"}},{"arxiv_id":"2310.02232","paper":"/paper/holonets-spectral-convolutions-do-extend-to","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChristianKoke/HoloNets","path":"src/utils/third_party.py","file_url":"https://github.com/ChristianKoke/HoloNets/blob/HEAD/src/utils/third_party.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa7b67adc8e742a7","mcp_get_code":{"code_sha256":"aa7b67adc8e742a7"}},{"arxiv_id":"2310.00800","paper":null,"title":"arXiv:2310.00800","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"qitianwu/GraphOOD-EERM","path":"multigraph/data_utils.py","file_url":"https://github.com/qitianwu/GraphOOD-EERM/blob/HEAD/multigraph/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"919cb6dbf2c173bb","mcp_get_code":{"code_sha256":"919cb6dbf2c173bb"}},{"arxiv_id":"2308.09517","paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/community-aware-graph-transformer","path":"dataset.py","file_url":"https://github.com/nslab-cuk/community-aware-graph-transformer/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2306.08274","paper":"/paper/why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/a2dug","path":"src/data_utils.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2305.10498","paper":"/paper/edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emalgorithm/directed-graph-neural-network","path":"src/utils/third_party.py","file_url":"https://github.com/emalgorithm/directed-graph-neural-network/blob/HEAD/src/utils/third_party.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa7b67adc8e742a7","mcp_get_code":{"code_sha256":"aa7b67adc8e742a7"}},{"arxiv_id":"2302.01524","paper":"/paper/ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lumia-group/orderedgnn","path":"datasets/datasets_linkx/data_utils.py","file_url":"https://github.com/lumia-group/orderedgnn/blob/HEAD/datasets/datasets_linkx/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be162bddd27d9fac","mcp_get_code":{"code_sha256":"be162bddd27d9fac"}},{"arxiv_id":"2210.07606","paper":"/paper/revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SitaoLuan/ACM-GNN","path":"ACM-Geometric/data_utils.py","file_url":"https://github.com/SitaoLuan/ACM-GNN/blob/HEAD/ACM-Geometric/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d305673ad3b29c2a","mcp_get_code":{"code_sha256":"d305673ad3b29c2a"}},{"arxiv_id":"2110.14446","paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Non-Homophily-Benchmarks","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"919cb6dbf2c173bb","mcp_get_code":{"code_sha256":"919cb6dbf2c173bb"}}]}