Type-Aware Heterogeneous Graph Network for Circuit Link Prediction

Link prediction for circuit completion is a crucial task in Electronic Design Automation (EDA), aiming to infer missing connections in incomplete circuits to accelerate design workflows and ensure Printed Circuit Board (PCB) reliability. However, due to the practical reality that circuit connectivity is defined by nets that connect specific pins of component instances, existing methods that rely on homogeneous representations and scalar shortest path distances collapse pin-level constraints into a single proximity signal. This collapse obscures component identities and pin semantics, and fails to capture long-range functional paths, which can slow design closure and potentially compromise PCB reliability by increasing the risk of electrically invalid links and subsequent rework. Addressing these challenges, we present a T ype-aware H eterogeneous G raph network for C ircuit link prediction ( THGC ), which enables accurate circuit link prediction by explicitly preserving component functional semantics and modeling type-aware dependencies. Specifically, THGC constructs a circuit-aware heterogeneous graph from netlists to preserve physical connectivity and component semantics, and refines representations through a multi-view encoder with Type-Aware Distance Encoding (TADE) to capture non-local dependencies. It then performs circuit-oriented link prediction using a heterogeneous graph network with dense convolutions and global sort pooling, optimized by a composite objective enforcing topological and semantic consistency, to predict electrically feasible missing connections for circuit completion. Comprehensive experiments are performed on 6,195 circuits collected from three benchmarks, and the results demonstrate that THGC consistently outperforms state-of-the-art methods, achieving up to a 47.51% relative improvement in terms of AUC. These results confirm that THGC effectively preserves component functional semantics and captures type-aware non-local dependencies for accurate circuit link prediction. The source code is available at https://anonymous.4open.science/r/THGC.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Design Automation of Electronic Systems
Published
2026-06-17
DOI
https://doi.org/10.1145/3821441
Primary Topic
VLSI and FPGA Design Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Type-Aware Heterogeneous Graph Network for Circuit Link Prediction

He Jiang, Wenjun Tang, Shikai Guo, Rubing Huang et al.
ACM Transactions on Design Automation of Electronic Systems
VLSI and FPGA Design Techniques
article

Type-Aware Heterogeneous Graph Network for Circuit Link Prediction

He Jiang, Wenjun Tang, Shikai Guo, Rubing Huang, Min Feng, Qian Ma, Hui Li, Meilin Li
article en

Abstract

Link prediction for circuit completion is a crucial task in Electronic Design Automation (EDA), aiming to infer missing connections in incomplete circuits to accelerate design workflows and ensure Printed Circuit Board (PCB) reliability. However, due to the practical reality that circuit connectivity is defined by nets that connect specific pins of component instances, existing methods that rely on homogeneous representations and scalar shortest path distances collapse pin-level constraints into a single proximity signal. This collapse obscures component identities and pin semantics, and fails to capture long-range functional paths, which can slow design closure and potentially compromise PCB reliability by increasing the risk of electrically invalid links and subsequent rework. Addressing these challenges, we present a T ype-aware H eterogeneous G raph network for C ircuit link prediction ( THGC ), which enables accurate circuit link prediction by explicitly preserving component functional semantics and modeling type-aware dependencies. Specifically, THGC constructs a circuit-aware heterogeneous graph from netlists to preserve physical connectivity and component semantics, and refines representations through a multi-view encoder with Type-Aware Distance Encoding (TADE) to capture non-local dependencies. It then performs circuit-oriented link prediction using a heterogeneous graph network with dense convolutions and global sort pooling, optimized by a composite objective enforcing topological and semantic consistency, to predict electrically feasible missing connections for circuit completion. Comprehensive experiments are performed on 6,195 circuits collected from three benchmarks, and the results demonstrate that THGC consistently outperforms state-of-the-art methods, achieving up to a 47.51% relative improvement in terms of AUC. These results confirm that THGC effectively preserves component functional semantics and captures type-aware non-local dependencies for accurate circuit link prediction. The source code is available at https://anonymous.4open.science/r/THGC.

ACM Transactions on Design Automation of Electronic Systems
Macau University of Science and Technology (MO), Chinese Academy of Sciences (CN), Dalian University of Technology (CN), Institute of Computing Technology (CN), Dalian Maritime University (CN)
Openalex Percentile: Top 11%
VLSI and FPGA Design Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.