mlsanityData to 14 Oct 2026

ParasGB: A Graph Benchmark Suite for Parasitic Estimation on AMS Circuits

arXiv 2607.23225 ↗First posted 25 Jul 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

As chip manufacturing processes advance to deep submicron nodes, parasitic interconnect effects increasingly dominate the performance of analog and mixed-signal (AMS) circuits and often lead to costly layout iterations. This makes early-stage estimation of parasitic capacitance and resistance important for parasitic-aware design exploration before full physical implementation. However, progress on GNN-based parasitic modeling has been hindered by the lack of public, high-fidelity RC benchmarks that support reproducible evaluation. To address this gap, we introduce ParasGB, the first open-source benchmark suite for pre-layout parasitic parameter prediction on circuit graphs. ParasGB provides large-scale, heterogeneous RC networks extracted with commercial EDA tools from tape-out-proven designs, together with a unified evaluation protocol covering node-level ground capacitance, edge-level resistance, and edge-level coupling capacitance. Within this framework, we benchmark diverse GNN architectures using a standardized training pipeline and expose challenges such as extreme label imbalance, long-tailed parasitic distributions, and strong structural heterogeneity. By establishing a physically grounded and standardized benchmark for early-stage parasitic prediction, ParasGB provides an open platform for reproducible research on circuit graph learning and parasitic-aware model development. All datasets, preprocessing scripts, and configurations are publicly available in our code repository https://github.com/ShenShan123/ParasGB.git.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 50 references that are in the map. First posted on arXiv 25 Jul 2026.

Builds on

17 of 50 references.

References · 17

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 133
  7. 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
  8. 2024Polynormer: Polynomial-Expressive Graph Transformer in Linear Timecited by 65
  9. 2025AnalogGenie: A Generative Engine for Automatic Discovery of Analog Circuit Topologiescited by 37
  10. 2024AMSNet: Netlist Dataset for AMS Circuitscited by 25
  11. 2022CircuitNet: An Open-Source Dataset for Machine Learning Applications in Electronic Design Automation (EDA)cited by 11
  12. 2022TAG: Learning Circuit Spatial Embedding From Layoutscited by 9
5 more
  1. 2019TS Cache: A Fast Cache with Timing-speculation Mechanism Under Low Supply Voltagescited by 3
  2. 2023Ultra8T: A Sub-Threshold 8T SRAM with Leakage Detectioncited by 3
  3. 2023Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factorcited by 2
  4. 2025OpenYield: An Open-Source SRAM Yield Analysis and Optimization Benchmark Suitecited by 2
  5. 2025Transferable Parasitic Estimation via Graph Contrastive Learning and Label Rebalancing in AMS Circuitscited by 1

Built on by

Not cited yet.