GRAPHITE — Generative Reasoning and Analysis for Predictive Handling in Traffic Efficiency

The automatic identification of the topology of power networks is important for the data-driven and situation-aware operation of power grids. Traditional methods of topology identification lack a data-tolerant mechanism, and the accuracy of their performance in terms of identification is thus affected by the quality of data. Topology identification is related to the link prediction problem. The graph neural network can be used to predict the state of unlabeled nodes (lines) through training on features of labeled nodes (lines) with fault tolerance. Inspired by the characteristics of the graph neural network, we applied it to topology identification in this study. We propose a method to identify the topology of a power network based on a knowledge graph and the graph neural network. Traditional knowledge graphs can quickly mine possible connections between entities and generate graph structure data, but in the case of errors or informational conflicts in the data, they cannot accurately determine whether the relationships between the entities really exist. The graph neural network can use data mining to determine whether a connection obtained between entities is based on their eigenvalues, and has a fault tolerance mechanism to adapt to errors and informational conflicts in the graph data, but needs the graph data as database. The combination of the knowledge graph and the graph neural network can compensate for the deficiency of the single knowledge graph method. We tested the proposed method by using the IEEE 118-bus system and a provincial network system. The results showed that our approach is feasible and highly fault tolerant. It can accurately identify network topology even in the presence of conflicting and missing measurement-related information.

Multitype view of knowledge contrastive learning for recommendation

Recent studies have shown that the problems of cold processing and data sparsity in recommender systems can be well alleviated with the help of knowledge graph information. Meanwhile, since the information in recommender systems can be represented by graph data structure, graph neural network has great advantages in recommendatory system. Therefore, graph neural network can better mine the deep relationship between objects in the recommender systems which combines with information from knowledge graph. This paper reviews the application of graph neural network in knowledge graph aided recommendation systems. Specifically, this paper firstly sorts out the related knowledge of knowledge graph, recommendation system and graph neural network, including the cold processing and data sparsity, the structure of knowledge graph, and the basic modules of graph neural network. This paper also summarizes the methods such as KGAT and CKAN used in knowledge graph aided recommendation systems in recent years, and gives some discussion on the development of this field.

Entity Alignment (EA) aims to identify equivalent entities across different Knowledge Graphs (KGs), enabling knowledge fusion and integration. In recent years, Graph Neural Networks (GNNs) have emerged as a powerful paradigm for EA by leveraging structural information in KGs. However, most existing studies emphasize novel message passing mechanisms while overlooking other crucial GNN design components. This paper presents a comprehensive and systematic evaluation of GNN-based EA methods, focusing on three key aspects: message passing strategies, the number of GNN layers, and the construction of final entity representations. We benchmark a diverse set of GNN models originally developed for tasks such as node classification and knowledge graph completion, and we assess their adaptability to the EA task. Additionally, we explore the effectiveness of skip connection techniques, activation functions, and relational information integration. Our experiments, conducted on standard EA benchmarks including DBP15K and SRPRS, reveal several counterintuitive findings: (1) message passing is indispensable for EA; (2) many node classification GNNs are highly competitive for EA; (3) one or two GNN layers generally achieve optimal performance; and (4) activation functions have minimal impact, while skip connections significantly enhance results. This study provides a principled framework and empirical foundation for designing more effective GNN-based EA models. Code and datasets are publicly available at <uri xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://github.com/kg-bnu/GNN-EA">https://github.com/kg-bnu/GNN-EA</uri>.

A knowledge graph (KG) consists of numerous triples, in which each triple, i.e., (head entity, relation, tail entity), denotes a real-world assertion. Many large-scale KGs have been developed, e.g., general-purpose KGs Freebase and YAGO. Also, lots of domain-specific KGs are emerging, e.g., COVID-19 KGs, biomedical KGs, and agricultural KGs. By embedding KGs into low-dimensional vectors, i.e., representations of entities and relations, we could integrate KGs into machine learning models and enhance the performance of many prediction tasks, including search, recommendations, and question answering. During the construction, refinement, embedding, and application of KGs, a variety of KG learning algorithms have been developed to handle challenges in various real-world scenarios. Moreover, graph neural networks have also brought new opportunities to KG learning. This workshop aims to engage with active researchers from KG communities, recommendation communities, natural language processing communities, and other communities, and deliver state-of-the-art research insights into the core challenges in KG learning.

