R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII

• URL: http://arxiv.org/abs/2604.08810v1
• Date: Thu, 09 Apr 2026 22:59:27 GMT
• Title: R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII
• Abstract summary: R2G is a multi-view circuit-graph benchmark suite that standardizes five stage-aware views with information parity.<n>R2G provides an end-to-end DEF-to-graph pipeline spanning synthesis, placement, and routing stages.
• Score: 14.790942679912595
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph neural networks (GNNs) are increasingly applied to physical design tasks such as congestion prediction and wirelength estimation, yet progress is hindered by inconsistent circuit representations and the absence of controlled evaluation protocols. We present R2G (RTL-to-GDSII), a multi-view circuit-graph benchmark suite that standardizes five stage-aware views with information parity (every view encodes the same attribute set, differing only in where features attach) over 30 open-source IP cores (up to $10^6$ nodes/edges). R2G provides an end-to-end DEF-to-graph pipeline spanning synthesis, placement, and routing stages, together with loaders, unified splits, domain metrics, and reproducible baselines. By decoupling representation choice from model choice, R2G isolates a confound that prior EDA and graph-ML benchmarks leave uncontrolled. In systematic studies with GINE, GAT, and ResGatedGCN, we find: (i) view choice dominates model choice, with Test R$^2$ varying by more than 0.3 across representations for a fixed GNN; (ii) node-centric views generalize best across both placement and routing; and (iii) decoder-head depth (3--4 layers) is the primary accuracy driver, turning divergent training into near-perfect predictions (R$^2$$>$0.99). Code and datasets are available at https://github.com/ShenShan123/R2G.

Related papers

• Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification [1.0736626320566707]
  Multi-Channel Physics-Aware Random Walk Fingerprints (MC-PA-RWF) for power systems.<n>A lightweight graph-level representation framework that introduces physical edge states into random propagation propagation.<n>MC-PA-RWF+ achieves around 98.04% - 99.32% balanced accuracy and improves failure-class F1 over the strongest GNN baseline by 1.60 -- 5.84 percentage points.
  arXiv  Detail & Related papers  (2026-09-04T09:52:24Z)
• Noesis: Bidirectional Graph-RAG with Adaptive Parallelism and Cross-Knowledge-Base Semantic Discovery [0.0]
  Graph-RAG has emerged as a powerful paradigm for grounding large language models in domain-specific corpora.<n>Existing systems face persistent limitations: (1) static chunking fragments long documents, losing cross-section semantic connections; (2) ingestion pipelines do not scale adaptively; and (3) multi-domain deployments require either a monolithic knowledge base that dilutes retrieval precision or manual user routing.<n>We present Noesis, a decoupled Graph-RAG architecture addressing these limitations through four algorithms: (a) Bidirectional Graph Traversal with a Graph-Feedback Context Resolver simulating human reading with degrading memory; (b) an AIMD Con
  arXiv  Detail & Related papers  (2026-08-16T20:23:35Z)
• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• Limit Analysis of Graph Neural Networks with Wireless Conflict Graphs [81.39865232674413]
  Graph Neural Networks (GNNs) have emerged as a powerful tool for wireless resource allocation.<n>This work establishes theoretical results for transferability of GNNs over graphs derived from sparse Random Geometric Graphs (RGGs)
  arXiv  Detail & Related papers  (2026-06-02T15:42:14Z)
• Generalization of Graph Neural Network Models for Distribution Grid Fault Detection [2.183622338864934]
  This paper systematically benchmarks various Graph Neural Networks (GNNs) in an RNN+GNN pipeline model.<n>To the best of our knowledge, we are the first to (i) propose to use GraphSAGE and Graph Attention (GAT, GATv2) in an RGNN for fault diagnosis.<n>Our experimental results on the IEEE 123-node distribution network show that RGATv2 has superior generalization capabilities.
  arXiv  Detail & Related papers  (2025-10-03T23:46:31Z)
• Multi-Slice Spatial Transcriptomics Data Integration Analysis with STG3Net [1.433758865948252]
  Batch effects between multiple slices pose significant challenges in analyzing Transcriptomics data. We have developed a plug-and-play batch correction method called Global Nearest Neighbor (G2N) anchor pairs selection. Building upon G2N, we propose STG3Net, which cleverly combines masked graph convolutional autoencoders as backbone modules.
  arXiv  Detail & Related papers  (2024-08-09T02:31:12Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph [57.2953563124339]
  We propose a novel heterogeneous graph neural network with sequential node representation, namely Seq-HGNN. We conduct extensive experiments on four widely used datasets from Heterogeneous Graph Benchmark (HGB) and Open Graph Benchmark (OGB)
  arXiv  Detail & Related papers  (2023-05-18T07:27:18Z)
• EGRC-Net: Embedding-induced Graph Refinement Clustering Network [66.44293190793294]
  We propose a novel graph clustering network called Embedding-Induced Graph Refinement Clustering Network (EGRC-Net) EGRC-Net effectively utilizes the learned embedding to adaptively refine the initial graph and enhance the clustering performance. Our proposed methods consistently outperform several state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-11-19T09:08:43Z)
• GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials [2.521781613847069]
  Graph Neural Networks (GNNs) are promising approaches for circumventing real-world problems on graph-structured data. These models usually have at least one of four fundamental limitations: over-smoothing, over-fitting, difficult to train, and strong homophily assumption. We identify a set of key designs including (D1) dilated convolution, (D2) multi-channel learning, (D3) self-attention score, and (D4) sign factor to boost learning from different types. We theoretically analyze the model and show that it can approximate various graph filters by adjusting the self-attention score
  arXiv  Detail & Related papers  (2022-09-30T13:03:57Z)
• Long Range Graph Benchmark [32.317725340138104]
  MP-GNNs that simply rely on 1-hop message passing often fare better in several existing graph benchmarks. We benchmark both baseline GNNs and Graph Transformer networks to verify that the models which capture long-range dependencies perform significantly better on these tasks.
  arXiv  Detail & Related papers  (2022-06-16T13:33:22Z)
• RU-Net: Regularized Unrolling Network for Scene Graph Generation [92.95032610978511]
  Scene graph generation (SGG) aims to detect objects and predict the relationships between each pair of objects. Existing SGG methods usually suffer from several issues, including 1) ambiguous object representations, and 2) low diversity in relationship predictions. We propose a regularized unrolling network (RU-Net) to address both problems.
  arXiv  Detail & Related papers  (2022-05-03T04:21:15Z)
• A Unified Lottery Ticket Hypothesis for Graph Neural Networks [82.31087406264437]
  We present a unified GNN sparsification (UGS) framework that simultaneously prunes the graph adjacency matrix and the model weights. We further generalize the popular lottery ticket hypothesis to GNNs for the first time, by defining a graph lottery ticket (GLT) as a pair of core sub-dataset and sparse sub-network.
  arXiv  Detail & Related papers  (2021-02-12T21:52:43Z)
• Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning [63.97983530843762]
  Graph Neural Networks (GNNs) have achieved great success in graph representation learning. GNNs generate identical representations for graph substructures that may in fact be very different. More powerful GNNs, proposed recently by mimicking higher-order tests, are inefficient as they cannot sparsity of underlying graph structure. We propose Distance Depiction (DE) as a new class of graph representation learning.
  arXiv  Detail & Related papers  (2020-08-31T23:15:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.