{"url":"/task/graph-property-prediction","name":"Graph Property Prediction","slug":"graph-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":56,"papers_with_code":47,"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":3,"subtasks":7,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molhiv","slug":"graph-property-prediction-on-ogbg-molhiv","dataset":"ogbg-molhiv","dataset_url":"/dataset/ogb","rows_in_archive":43,"metrics":["Test ROC-AUC","Ext. data","Validation ROC-AUC","Number of params"],"first_row_in_archive_order":{"model":"HyperFusion","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molpcba","slug":"graph-property-prediction-on-ogbg-molpcba","dataset":"ogbg-molpcba","dataset_url":"/dataset/ogb","rows_in_archive":36,"metrics":["Test AP","Ext. data","Validation AP","Number of params"],"first_row_in_archive_order":{"model":"HyperFusino","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-code2","slug":"graph-property-prediction-on-ogbg-code2","dataset":"ogbg-code2","dataset_url":"/dataset/ogb","rows_in_archive":21,"metrics":["Test F1 score","Ext. data","Validation F1 score","Number of params"],"first_row_in_archive_order":{"model":"SAT++ with Magnetic Laplacian","paper_title":"Transformers Meet Directed Graphs","paper_url":"/paper/transformers-meet-directed-graphs","paper_date":"2023-01-31","arxiv_id":"2302.00049","code_links":[{"title":"deepmind/digraph_transformer","url":"https://github.com/deepmind/digraph_transformer"}],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-ppa","slug":"graph-property-prediction-on-ogbg-ppa","dataset":"ogbg-ppa","dataset_url":"/dataset/ogb","rows_in_archive":18,"metrics":["Ext. data","Test Accuracy","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GatedGCN+","paper_title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","paper_url":"/paper/unlocking-the-potential-of-classic-gnns-for","paper_date":"2025-02-13","arxiv_id":"2502.09263","code_links":[{"title":"LUOyk1999/GNNPlus","url":"https://github.com/LUOyk1999/GNNPlus"}],"syntology":{"n":12,"n_ran":4,"n_unverified":8,"n_pointer_only":0}}},{"leaderboard":"/sota/graph-property-prediction-on-qm9","slug":"graph-property-prediction-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":10,"metrics":["Standardized MAE","logMAE","alpha (ma)","gap (meV)"],"first_row_in_archive_order":{"model":"GotenNet (Large)","paper_title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","paper_url":"/paper/gotennet-rethinking-efficient-3d-equivariant","paper_date":"2025-04-24","arxiv_id":null,"code_links":[{"title":"lucidrains/gotennet-pytorch","url":"https://github.com/lucidrains/gotennet-pytorch"},{"title":"sarpaykent/GotenNet","url":"https://github.com/sarpaykent/GotenNet"}],"syntology":null}}],"datasets":[{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/pcqm4mv2-lsc","name":"PCQM4Mv2-LSC","full_name":"","num_papers_in_archive":17}],"subtasks":[{"url":"/task/nd-regression","name":"ND regression"},{"url":"/task/neutron-pdf","name":"Neutron PDF"},{"url":"/task/neutron-pdf-regression","name":"Neutron PDF regression"},{"url":"/task/sans-regression","name":"SANS regression"},{"url":"/task/saxs-regression","name":"SAXS regression"},{"url":"/task/x-ray-pdf-regression","name":"X-ray PDF regression"},{"url":"/task/xrd-regression","name":"XRD regression"}],"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":47,"tagged_in_all":56,"items":[{"url":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","arxiv_id":"1406.2661","repositories_listed":189,"syntology":{"n":55,"n_ran":23,"n_unverified":32,"n_pointer_only":18}},{"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/do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","repositories_listed":5,"syntology":null},{"url":"/paper/e-n-equivariant-graph-neural-networks","title":"E(n) Equivariant Graph Neural Networks","date":"2021-02-19","arxiv_id":"2102.09844","repositories_listed":5,"syntology":{"n":15,"n_ran":15,"n_unverified":0,"n_pointer_only":7}},{"url":"/paper/equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_unverified":18,"n_pointer_only":0}},{"url":"/paper/robust-deep-auc-maximization-a-new-surrogate","title":"Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification","date":"2020-12-06","arxiv_id":"2012.03173","repositories_listed":4,"syntology":null},{"url":"/paper/triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"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/gotennet-rethinking-efficient-3d-equivariant","title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","date":"2025-04-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/global-concept-explanations-for-graphs-by","title":"Global Concept Explanations for Graphs by Contrastive Learning","date":"2024-04-25","arxiv_id":"2404.16532","repositories_listed":2,"syntology":null},{"url":"/paper/equiformerv2-improved-equivariant-transformer","title":"EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations","date":"2023-06-21","arxiv_id":"2306.12059","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/a-new-perspective-on-building-efficient-and-1","title":"A new perspective on building efficient and expressive 3D equivariant graph neural networks","date":"2023-04-07","arxiv_id":"2304.04757","repositories_listed":2,"syntology":null},{"url":"/paper/nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","arxiv_id":"2110.13197","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/geometric-and-physical-quantities-improve-e-3","title":"Geometric and Physical Quantities Improve E(3) Equivariant Message Passing","date":"2021-10-06","arxiv_id":"2110.02905","repositories_listed":2,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","title":"Weisfeiler and Lehman Go Cellular: CW Networks","date":"2021-06-23","arxiv_id":"2106.12575","repositories_listed":2,"syntology":null},{"url":"/paper/unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","repositories_listed":1,"syntology":{"n":12,"n_ran":4,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/virtual-nodes-can-help-tackling-distribution","title":"Virtual Nodes Can Help: Tackling Distribution Shifts in Federated Graph Learning","date":"2024-12-26","arxiv_id":"2412.19229","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-self-supervised-graph","title":"Data-Driven Self-Supervised Graph Representation Learning","date":"2024-12-24","arxiv_id":"2412.18316","repositories_listed":1,"syntology":null},{"url":"/paper/next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/towards-neural-scaling-laws-for-foundation","title":"Towards Neural Scaling Laws for Foundation Models on Temporal Graphs","date":"2024-06-14","arxiv_id":"2406.10426","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/graph-neural-networks-with-configuration","title":"Graph neural networks with configuration cross-attention for tensor compilers","date":"2024-05-26","arxiv_id":"2405.16623","repositories_listed":1,"syntology":null},{"url":"/paper/contextualized-messages-boost-graph","title":"Contextualized Messages Boost Graph Representations","date":"2024-03-19","arxiv_id":"2403.12529","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","arxiv_id":"2312.11109","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_unverified":3,"n_pointer_only":5}},{"url":"/paper/tpugraphs-a-performance-prediction-dataset-on-1","title":"TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational Graphs","date":"2023-08-25","arxiv_id":"2308.13490","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/learning-large-graph-property-prediction-via","title":"Learning Large Graph Property Prediction via Graph Segment Training","date":"2023-05-21","arxiv_id":"2305.12322","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_unverified":4,"n_pointer_only":8}},{"url":"/paper/data-centric-learning-from-unlabeled-graphs-2","title":"Data-Centric Learning from Unlabeled Graphs with Diffusion Model","date":"2023-03-17","arxiv_id":"2303.10108","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":2}}],"syntology_records":19,"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"}}