{"url":"/sota/graph-property-prediction-on-ogbg-code2","task":{"name":"Graph Property Prediction","url":"/task/graph-property-prediction","note":null},"dataset":{"name":"ogbg-code2","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 F1 score","Ext. data","Validation F1 score","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 F1 score":"higher","Ext. data":null,"Validation F1 score":"higher","Number of params":"lower"}},"counts":{"rows":21,"rows_with_code":16,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SAT++ with Magnetic Laplacian","metrics":{"Ext. data":"No","Number of params":"14378069","Test F1 score":"0.2222 ± 0.0010","Validation F1 score":"0.2044 ± 0.0020"},"uses_additional_data":false,"paper_date":"2023-01-31","paper":"/paper/transformers-meet-directed-graphs","paper_url":"https://arxiv.org/abs/2302.00049v3","paper_title":"Transformers Meet Directed Graphs","code":"https://github.com/deepmind/digraph_transformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"SAT++ with Magnetic Laplacian","metrics":{"Ext. data":"No","Number of params":"14378069","Test F1 score":"0.2222 ± 0.0032","Validation F1 score":"0.2044 ± 0.0020"},"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":"DAGformer","metrics":{"Ext. data":"No","Number of params":"14952882","Test F1 score":"0.2018 ± 0.0021","Validation F1 score":"0.1846 ± 0.0010"},"uses_additional_data":false,"paper_date":"2022-10-24","paper":"/paper/transformers-over-directed-acyclic-graphs-1","paper_url":"https://arxiv.org/abs/2210.13148v6","paper_title":"Transformers over Directed Acyclic Graphs","code":"https://github.com/LUOyk1999/DAGformer","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"SAT","metrics":{"Ext. data":"No","Number of params":"15734000","Test F1 score":"0.1937 ± 0.0028","Validation F1 score":"0.1773 ± 0.0023"},"uses_additional_data":false,"paper_date":"2022-02-07","paper":"/paper/structure-aware-transformer-for-graph","paper_url":"https://arxiv.org/abs/2202.03036v3","paper_title":"Structure-Aware Transformer for Graph Representation Learning","code":"https://github.com/BorgwardtLab/SAT","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":5,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"GatedGCN+","metrics":{"Test F1 score":"0.1896 ± 0.0024","Validation F1 score":"0.1742 ± 0.0027"},"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":6,"model":"GPS","metrics":{"Ext. data":"No","Number of params":"12454066","Test F1 score":"0.1894","Validation F1 score":"0.1739 ± 0.001"},"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":7,"model":"GraphTrans (GCN-Virtual)","metrics":{"Ext. data":"No","Number of params":"9053246","Test F1 score":"0.1830 ± 0.0024","Validation F1 score":"0.1661 ± 0.0012"},"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":8,"model":"GMAN+bag of tricks","metrics":{"Ext. data":"No","Number of params":"63684290","Test F1 score":"0.1770 ± 0.0012","Validation F1 score":"0.1631 ± 0.0090"},"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":"DAGNN","metrics":{"Ext. data":"No","Number of params":"35246814","Test F1 score":"0.1751 ± 0.0049","Validation F1 score":"0.1607 ± 0.0040"},"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":10,"model":"DAGNN","metrics":{"Test F1 score":"0.1751 ± 0.0049","Validation F1 score":"0.1607 ± 0.0040"},"uses_additional_data":false,"paper_date":"2021-01-20","paper":"/paper/directed-acyclic-graph-neural-networks-1","paper_url":"https://arxiv.org/abs/2101.07965v3","paper_title":"Directed Acyclic Graph Neural Networks","code":"https://github.com/vthost/DAGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"GraphTrans (GCN)","metrics":{"Ext. data":"No","Number of params":"7563746","Test F1 score":"0.1751 ± 0.0015","Validation F1 score":"0.1599 ± 0.0009"},"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":12,"model":"EGC-M (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"10986002","Test F1 score":"0.1595 ± 0.0019","Validation F1 score":"0.1464 ± 0.0021"},"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":13,"model":"GCN+virtual node","metrics":{"Ext. data":"No","Number of params":"12484310","Test F1 score":"0.1595 ± 0.0018","Validation F1 score":"0.1461 ± 0.0013"},"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":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":14,"model":"GIN+virtual node","metrics":{"Ext. data":"No","Number of params":"13841815","Test F1 score":"0.1581 ± 0.0026","Validation F1 score":"0.1439 ± 0.0020"},"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":15,"model":"PNA (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"10992050","Test F1 score":"0.1570 ± 0.0032","Validation F1 score":"0.1453 ± 0.0025"},"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":16,"model":"GAT","metrics":{"Ext. data":"No","Number of params":"11030210","Test F1 score":"0.1569 ± 0.0010","Validation F1 score":"0.1442 ± 0.0017"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":17,"model":"MPNN-Max (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"10971506","Test F1 score":"0.1552 ± 0.0022","Validation F1 score":"0.1441 ± 0.0016"},"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":18,"model":"EGC-S (No Edge Features)","metrics":{"Ext. data":"No","Number of params":"11156530","Test F1 score":"0.1528 ± 0.0025","Validation F1 score":"0.1427 ± 0.0020"},"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":19,"model":"GCN","metrics":{"Ext. data":"No","Number of params":"11033210","Test F1 score":"0.1507 ± 0.0018","Validation F1 score":"0.1399 ± 0.0017"},"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":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":20,"model":"GIN","metrics":{"Ext. data":"No","Number of params":"12390715","Test F1 score":"0.1495 ± 0.0023","Validation F1 score":"0.1376 ± 0.0016"},"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":21,"model":"DiffPool w/ graphSAGE","metrics":{"Ext. data":"No","Number of params":"10095826","Test F1 score":"0.1401 ± 0.0012","Validation F1 score":"0.1405 ± 0.0012"},"uses_additional_data":false,"paper_date":"2018-06-22","paper":"/paper/hierarchical-graph-representation-learning","paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool","n_code_links":14,"syntology":{"n_ran":1,"n_unverified":19,"n_samples":20,"n_pointer_only_licence":0}}],"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,264 of the 9,581 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":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+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":10,"rows_with_any_sample_ran":10,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":98,"n_unverified":147,"n_samples":245,"n_pointer_only_licence":70,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":132,"n_unverified":181,"n_samples":313,"n_pointer_only_licence":97,"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"}}}