This study proposes an AI-OSINT framework for transnational religious figures, linking knowledge graphs, graph neural networks and Bayesian updating into a computable evidence chain to reconstruct and quantify the overseas assets and foreign contacts of Shi Yongxin and the Shaolin system (2024-11-2025-06). Combining GCN/GAT with unsupervised anomaly detection (Isolation Forest, LOF) on heterogeneous time-series graphs and Bayesian modelling to form monthly outputs of Religious Diplomatic Risk Index (RDRI, 0-100), assessed by ROC-AUC/AUPRC; link prediction by MRR/Hits@k. The results show that the Vatican meeting (2025-02-01) triggered a short-term peak, with the RDRI rising from c. 24-27 to c. 42, and reaching c. 45 in 2025-03; the subsequent chain of "foundations/cultural centres → out-of-country activities" maintained the index at a medium-term high of c. 40 (±3), with a medium-term high of c. 40 (±3), and a medium-term high of c. 40 (±3). The "Foundation/Cultural Centre → Outbound Activities" chain maintains the index at a medium-term high of ~40 (±3), showing a double-engine rhythm of "event amplification + resource penetration". The reported uncertainty interval is ±3; and the conclusion level is shown to be stable under a priori/likelihood ±10% perturbation. The framework enhances the systematic and verifiable study of transnational religious networks without relying on internal intelligence and is transferable to other religious or transnational NGO contexts; to avoid misuse, the RDRI is defined as an early warning scale rather than a factual or judicial characterisation (all judgements cross-checked against registered and chained anchors).Keywords: knowledge graph; graph neural networks; religious diplomacy; financial anomalies; OSINT

Modern cities heavily rely on complex transportation, making accurate traffic speed prediction crucial for traffic management authorities. Classical methods, including statistical techniques and traditional machine learning techniques, fail to capture complex relationships, while deep learning approaches may have weaknesses such as error accumulation, difficulty in handling long sequences, and overlooking spatial correlations. Graph neural networks (GNNs) have shown promise in extracting spatial features from non-Euclidean graph structures, but they usually initialize the adjacency matrix based on distance and may fail to detect hidden statistical correlations. The choice of correlation measure can have a significant impact on the resulting adjacency matrix and the effectiveness of graph-based models. This thesis proposes a novel approach for accurately forecasting traffic patterns by utilizing a multi-view spatio-temporal graph neural network that captures data from both realistic and statistical domains. Unlike traditional correlation measures such as Pearson correlation, copula models are utilized to extract hidden statistical correlations and construct multivariate distribution functions to obtain the correlation relationship among traffic nodes. A two-step approach is adopted, which involves selecting and testing different types of bivariate copulas to identify the ones that best fit the traffic data, and utilizing these copulas to create multi-weight adjacency matrices. The second step involves utilizing a graph convolutional network to extract spatial information and capturing temporal trends using dilated causal convolutions. The proposed ST-CopulaGNN model outperforms previous approaches such as DCRNN and Graph WaveNet, indicating the effectiveness of incorporating copulas in trafficforecasting. Experiments on theMETR-LA and PEMS-BAY datasets show that the proposed model outperforms previous approaches with a slight improvement.

Traffic flow forecasting is an essential task of an intelligent transportation system (ITS), closely related to intelligent transportation management and resource scheduling. Dynamic spatial-temporal dependencies in traffic data make traffic flow forecasting to be a challenging task. Most existing research cannot model dynamic spatial and temporal correlations to achieve well-forecasting performance. The multi-head self-attention mechanism is a valuable method to capture dynamic spatial-temporal correlations, and combining it with graph convolutional networks is a promising solution. Therefore, we propose a multi-head self-attention spatiotemporal graph convolutional network (MSASGCN) model. It can effectively capture local correlations and potential global correlations of spatial structures, can handle dynamic evolution of the road network, and, in the time dimension, can effectively capture dynamic temporal correlations. Experiments on two real datasets verify the stability of our proposed model, obtaining a better prediction performance than the baseline algorithms. The correlation metrics get significantly reduced compared with traditional time series prediction methods and deep learning methods without using graph neural networks, according to MAE and RMSE results. Compared with advanced traffic flow forecasting methods, our model also has a performance improvement and a more stable prediction performance. We also discuss some problems and challenges in traffic forecasting.

