{"url":"/sota/node-classification-on-paris","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Paris","url":"/dataset/city-networks"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**Node Classification** is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.\r\n\r\n**Node Classification** models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like [Cora](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</span>","description_from":"task","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":["Average Top-1 Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Average Top-1 Accuracy":"higher"}},"counts":{"rows":5,"rows_with_code":5,"rows_with_paper_page":5,"rows_dated":5,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"IM-GCN","metrics":{"Average Top-1 Accuracy":"55.3  ± 0.3"},"uses_additional_data":false,"paper_date":"2025-05-29","paper":"/paper/improving-the-effective-receptive-field-of","paper_url":"https://arxiv.org/abs/2505.23185v1","paper_title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","code":"https://github.com/bgu-cs-vil/im-mpnn","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"ChebNet","metrics":{"Average Top-1 Accuracy":"49.5  ± 0.4"},"uses_additional_data":false,"paper_date":"2025-03-12","paper":"/paper/towards-quantifying-long-range-interactions","paper_url":"https://arxiv.org/abs/2503.09008v1","paper_title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","code":"https://github.com/leonresearch/city-networks","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":3,"model":"GraphSAGE","metrics":{"Average Top-1 Accuracy":"49.1 ± 0.6"},"uses_additional_data":false,"paper_date":"2025-03-12","paper":"/paper/towards-quantifying-long-range-interactions","paper_url":"https://arxiv.org/abs/2503.09008v1","paper_title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","code":"https://github.com/leonresearch/city-networks","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":4,"model":"GCN","metrics":{"Average Top-1 Accuracy":"47.3 ± 0.2"},"uses_additional_data":false,"paper_date":"2025-03-12","paper":"/paper/towards-quantifying-long-range-interactions","paper_url":"https://arxiv.org/abs/2503.09008v1","paper_title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","code":"https://github.com/leonresearch/city-networks","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":5,"model":"SGFormer","metrics":{"Average Top-1 Accuracy":"45.0 ± 0.2"},"uses_additional_data":false,"paper_date":"2025-03-12","paper":"/paper/towards-quantifying-long-range-interactions","paper_url":"https://arxiv.org/abs/2503.09008v1","paper_title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","code":"https://github.com/leonresearch/city-networks","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":5,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":3,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":13,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":12,"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"}}}