CORTEXA
← Browse
arxivcs.LGcs.AI2026-06-26

Learning Structural Manipulability in Gate-Level Netlists Using Graph Neural Networks

Rupesh Raj Karn, Ozgur Sinanoglu

Gate-level netlists exhibit intrinsic structural properties that influence signal propagation independently of functional simulation. We define a topology-driven structural manipulability score that characterizes node-level structural flexibility using path participation, k-core embedding, symmetry, and centrality. Modeling netlists as directed graphs, we formulate node-level regression to learn this topology-derived score using graph neural networks (GNNs). Experiments on ISCAS85 and EPFL benchmarks evaluate how effectively different GNN architectures approximate this metric across held-out circuits, with hierarchical models yielding the most consistent rankings. Component-level and ablation analyses examine the contribution of individual factors. As an illustrative case study, analysis of Trojan-injected circuits using TrustHub templates reveals statistically distinguishable structural patterns, indicating that topology-based scoring provides complementary structural insight.

View free PDFSource page

Related papers

arxivcs.LGcs.AI2026-06-29

T3R: Deeper Test-Time Adaptation for Graph Neural Networks via Gradient Rotation

Huy Truong, Alexander Lazovik, Victoria Degeler

Graph Neural Networks (GNNs) deployed in real-world systems typically have fixed weights, often leading to degraded performance under distribution shifts. This issue can be mitigated by conventional fine-tuning, but in many real-world cases, collecting labeled data is expensive o…

View free PDFSource page
arxivcs.LGcs.AI2026-07-02

SA-HGNN: Sample-Adaptive Hyperbolic Graph Neural Network for EEG-Based Depression Recognition

Yang Li, Pan Hu, Yan Zhang, Wenfan Yang, Tao Wu, Lianbo Guo

Graph Neural Networks (GNNs) have been widely used to capture spatial functional connectivity patterns to improve electroencephalography (EEG)-based depression recognition performance. However, the functional connectivity of brain networks in patients with depression exhibits an…

View free PDFSource page
arxivcs.LGcs.AI2026-07-08

path_boost: A Python Package for Interpretable Graph-Level Prediction using Path-Based Gradient Boosting

Claudio Meggio, Johan Pensar, Riccardo De Bin

We present path_boost, a Python package for interpretable supervised learning on graph-structured input data. The package implements PathBoost, a gradient boosting algorithm that automatically discovers predictive labeled paths within graphs during the learning process. Unlike gr…

View free PDFSource page
arxivcs.AIcs.LGcs.NI2026-07-15

AI-Driven Multi-Hop Relay Selection for Smart Urban NR-V2X Networks via Learning-to-Optimize Graph Neural Networks

Giambattista Amati, Federica Mangiatordi, Simone Angelini, Emiliano Pallotti, Pierpaolo Salvo

Reliable and low-latency NR-V2X communications are essential for smart mobility in dense urban environments. However, limited Road-Side Unit (RSU) density, frequent non-line-of-sight conditions, and highly dynamic vehicular topologies often prevent many Connected and Automated Ve…

View free PDFSource page
arxivcs.LGcs.AIcs.CV2026-07-10

A Graph Neural Network approach to zero-shot Digital Twins

Alicia Tierz, Icíar Alfaro, David González, Elías Cueto

Traditional Predictive Digital Twins often remain geometrically rigid, requiring extensive retraining or fine-tuning whenever the underlying physical domain or boundary conditions change. To overcome this limitation, we present a novel framework for \textit{Zero-Shot Digital Twin…

View free PDFSource page