{"url":"/task/node-property-prediction","name":"Node Property Prediction","slug":"node-property-prediction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":54,"papers_with_code":54,"benchmarks":5,"benchmark_tables_in_archive":5,"benchmark_tables_shown":5,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":2,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","slug":"node-property-prediction-on-ogbn-arxiv","dataset":"ogbn-arxiv","dataset_url":"/dataset/ogb","rows_in_archive":86,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"BiGTex","paper_title":"Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex","paper_url":"/paper/integrating-structural-and-semantic-signals","paper_date":"2025-04-16","arxiv_id":"2504.12474","code_links":[{"title":"Azadeh297/BiGTex","url":"https://github.com/Azadeh297/BiGTex"}],"syntology":null}},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","slug":"node-property-prediction-on-ogbn-products","dataset":"ogbn-products","dataset_url":"/dataset/ogb","rows_in_archive":64,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GLEM+EnGCN","paper_title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","paper_url":"/paper/learning-on-large-scale-text-attributed","paper_date":"2022-10-26","arxiv_id":"2210.14709","code_links":[{"title":"andyjzhao/glem","url":"https://github.com/andyjzhao/glem"},{"title":"AndyJZhao/GLEM","url":"https://github.com/AndyJZhao/GLEM"}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}}},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","slug":"node-property-prediction-on-ogbn-mag","dataset":"ogbn-mag","dataset_url":"/dataset/ogb","rows_in_archive":39,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"LDHGNN","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/node-property-prediction-on-ogbn-proteins","slug":"node-property-prediction-on-ogbn-proteins","dataset":"ogbn-proteins","dataset_url":"/dataset/ogb","rows_in_archive":26,"metrics":["Ext. data","Test ROC-AUC","Validation ROC-AUC","Number of params"],"first_row_in_archive_order":{"model":"LD+GAT","paper_title":"Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Bias","paper_url":"/paper/label-deconvolution-for-node-representation","paper_date":"2023-09-26","arxiv_id":"2309.14907","code_links":[{"title":"MIRALab-USTC/LD","url":"https://github.com/MIRALab-USTC/LD"}],"syntology":null}},{"leaderboard":"/sota/node-property-prediction-on-ogbn-papers100m","slug":"node-property-prediction-on-ogbn-papers100m","dataset":"ogbn-papers100M","dataset_url":"/dataset/ogb","rows_in_archive":20,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GLEM+GIANT+GAMLP","paper_title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","paper_url":"/paper/learning-on-large-scale-text-attributed","paper_date":"2022-10-26","arxiv_id":"2210.14709","code_links":[{"title":"andyjzhao/glem","url":"https://github.com/andyjzhao/glem"},{"title":"AndyJZhao/GLEM","url":"https://github.com/AndyJZhao/GLEM"}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}}}],"datasets":[{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000}],"subtasks":[{"url":"/task/position-regression","name":"Position regression"},{"url":"/task/research-performance-prediction","name":"Research Performance Prediction"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":54,"tagged_in_all":54,"items":[{"url":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","arxiv_id":"1512.02325","repositories_listed":221,"syntology":{"n":131,"n_ran":19,"n_unverified":112,"n_pointer_only":5}},{"url":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":50,"n_unverified":56,"n_pointer_only":43}},{"url":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":31,"n_unverified":27,"n_pointer_only":22}},{"url":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":10,"n_unverified":22,"n_pointer_only":15}},{"url":"/paper/open-graph-benchmark-datasets-for-machine","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","date":"2020-05-02","arxiv_id":"2005.00687","repositories_listed":21,"syntology":{"n":17,"n_ran":2,"n_unverified":15,"n_pointer_only":15}},{"url":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":6,"n_unverified":10,"n_pointer_only":1}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.13993","repositories_listed":7,"syntology":{"n":5,"n_ran":2,"n_unverified":3,"n_pointer_only":2}},{"url":"/paper/temporal-graph-benchmark-for-machine-learning-1","title":"Temporal Graph Benchmark for Machine Learning on Temporal Graphs","date":"2023-07-03","arxiv_id":"2307.01026","repositories_listed":6,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","repositories_listed":5,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","date":"2023-07-17","arxiv_id":"2307.08430","repositories_listed":4,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":7}},{"url":"/paper/improving-the-training-of-graph-neural","title":"SCR: Training Graph Neural Networks with Consistency Regularization","date":"2021-12-08","arxiv_id":"2112.04319","repositories_listed":4,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":1}},{"url":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","arxiv_id":"2111.00064","repositories_listed":4,"syntology":{"n":20,"n_ran":6,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/training-graph-neural-networks-with-1000","title":"Training Graph Neural Networks with 1000 Layers","date":"2021-06-14","arxiv_id":"2106.07476","repositories_listed":4,"syntology":{"n":11,"n_ran":1,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/residual-network-and-embedding-usage-new","title":"Residual Network and Embedding Usage: New Tricks of Node Classification with Graph Convolutional Networks","date":"2021-05-18","arxiv_id":"2105.08330","repositories_listed":4,"syntology":null},{"url":"/paper/simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","arxiv_id":"2003.01332","repositories_listed":4,"syntology":{"n":6,"n_ran":1,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","arxiv_id":"2305.19523","repositories_listed":3,"syntology":{"n":7,"n_ran":4,"n_unverified":3,"n_pointer_only":1}},{"url":"/paper/flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","arxiv_id":"2010.09891","repositories_listed":3,"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","arxiv_id":"2009.03509","repositories_listed":3,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","title":"DeeperGCN: All You Need to Train Deeper GCNs","date":"2020-06-13","arxiv_id":"2006.07739","repositories_listed":3,"syntology":null},{"url":"/paper/spectral-heterogeneous-graph-convolutions-via","title":"Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials","date":"2023-05-31","arxiv_id":"2305.19872","repositories_listed":2,"syntology":null},{"url":"/paper/a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","arxiv_id":"2210.07494","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","arxiv_id":"2207.02547","repositories_listed":2,"syntology":null},{"url":"/paper/distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","arxiv_id":"2106.08541","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/bag-of-tricks-of-semi-supervised","title":"Bag of Tricks for Node Classification with Graph Neural Networks","date":"2021-03-24","arxiv_id":"2103.13355","repositories_listed":2,"syntology":null}],"syntology_records":23,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}