{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","arxiv_id":"2306.05955","date":"2023-06-09","proceeding":null,"authors":["Gaspard Michel","Giannis Nikolentzos","Johannes Lutzeyer","Michalis Vazirgiannis"],"abstract":"Graph neural networks (GNNs) have recently become the standard approach for learning with graph-structured data. Prior work has shed light into their potential, but also their limitations. Unfortunately, it was shown that standard GNNs are limited in their expressive power. These models are no more powerful than the 1-dimensional Weisfeiler-Leman (1-WL) algorithm in terms of distinguishing non-isomorphic graphs. In this paper, we propose Path Neural Networks (PathNNs), a model that updates node representations by aggregating paths emanating from nodes. We derive three different variants of the PathNN model that aggregate single shortest paths, all shortest paths and all simple paths of length up to K. We prove that two of these variants are strictly more powerful than the 1-WL algorithm, and we experimentally validate our theoretical results. We find that PathNNs can distinguish pairs of non-isomorphic graphs that are indistinguishable by 1-WL, while our most expressive PathNN variant can even distinguish between 3-WL indistinguishable graphs. The different PathNN variants are also evaluated on graph classification and graph regression datasets, where in most cases, they outperform the baseline methods.","url_abs":"https://arxiv.org/abs/2306.05955v1","url_pdf":"https://arxiv.org/pdf/2306.05955v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"path-neural-networks-expressive-and-accurate","repo_url":"https://github.com/gasmichel/pathnns_expressive","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-regression","task_name":"Graph Regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-peptides-func","task":"Graph Classification","dataset":"Peptides-func","model":"PathNN","rank_in_archive_order":22,"of":44,"metrics":{"AP":"0.6816±0.0026"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-peptides-struct","task":"Graph Regression","dataset":"Peptides-struct","model":"PathNN","rank_in_archive_order":29,"of":39,"metrics":{"MAE":"0.2545±0.0032"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2306.05955","atlas_url":"https://app.syntology.ai/?focus=2306.05955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05955"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/gasmichel/pathnns_expressive","reach":null}],"summary":{"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"36224943b5999acf","entry":"test","repo":"gasmichel/pathnns_expressive","repo_kind":"official","path":"TUDatasets/main_splits.py","file_url":"https://github.com/gasmichel/pathnns_expressive/blob/HEAD/TUDatasets/main_splits.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"36224943b5999acf"}},{"code_sha256_prefix":"5b169d0b0c8ccb51","entry":"train","repo":"gasmichel/pathnns_expressive","repo_kind":"official","path":"TUDatasets/main_splits.py","file_url":"https://github.com/gasmichel/pathnns_expressive/blob/HEAD/TUDatasets/main_splits.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5b169d0b0c8ccb51"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}