{"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/using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","arxiv_id":"2310.15865","date":"2023-10-24","proceeding":null,"authors":["Franziska Heeg","Ingo Scholtes"],"abstract":"Node centralities play a pivotal role in network science, social network analysis, and recommender systems. In temporal data, static path-based centralities like closeness or betweenness can give misleading results about the true importance of nodes in a temporal graph. To address this issue, temporal generalizations of betweenness and closeness have been defined that are based on the shortest time-respecting paths between pairs of nodes. However, a major issue of those generalizations is that the calculation of such paths is computationally expensive. Addressing this issue, we study the application of De Bruijn Graph Neural Networks (DBGNN), a time-aware graph neural network architecture, to predict temporal path-based centralities in time series data. We experimentally evaluate our approach in 13 temporal graphs from biological and social systems and show that it considerably improves the prediction of betweenness and closeness centrality compared to (i) a static Graph Convolutional Neural Network, (ii) an efficient sampling-based approximation technique for temporal betweenness, and (iii) two state-of-the-art time-aware graph learning techniques for dynamic graphs.","url_abs":"https://arxiv.org/abs/2310.15865v2","url_pdf":"https://arxiv.org/pdf/2310.15865v2.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":"using-causality-aware-graph-neural-networks","repo_url":"https://github.com/pathpy/pathpyg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"AGPL-3.0"}}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"time-series-1","task_name":"Time Series"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/pathpy/pathpyg","reach":{"status":"ok","spdx":"AGPL-3.0"}}],"summary":{"ran":4},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"d0c055f0457b0c15","entry":"aggregate_node_attributes","repo":"pathpy/pathpyg","repo_kind":"official","path":"src/pathpyG/algorithms/lift_order.py","file_url":"https://github.com/pathpy/pathpyg/blob/HEAD/src/pathpyG/algorithms/lift_order.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"d0c055f0457b0c15"}},{"code_sha256_prefix":"5573040885a5d8d0","entry":"lift_order_edge_index","repo":"pathpy/pathpyg","repo_kind":"official","path":"src/pathpyG/algorithms/lift_order.py","file_url":"https://github.com/pathpy/pathpyg/blob/HEAD/src/pathpyG/algorithms/lift_order.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"5573040885a5d8d0"}},{"code_sha256_prefix":"4456b5c765ff2a97","entry":"lift_order_edge_index_weighted","repo":"pathpy/pathpyg","repo_kind":"official","path":"src/pathpyG/algorithms/lift_order.py","file_url":"https://github.com/pathpy/pathpyg/blob/HEAD/src/pathpyG/algorithms/lift_order.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"4456b5c765ff2a97"}},{"code_sha256_prefix":"860743ab3e1227ce","entry":"max_edges","repo":"pathpy/pathpyg","repo_kind":"official","path":"src/pathpyG/algorithms/generative_models.py","file_url":"https://github.com/pathpy/pathpyg/blob/HEAD/src/pathpyG/algorithms/generative_models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"860743ab3e1227ce"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}