Type-Aware Heterogeneous Graph Network for Circuit Link Prediction
Open Access
- 12 November 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 32 (2) , 1-22
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 .Keywords
Funding Information
- Fundamental Research Funds for the Central Universities (3132025265)
- National Natural Science Foundation of China (62472062)
This publication has 23 references indexed in Scilit:
- Graph Neural Networks Based Analog Circuit Link PredictionEngineering Applications of Artificial Intelligence, 2025
- AMSnet-KG: A Netlist Dataset for LLM-based AMS Circuit Auto-Design Using Knowledge Graph RAGACM Transactions on Design Automation of Electronic Systems, 2025
- Conformalized Link Prediction on Graph Neural Networks2024
- CircuitNet: An Open-Source Dataset for Machine Learning in VLSI CAD Applications With Improved Domain-Specific Evaluation Metric and Learning StrategiesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023
- Circuit design completion using graph neural networksNeural Computing and Applications, 2023
- Pretraining Graph Neural Networks for Few-Shot Analog Circuit Modeling and DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022
- Elementary Subgraph Features for Link Prediction With Neural NetworksIEEE Transactions on Knowledge and Data Engineering, 2021
- Machine Learning for Electronic Design Automation: A SurveyACM Transactions on Design Automation of Electronic Systems, 2021
- Weisfeiler-Lehman Neural Machine for Link Prediction2017
- Densely Connected Convolutional Networks2017