{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T08:57:52Z","timestamp":1772701072326,"version":"3.50.1"},"reference-count":32,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:00:00Z","timestamp":1772668800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Central Plains Science and Technology Innovation Leading Talent Project","award":["244200510015"],"award-info":[{"award-number":["244200510015"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Automatic schematic generation is a key aspect of reverse engineering for printed circuit boards, and its cost is usually proportional to the size of the circuit. The generation of schematics for large-scale, realistic netlists poses a significant challenge within this domain. Netlist partitioning is a major approach to addressing this challenge. It reduces the cost of schematic generation by segmenting netlists into sub-netlists of moderate size based on their functional modules. Traditional methods that utilize expert systems for netlist partitioning exhibit high sensitivity to parameters and demonstrate poor adaptability across different netlists. Furthermore, their experimental data are typically constructed manually, making them difficult to reproduce. To address these limitations, this article first presents a set of graph datasets designed specifically for netlist partitioning experiments. Second, to tackle the neighborhood bias problem prevalent in real circuit netlists, we propose a novel neighborhood bias edge pruning algorithm called BiN-EdgePruning. Building on this foundation, we integrate BiN-EdgePruning with graph convolutional networks to achieve end-to-end netlist partitioning, thereby eliminating the need for unnecessary parameter tuning. Experimental results demonstrate that the proposed pruning algorithm significantly enhances the accuracy of printed circuit netlist partitioning across various graph neural network architectures.<\/jats:p>","DOI":"10.7717\/peerj-cs.3623","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T08:06:30Z","timestamp":1772697990000},"page":"e3623","source":"Crossref","is-referenced-by-count":0,"title":["BiN-EdgePruning: edge pruning based on biased neighborhoods for printed circuit netlists"],"prefix":"10.7717","volume":"12","author":[{"given":"Jie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningning","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhao","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4443","published-online":{"date-parts":[[2026,3,5]]},"reference":[{"key":"10.7717\/peerj-cs.3623\/ref-1","first-page":"2001","article-title":"Diffusion-convolutional neural networks","author":"Atwood","year":"2016"},{"key":"10.7717\/peerj-cs.3623\/ref-2","article-title":"Spectral networks and deep locally connected networks on graphs","author":"Bruna","year":"2014"},{"key":"10.7717\/peerj-cs.3623\/ref-3","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"Defferrard","year":"2016"},{"key":"10.7717\/peerj-cs.3623\/ref-4","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1903.02428","article-title":"Fast graph representation learning with pytorch geometric","author":"Fey","year":"2019"},{"key":"10.7717\/peerj-cs.3623\/ref-5","first-page":"65","article-title":"CoPlace: coherent placement engine with layout-aware partitioning for 3D ICs","author":"Fu","year":"2024"},{"key":"10.7717\/peerj-cs.3623\/ref-6","first-page":"1416","article-title":"Large-scale learnable graph convolutional networks","author":"Gao","year":"2018"},{"key":"10.7717\/peerj-cs.3623\/ref-7","article-title":"Combining neural networks with personalized pagerank for classification on graphs","author":"Gasteiger","year":"2019"},{"key":"10.7717\/peerj-cs.3623\/ref-8","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS\u201917)","author":"Hamilton","year":"2017"},{"issue":"11","key":"10.7717\/peerj-cs.3623\/ref-9","doi-asserted-by":"publisher","first-page":"15565","DOI":"10.1109\/TNNLS.2023.3288484","article-title":"Structure-aware dropedge toward deep graph convolutional networks","volume":"35","author":"Han","year":"2024","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"5","key":"10.7717\/peerj-cs.3623\/ref-10","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/tai.2022.3198930","article-title":"GraphClusNet: a hierarchical graph neural network for recovered circuit netlist partitioning","volume":"4","author":"Hong","year":"2023","journal-title":"IEEE Transactions on Artificial Intelligence"},{"key":"10.7717\/peerj-cs.3623\/ref-11","first-page":"43","article-title":"Automatic analog schematic diagram generation based on building block classification and reinforcement learning","author":"Hsu","year":"2022"},{"key":"10.7717\/peerj-cs.3623\/ref-12","first-page":"690","article-title":"Graph partitioning approach for fast quantum circuit simulation","author":"Im","year":"2023"},{"key":"10.7717\/peerj-cs.3623\/ref-13","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2409.01387","article-title":"VLSI hypergraph partitioning with deep learning","author":"Khan","year":"2024"},{"key":"10.7717\/peerj-cs.3623\/ref-14","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.7717\/peerj-cs.3623\/ref-15","first-page":"690","article-title":"LSP: acceleration of graph neural networks via locality sensitive pruning of graphs","author":"Kosman","year":"2022"},{"key":"10.7717\/peerj-cs.3623\/ref-16","first-page":"55","article-title":"GANA: graph convolutional network based automated netlist annotation for analog circuits","author":"Kunal","year":"2020"},{"issue":"6","key":"10.7717\/peerj-cs.3623\/ref-17","doi-asserted-by":"publisher","first-page":"6923","DOI":"10.1109\/tpami.2021.3074057","article-title":"DeepGCNs: making GCNs go as deep as CNNs","volume":"45","author":"Li","year":"2023","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"10.7717\/peerj-cs.3623\/ref-18","article-title":"Adaptive graph convolutional neural networks","volume":"32","author":"Li","year":"2018","journal-title":"AAAI"},{"key":"10.7717\/peerj-cs.3623\/ref-19","first-page":"31","article-title":"Circuit partitioning for PCB netlist based on net attributes","author":"Meng","year":"2022"},{"key":"10.7717\/peerj-cs.3623\/ref-20","doi-asserted-by":"crossref","DOI":"10.1109\/CVPR.2017.576","article-title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","author":"Monti","year":"2017"},{"key":"10.7717\/peerj-cs.3623\/ref-21","article-title":"DropEdge: towards deep graph convolutional networks on node classification","author":"Rong","year":"2020"},{"issue":"3","key":"10.7717\/peerj-cs.3623\/ref-22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Magazine"},{"issue":"10","key":"10.7717\/peerj-cs.3623\/ref-23","doi-asserted-by":"publisher","first-page":"4755","DOI":"10.1109\/tnnls.2020.3025110","article-title":"Adaptive propagation graph convolutional network","volume":"32","author":"Spinelli","year":"2021","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.7717\/peerj-cs.3623\/ref-24","article-title":"Graph attention networks","author":"Velickovic","year":"2018"},{"key":"10.7717\/peerj-cs.3623\/ref-25","first-page":"1","article-title":"Parallelized technology mapping to general PLBs by adaptive circuit partitioning","author":"Wang","year":"2021"},{"key":"10.7717\/peerj-cs.3623\/ref-26","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume":"80","author":"Xu","year":"2018","journal-title":"Proceedings of Machine Learning Research"},{"key":"10.7717\/peerj-cs.3623\/ref-27","doi-asserted-by":"publisher","DOI":"10.21227\/2ke7-py98","article-title":"Boarddata","author":"Yang","year":"2025","journal-title":"IEEE Dataport"},{"issue":"5","key":"10.7717\/peerj-cs.3623\/ref-28","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1109\/tcad.2023.3340869","article-title":"AEM-PCB reverser: circuit schematic generation in PCB reverse engineering using reinforcement learning based on aesthetic evaluation metric","volume":"43","author":"Yang","year":"2024","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"1","key":"10.7717\/peerj-cs.3623\/ref-29","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TKDE.2021.3072345","article-title":"Sparse graph attention networks","volume":"35","author":"Ye","year":"2021","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"16","key":"10.7717\/peerj-cs.3623\/ref-30","doi-asserted-by":"publisher","first-page":"8200","DOI":"10.3390\/app12168200","article-title":"PCB network analysis for circuit partitioning","volume":"12","author":"Zheng","year":"2022","journal-title":"Applied Sciences"},{"issue":"3","key":"10.7717\/peerj-cs.3623\/ref-31","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TCSII.2023.3318352","article-title":"High-performance 3-D placement engine with physical-aware incremental partitioning","volume":"71","author":"Zhu","year":"2024","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"10.7717\/peerj-cs.3623\/ref-32","first-page":"499","article-title":"Dual graph convolutional networks for graph-based semi-supervised classification","author":"Zhuang","year":"2018"}],"container-title":["PeerJ Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/peerj.com\/articles\/cs-3623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3623.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3623.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-3623.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T08:06:35Z","timestamp":1772697995000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/articles\/cs-3623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,5]]},"references-count":32,"alternative-id":["10.7717\/peerj-cs.3623"],"URL":"https:\/\/doi.org\/10.7717\/peerj-cs.3623","archive":["CLOCKSS","LOCKSS","Portico"],"relation":{},"ISSN":["2376-5992"],"issn-type":[{"value":"2376-5992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,5]]},"article-number":"e3623"}}