{"url":"/sota/graph-property-prediction-on-ogbg-molhiv","task":{"name":"Graph Property Prediction","url":"/task/graph-property-prediction","note":null},"dataset":{"name":"ogbg-molhiv","url":"/dataset/ogb"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":null,"description_from":null,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Test ROC-AUC","Ext. data","Validation ROC-AUC","Number of params"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Test ROC-AUC":"higher","Ext. data":null,"Validation ROC-AUC":"higher","Number of params":"lower"}},"counts":{"rows":43,"rows_with_code":35,"rows_with_paper_page":36,"rows_dated":36,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"HyperFusion","metrics":{"Ext. data":"No","Number of params":"5908027","Test ROC-AUC":"0.8475 ± 0.0003","Validation ROC-AUC":"0.8275 ± 0.0008"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"PAS+FPs","metrics":{"Ext. data":"No","Number of params":"26706953","Test ROC-AUC":"0.8420 ± 0.0015","Validation ROC-AUC":"0.8238 ± 0.0028"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"HIG","metrics":{"Ext. data":"No","Number of params":"1019408","Test ROC-AUC":"0.8403 ± 0.0021","Validation ROC-AUC":"0.8176 ± 0.0034"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":4,"model":"DeepAUC","metrics":{"Ext. data":"No","Number of params":"3444509","Test ROC-AUC":"0.8352 ± 0.0054","Validation ROC-AUC":"0.8238 ± 0.0061"},"uses_additional_data":false,"paper_date":"2020-12-06","paper":"/paper/robust-deep-auc-maximization-a-new-surrogate","paper_url":"https://arxiv.org/abs/2012.03173v2","paper_title":"Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification","code":"https://github.com/Optimization-AI/LibAUC","n_code_links":4,"syntology":null},{"rank_in_archive_order":5,"model":"FingerPrint+GMAN","metrics":{"Ext. data":"No","Number of params":"1444110","Test ROC-AUC":"0.8244 ± 0.0033","Validation ROC-AUC":"0.8329 ± 0.0039"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"Neural FingerPrints","metrics":{"Ext. data":"No","Number of params":"2425102","Test ROC-AUC":"0.8232 ± 0.0047","Validation ROC-AUC":"0.8331 ± 0.0054"},"uses_additional_data":false,"paper_date":"2021-03-15","paper":"/paper/molecular-representation-learning-by","paper_url":"https://github.com/PaddlePaddle/PaddleHelix/blob/dev/competition/ogbg_molhiv/Molecule_Representation_Learning_by_Leveraging_Chemical_Information.pdf","paper_title":"Molecular Representation Learning by Leveraging Chemical Information","code":"https://github.com/PaddlePaddle/PaddleHelix","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"Graphormer + FPs","metrics":{"Ext. data":"No","Number of params":"47085378","Test ROC-AUC":"0.8225 ± 0.0001","Validation ROC-AUC":"0.8396 ± 0.0001"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null},{"rank_in_archive_order":8,"model":"Molecular FP + Random Forest","metrics":{"Ext. data":"No","Number of params":"5782","Test ROC-AUC":"0.8208 ± 0.0037","Validation ROC-AUC":"0.8036 ± 0.0059"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"GPTrans-B","metrics":{"Ext. data":"Yes","Test ROC-AUC":"0.8126 ± 0.0032"},"uses_additional_data":false,"paper_date":"2023-05-19","paper":"/paper/graph-propagation-transformer-for-graph","paper_url":"https://arxiv.org/abs/2305.11424v3","paper_title":"Graph Propagation Transformer for Graph Representation Learning","code":"https://github.com/czczup/gptrans","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":4,"n_samples":8,"n_pointer_only_licence":8}},{"rank_in_archive_order":10,"model":"CIN","metrics":{"Ext. data":"No","Number of params":"239745","Test ROC-AUC":"0.8094 ± 0.0057","Validation ROC-AUC":"0.8277 ± 0.0099"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_url":"https://arxiv.org/abs/2106.12575v3","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","code":"https://github.com/twitter-research/cwn","n_code_links":2,"syntology":null},{"rank_in_archive_order":11,"model":"GSAT","metrics":{"Ext. data":"No","Number of params":"249602","Test ROC-AUC":"0.8067 ± 0.0950","Validation ROC-AUC":"0.8347 ± 0.0031"},"uses_additional_data":false,"paper_date":"2022-01-31","paper":"/paper/interpretable-and-generalizable-graph","paper_url":"https://arxiv.org/abs/2201.12987v3","paper_title":"Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism","code":"https://github.com/divelab/good","n_code_links":2,"syntology":{"n_ran":9,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"MorganFP+Rand. Forest","metrics":{"Ext. data":"No","Number of params":"230000","Test ROC-AUC":"0.8060 ± 0.0010","Validation ROC-AUC":"0.8420 ± 0.0030"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"EGT","metrics":{"Test ROC-AUC":"0.806 ± 0.0065"},"uses_additional_data":false,"paper_date":"2021-08-07","paper":"/paper/edge-augmented-graph-transformers-global-self","paper_url":"https://arxiv.org/abs/2108.03348v3","paper_title":"Global Self-Attention as a Replacement for Graph Convolution","code":"https://github.com/shamim-hussain/egt_pytorch","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"CIN-small","metrics":{"Ext. data":"No","Number of params":"138337","Test ROC-AUC":"0.8055 ± 0.0104","Validation ROC-AUC":"0.8310 ± 0.0102"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_url":"https://arxiv.org/abs/2106.12575v3","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","code":"https://github.com/twitter-research/cwn","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"Graphormer","metrics":{"Ext. data":"Yes","Number of params":"47183040","Test ROC-AUC":"0.8051 ± 0.0053","Validation ROC-AUC":"0.8310 ± 0.0089"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null},{"rank_in_archive_order":16,"model":"Graphormer (pre-trained on PCQM4M)","metrics":{"Ext. data":"Yes","Number of params":"47183040","Test ROC-AUC":"0.8051 ± 0.0053","Validation ROC-AUC":"0.8310 ± 0.0089"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null},{"rank_in_archive_order":17,"model":"GatedGCN+","metrics":{"Ext. data":"No","Number of params":"1076633","Test ROC-AUC":"0.8040 ± 0.0164","Validation ROC-AUC":"0.8329 ± 0.0158"},"uses_additional_data":false,"paper_date":"2025-02-13","paper":"/paper/unlocking-the-potential-of-classic-gnns-for","paper_url":"https://arxiv.org/abs/2502.09263v1","paper_title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","code":"https://github.com/LUOyk1999/GNNPlus","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":8,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"directional GSN","metrics":{"Ext. data":"No","Number of params":"114211","Test ROC-AUC":"0.8039 ± 0.0090","Validation ROC-AUC":"0.8473 ± 0.0096"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/improving-graph-neural-network-expressivity","paper_url":"https://arxiv.org/abs/2006.09252v3","paper_title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","code":"https://github.com/gbouritsas/gsn","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"P-WL","metrics":{"Ext. data":"No","Number of params":"4600000","Test ROC-AUC":"0.8039 ± 0.0040","Validation ROC-AUC":"0.8279 ± 0.0059"},"uses_additional_data":false,"paper_date":"2019-06-09","paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","paper_url":"http://proceedings.mlr.press/v97/rieck19a.html","paper_title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","code":"https://github.com/BorgwardtLab/P-WL","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"Nested GIN+virtual node (ens)","metrics":{"Test ROC-AUC":"0.7986 ± 0.0105","Validation ROC-AUC":"0.8080 ± 0.0278"},"uses_additional_data":false,"paper_date":"2021-10-25","paper":"/paper/nested-graph-neural-networks","paper_url":"https://arxiv.org/abs/2110.13197v1","paper_title":"Nested Graph Neural Networks","code":"https://github.com/muhanzhang/NestedGNN","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"DGN","metrics":{"Ext. data":"No","Number of params":"114065","Test ROC-AUC":"0.7970 ± 0.0097","Validation ROC-AUC":"0.8470 ± 0.0047"},"uses_additional_data":false,"paper_date":"2020-10-06","paper":"/paper/directional-graph-networks-1","paper_url":"https://arxiv.org/abs/2010.02863v4","paper_title":"Directional Graph Networks","code":"https://github.com/Saro00/DGN","n_code_links":2,"syntology":{"n_ran":12,"n_unverified":2,"n_samples":14,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"PIN","metrics":{"Test ROC-AUC":"0.7944 ± 1.40 "},"uses_additional_data":false,"paper_date":"2023-08-13","paper":"/paper/generalizing-topological-graph-neural","paper_url":"https://arxiv.org/abs/2308.06838v6","paper_title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":23,"model":"DeeperGCN+FLAG","metrics":{"Ext. data":"No","Number of params":"531976","Test ROC-AUC":"0.7942 ± 0.0120","Validation ROC-AUC":"0.8425 ± 0.0061"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":24,"model":"PHC-GNN","metrics":{"Ext. data":"No","Number of params":"110909","Test ROC-AUC":"0.7934 ± 0.0116","Validation ROC-AUC":"0.8217 ± 0.0089"},"uses_additional_data":false,"paper_date":"2021-03-30","paper":"/paper/parameterized-hypercomplex-graph-neural","paper_url":"https://arxiv.org/abs/2103.16584v1","paper_title":"Parameterized Hypercomplex Graph Neural Networks for Graph Classification","code":"https://github.com/bayer-science-for-a-better-life/phc-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"PNA","metrics":{"Ext. data":"No","Number of params":"326081","Test ROC-AUC":"0.7905 ± 0.0132","Validation ROC-AUC":"0.8519 ± 0.0099"},"uses_additional_data":false,"paper_date":"2020-04-12","paper":"/paper/principal-neighbourhood-aggregation-for-graph","paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":8,"syntology":{"n_ran":33,"n_unverified":22,"n_samples":55,"n_pointer_only_licence":48}},{"rank_in_archive_order":26,"model":"GCN+GraphNorm","metrics":{"Ext. data":"No","Number of params":"526201","Test ROC-AUC":"0.7883 ± 0.0100","Validation ROC-AUC":"0.7904 ± 0.0115"},"uses_additional_data":false,"paper_date":"2020-09-07","paper":"/paper/graphnorm-a-principled-approach-to","paper_url":"https://arxiv.org/abs/2009.03294v3","paper_title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","code":"https://github.com/lsj2408/GraphNorm","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":27,"model":"GPS","metrics":{"Ext. data":"No","Number of params":"558625","Test ROC-AUC":"0.7880","Validation ROC-AUC":"0.8255 ± 0.0092"},"uses_additional_data":false,"paper_date":"2022-05-25","paper":"/paper/recipe-for-a-general-powerful-scalable-graph","paper_url":"https://arxiv.org/abs/2205.12454v4","paper_title":"Recipe for a General, Powerful, Scalable Graph Transformer","code":"https://github.com/rampasek/GraphGPS","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":18,"n_samples":21,"n_pointer_only_licence":0}},{"rank_in_archive_order":28,"model":"HIMP","metrics":{"Ext. data":"No","Number of params":"153029","Test ROC-AUC":"0.7880 ± 0.0082","Validation ROC-AUC":"Please tell us"},"uses_additional_data":false,"paper_date":"2020-06-22","paper":"/paper/hierarchical-inter-message-passing-for","paper_url":"https://arxiv.org/abs/2006.12179v1","paper_title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","code":"https://github.com/rusty1s/himp-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"DeeperGCN","metrics":{"Ext. data":"No","Number of params":"531976","Test ROC-AUC":"0.7858 ± 0.0117","Validation ROC-AUC":"0.8427 ± 0.0063"},"uses_additional_data":false,"paper_date":"2020-06-13","paper":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","paper_url":"https://arxiv.org/abs/2006.07739v1","paper_title":"DeeperGCN: All You Need to Train Deeper GCNs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/deepergcn","n_code_links":3,"syntology":null},{"rank_in_archive_order":30,"model":"Nested GIN+virtual node","metrics":{"Test ROC-AUC":"0.7834 ± 0.0186","Validation ROC-AUC":"0.8317 ± 0.0199"},"uses_additional_data":false,"paper_date":"2021-10-25","paper":"/paper/nested-graph-neural-networks","paper_url":"https://arxiv.org/abs/2110.13197v1","paper_title":"Nested Graph Neural Networks","code":"https://github.com/muhanzhang/NestedGNN","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":31,"model":"GIN","metrics":{"Ext. data":"No","Number of params":"32385","Test ROC-AUC":"0.7825 ± 0.0121","Validation ROC-AUC":"0.8009 ± 0.0078"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":32,"model":"EGC-M (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"317265","Test ROC-AUC":"0.7818 ± 0.0153","Validation ROC-AUC":"0.8396 ± 0.0097"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/adaptive-filters-and-aggregator-fusion-for","paper_url":"https://arxiv.org/abs/2104.01481v5","paper_title":"Do We Need Anisotropic Graph Neural Networks?","code":"https://github.com/pyg-team/pytorch_geometric","n_code_links":2,"syntology":null},{"rank_in_archive_order":33,"model":"GSN","metrics":{"Ext. data":"No","Number of params":"3338701","Test ROC-AUC":"0.7799 ± 0.0100","Validation ROC-AUC":"0.8658 ± 0.0084"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/improving-graph-neural-network-expressivity","paper_url":"https://arxiv.org/abs/2006.09252v3","paper_title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","code":"https://github.com/gbouritsas/gsn","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":34,"model":"WEGL","metrics":{"Ext. data":"No","Number of params":"361064","Test ROC-AUC":"0.7757 ± 0.0111","Validation ROC-AUC":"0.8101 ± 0.0097"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/wasserstein-embedding-for-graph-learning","paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","code":"https://github.com/navid-naderi/WEGL","n_code_links":1,"syntology":null},{"rank_in_archive_order":35,"model":"GIN+virtual node+FLAG","metrics":{"Ext. data":"No","Number of params":"3336306","Test ROC-AUC":"0.7748 ± 0.0096","Validation ROC-AUC":"0.8438 ± 0.0128"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":36,"model":"EGC-S (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"317013","Test ROC-AUC":"0.7721 ± 0.0110","Validation ROC-AUC":"0.8366 ± 0.0074"},"uses_additional_data":false,"paper_date":"2021-04-03","paper":"/paper/adaptive-filters-and-aggregator-fusion-for","paper_url":"https://arxiv.org/abs/2104.01481v5","paper_title":"Do We Need Anisotropic Graph Neural Networks?","code":"https://github.com/pyg-team/pytorch_geometric","n_code_links":2,"syntology":null},{"rank_in_archive_order":37,"model":"GIN+virtual node","metrics":{"Ext. data":"No","Number of params":"3336306","Test ROC-AUC":"0.7707 ± 0.0149","Validation ROC-AUC":"0.8479 ± 0.0068"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":38,"model":"GCN+FLAG","metrics":{"Ext. data":"No","Number of params":"527701","Test ROC-AUC":"0.7683 ± 0.0102","Validation ROC-AUC":"0.8176 ± 0.0087"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":39,"model":"GIN+FLAG","metrics":{"Ext. data":"No","Number of params":"1885206","Test ROC-AUC":"0.7654 ± 0.0114","Validation ROC-AUC":"0.8225 ± 0.0155"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":40,"model":"GCN","metrics":{"Ext. data":"No","Number of params":"527701","Test ROC-AUC":"0.7606 ± 0.0097","Validation ROC-AUC":"0.8204 ± 0.0141"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":41,"model":"GCN+virtual node","metrics":{"Ext. data":"No","Number of params":"1978801","Test ROC-AUC":"0.7599 ± 0.0119","Validation ROC-AUC":"0.8384 ± 0.0091"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":42,"model":"GIN","metrics":{"Ext. data":"No","Number of params":"1885206","Test ROC-AUC":"0.7558 ± 0.0140","Validation ROC-AUC":"0.8232 ± 0.0090"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":43,"model":"GCN (in Julia)","metrics":{"Ext. data":"No","Number of params":"527701","Test ROC-AUC":"0.7549 ± 0.0163","Validation ROC-AUC":"0.8042 ± 0.0107"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":21,"rows_with_any_sample_ran":18,"distinct_papers_with_graph_line":13,"distinct_papers_with_any_sample_ran":11,"samples_over_distinct_papers":{"n_ran":105,"n_unverified":109,"n_samples":214,"n_pointer_only_licence":83,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":182,"n_unverified":209,"n_samples":391,"n_pointer_only_licence":132,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}