Numerical simulation of underground CO2 storage requires accurate, fast and field-scale calculations of saturation and reservoir pressures, yet high-fidelity physics-based simulators are computationally expensive to do a rapid analysis. Recent advances in deep learning, especially Graph Neural Networks (GNNs), offer promising alternatives by approximating simulation outputs while dramatically reducing computational costs by minimizing the total reliance on traditional simulators. However, training GNN models on large-scale, spatiotemporal datasets remains a significant bottleneck when constrained to a single GPU. To address the computational bottleneck of training GNN on large-scale and high-resolution datasets, we propose to use multi-GPU scalable training of GNNs. The U-Net Enhanced Graph Neural Network (U-GCN) specifically was adopted to predict the spatiotemporal evolution of gas saturation and pressure buildup in CO2 storage in saline aquifers. The UGCN model was trained across multiple GPUs, allowing for concurrent gradient computations and parameter updates on separate GPU processes. The model operates natively on regular reservoir meshes to learn spatiotemporal evolution of pressure and saturation from thousands of simulation cases, and the training pipeline couples process-per-GPU data parallelism with a node-local caching strategy that deamplifies the source data file (in Hierarchical Data Format HDF5 format) Input-Output (I/O) by performing a single deserialization per node and broadcasting preprocessed graphs to sibling ranks. This eliminates multi-node startup contention and renders runs compute bound. Scaling experiments from 1 to 16 GPUs demonstrate substantial wall-clock reductions while preserving validation behavior. With per-GPU batch size 100, total training time decreased from 955.46 s (1 GPU) to 145.17 s (16 GPUs), a 6.58× speedup (≈41% parallel efficiency). With per-GPU batch size 8, time decreased from 5519.00 s to 1047.17 s, a 5.27× speedup (≈33% efficiency). The speedups are reported per epoch. Cross-node overheads relative to ideal doubling were ∼11–35%, more pronounced at small per-GPU batches where collective latency dominates. Training and validation losses rose modestly as GPU count increased under weak scaling—consistent with the larger global batch and fewer optimizer updates per epoch—yet validation tracked training across all settings, indicating stable generalization and no data leakage. These effects are mitigated by standard large-batch remedies (e.g., linear learning-rate scaling with warmup, longer schedules, optional gradient accumulation). By integrating domain-aware batching, multi-GPU data parallelism, mixed precision, and node-local caching with a GNN tailored to structured meshes, the proposed approach delivers a reproducible, high-throughput storage surrogate training regime that scales to multi-node clusters without compromising model validity. The resulting surrogates enable rapid scenario screening and outer-loop workflows (optimization and UQ) at orders-of-magnitude lower training cost compared to conventional GNN training on single a GPU baseline.

In recent years, the related research of entity alignment has mainly focused on entity alignment via knowledge embeddings and graph neural networks; however, these proposed models usually suffer from structural heterogeneity and the large-scale problem of knowledge graph. A novel entity alignment model based on graph isomorphic network and compressed sensing is proposed. First, for the problem of structural heterogeneity, graph isomorphic network encoder is applied in knowledge graph to capture structural similarity of entity relation. Second, for the problem of large scale, key node and community are integrated for priority entity alignment to improve execution speed. However, the exiting node importance ranking algorithm cannot accurately identify key node in knowledge graph. So the compressed sensing is adopted in node importance ranking to improve the accuracy of identifying key node. The authors have carried out several experiments to test the effect and efficiency of the proposed entity alignment model.

Federated learning has been applied to various tasks in intelligent transportation systems to protect data privacy through decentralized training schemes. The majority of the state-of-the-art models in intelligent transportation systems (ITS) are graph neural networks (GNN)-based for spatial information learning. When applying federated learning to the ITS tasks with GNN-based models, the existing frameworks can only protect the data privacy; however, ignore the one of topological information of transportation networks. In this article, we propose a novel federated learning framework to tackle this problem. Specifically, we introduce a differential privacy-based adjacency matrix preserving approach for protecting the topological information. We also propose an adjacency matrix aggregation approach to allow local GNN-based models to access the global network for a better training effect. Furthermore, we propose a GNN-based model named attention-based spatial-temporal graph neural networks (ASTGNN) for traffic speed forecasting. We integrate the proposed federated learning framework and ASTGNN as FASTGNN for traffic speed forecasting. Extensive case studies on a real-world dataset demonstrate that FASTGNN can develop accurate forecasting under the privacy preservation constraint.

