A Graph-based Benchmark dataset for Printed Circuit Netlist Partitioning

A close-up photograph of a printed circuit board showing dense electronic components, circuit traces, and interconnected pathways in grayscale tones.
Image Credit: Photo by analogicus on Pixabay (SourceLicense)

AI Summary of Peer-Reviewed Research

This page presents an AI-generated summary of a published research paper. The original authors did not write or review this article. See full disclosure ↓

Scientific Data·2026-02-25·Peer-reviewed·View original paper ↗·Follow this topic (RSS)
Publication Signals show what we were able to verify about where this research was published.STRONGWe verified multiple publication signals for this source, including independently confirmed credentials. Publication Signals reflect the source’s verifiable credentials, not the quality of the research.
  • ✔ Peer-reviewed source
  • ✔ Published in indexed journal
  • ✔ No retraction or integrity flags

Overview

This work addresses the absence of high-quality benchmark datasets for printed circuit netlist partitioning by introducing BenchPCNP, a labeled dataset constructed from production-verified circuits. The dataset comprises netlist graph data in Protel 2 format partitioned according to IPC-2612 design standards. Netlist partitioning represents a fundamental task in electronic design automation and reverse engineering contexts, with potential applications in graph machine learning methodologies.

Methods and approach

The dataset construction methodology involved five electronic designers partitioning 50 production-verified practical circuits following IPC-2612 design standards. Netlist graphs were extracted in Protel 2 format and annotated with partition labels. The resulting dataset encompasses 54 distinct partition module labels with explicit module partitioning annotations. This structured annotation process establishes a reliable foundation for benchmarking partitioning algorithms and machine learning models.

Key Findings

BenchPCNP contains 50 partitioned circuits derived from production-verified designs with consistent labeling across 54 distinct module categories. The dataset incorporates manual partitioning performed by multiple domain experts, ensuring alignment with established design standards and practical circuit engineering conventions. The labeled graphs enable quantitative performance evaluation for algorithmic approaches to netlist partitioning.

Implications

The availability of BenchPCNP establishes standardized evaluation infrastructure for netlist partitioning research, facilitating comparison across different algorithmic approaches and graph machine learning techniques. This dataset infrastructure promotes research consistency and enables reproducible benchmarking within the domain. The structured annotation with expert partitioning decisions provides empirical grounding for developing and validating netlist partitioning methodologies.

Disclosure

  • Research title: A Graph-based Benchmark dataset for Printed Circuit Netlist Partitioning
  • Authors: Jie Yang, Kai Qiao, Jian Chen, Jinjin Hai, Jun Shu, Yuena Wei, Bin Yan
  • Institutions: Henan University of Engineering, PLA Information Engineering University
  • Publication date: 2026-02-25
  • DOI: https://doi.org/10.1038/s41597-026-06818-y
  • OpenAlex record: View
  • PDF: Download
  • Image credit: Photo by analogicus on Pixabay (SourceLicense)
  • Disclosure: This post was generated by Claude (Anthropic). The original authors did not write or review this post.

Get the weekly research newsletter

Stay current with peer-reviewed research without reading academic papers — one filtered digest, every Friday.

More posts