A review of graph neural networks and pretrained language models for knowledge graph reasoning

Graph neural networks have been paid a lot attentions in recent years since many real-word data can naturally be represented by graph structures. Graph neural networks such as GCNs and GATs mainly focus on node features while ignoring edge features in graphs. However, in many graph structure data such as knowledge graphs, social networks, edge features are also important as they contain vital information about relations between nodes which are commonly ignored or simplified into binary or scalar values by existing methods. In this work we build a novel learning method on graphs called GNN-EE, i.e. GNN with Edge Enhanced, which takes both the node features and edge features into account while updating representations of graph components and can be applied to most of the common graph neural networks such as GCNs and GATs. Our GNN-EE method fits in the message-passing framework and thus is easy to generalize. In addition, we extend the random-walk-based algorithms on graphs so that they can consider both node and edge features on graphs. We use those random-walk-based algorithms as a pre-training method on graph with few initial features. We demonstrate the effectiveness and flexibility of our GNN-EE method through entity classification tasks and graph classification tasks.

In the era of digital transformation, personalized recommendation systems play a critical role in mitigating information overload by guiding users toward relevant content, products, and services. Traditional approaches such as Collaborative Filtering and Content-Based Filtering, while widely adopted, struggle with cold-start issues, data sparsity, and the inability to capture complex relationships within heterogeneous data. Recent advances in Graph Neural Networks (GNNs) present a promising paradigm, as user–item interactions, social connections, and knowledge graphs naturally exhibit graph structures. However, despite growing interest, there remains a lack of systematic reviews focusing specifically on the application of GNNs to personalized recommendation systems. This survey addresses that gap by analyzing recent studies from 2020 to 2025, classifying GNN architectures (e.g., GCN, GAT, GraphSAGE, LightGCN, and specialized variants), and mapping their application across collaborative, content-based, and hybrid recommendation strategies. The findings highlight GNNs’ superior ability to address cold-start and sparsity challenges, enhance personalization, and improve interpretability through integration with knowledge graphs. By consolidating current advancements and open challenges, this study contributes a comprehensive reference that bridges theoretical development with practical needs, while outlining future directions for more scalable, explainable, and ethical recommender systems.

In recent years, entertainment content, such as movies, music, and anime, has been gaining attention due tothe stay-at-home demand caused by the expansion of COVID-19. In the content domain, research in the field ofknowledge representation is primarily concerned with accurately describing metadata. Therefore, different knowledgerepresentations are required for applications in downstream tasks. In this study, we aim to clarify effectiveknowledge representation for predicting users’ latent preferences through a case study of an anime recommendationtask. We developed hypotheses from both quantitative and qualitative aspects on how to represent work knowledgeto improve recommendation performance, and verified them by changing the structure of knowledge representationaccording to the hypothesis. Initially, we constructed a Knowledge Graph (KG) by integrating domain-specific andgeneral-purpose data sources through the process of entity matching and imposing constraints on the properties.Subsequently, we constructed multiple KGs by varying the knowledge configuration. Specifically, we changed thecomposition of the data sources considered in the KG construction or excluded a triplet associated with an arbitraryproperty. After that, we fed the constructed KGs into the graph neural network recommender model and comparedthe recommendation performance. As a result, it was shown that the recommendation performance based on the KGcomposed of multiple data sources was the best, thus supporting the hypothesis from a quantitative aspect. Next,an ablation study on the properties revealed that knowledge characterizing the work itself contributed to the recommendationperformance, thus supporting the hypothesis from a qualitative aspect. Furthermore, we constructed atext-based KG by generating a new vocabulary from the “synopsis” text. It can describe the work’s storyline andworldview in more detail. We take it as an input to a Large Language Model (LLM) and extend the existing metadatabasedKG. The results showed that the KG considering both metadata and text had the best overall recommendationperformance, again confirming the hypothesis.