{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:53:08Z","timestamp":1781193188285,"version":"3.54.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1109\/ijcnn64981.2025.11228129","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:46:15Z","timestamp":1763145975000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["TROJAN-GUARD: Hardware Trojans Detection Using GNN in RTL Designs"],"prefix":"10.1109","author":[{"given":"Kiran","family":"Thorat","sequence":"first","affiliation":[{"name":"University of Connecticut,Computer Science and Engineering Department"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Hasan","sequence":"additional","affiliation":[{"name":"University of Connecticut,Computer Science and Engineering Department"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Caiwen","family":"Ding","sequence":"additional","affiliation":[{"name":"University of Minnesota,Department of Computer Science & Engineering"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhijie","family":"Shi","sequence":"additional","affiliation":[{"name":"University of Connecticut,Computer Science and Engineering Department"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Chip-level trojan benchmarks"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/VLSISATA61709.2024.10560302"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2024.3428469"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858392"},{"key":"ref6","article-title":"Qlora: Efficient finetuning of quantized llms","author":"Dettmers","year":"2023"},{"key":"ref7","article-title":"Spqr: A sparse-quantized representation for nearlossless llm weight compression","author":"Dettmers","year":"2023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/AsianHOST59942.2023.10409307"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2023.3280134"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.5829\/IJE.2022.35.07A.16"},{"key":"ref11","first-page":"341","article-title":"How secure is your cache against side-channel attacks?","volume-title":"Proceedings of the 50th Annual IEEE\/ACM International Symposium on Microarchitecture","author":"He"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2018.00286"},{"key":"ref13","author":"Kipf","year":"2017","journal-title":"Semi-supervised classification with graph convolutional networks"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3236269"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IOLTS50870.2020.9159740"},{"issue":"9","key":"ref16","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Leman","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2025.3525903"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5949"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49025-0_1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834396"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2897992"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2023KEP0005"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2022.3175067"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2017.2714641"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3427369"},{"key":"ref26","first-page":"6014","article-title":"Graph of circuits with gnn for exploring the optimal design space","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Shahane","year":"2023"},{"key":"ref27","article-title":"No change, no gain: empowering graph neural networks with expected model change maximization for active learning","volume":"36","author":"Song","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16214-0_42"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2010.7"},{"key":"ref30","article-title":"Choosing a classical planner with graph neural networks","author":"Vatter","year":"2024"},{"key":"ref31","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref32","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3178355"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.23919\/DATE51398.2021.9474174"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/HOST49136.2021.9702281"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2024.114898"}],"event":{"name":"2025 International Joint Conference on Neural Networks (IJCNN)","location":"Rome, Italy","start":{"date-parts":[[2025,6,30]]},"end":{"date-parts":[[2025,7,5]]}},"container-title":["2025 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11227166\/11227148\/11228129.pdf?arnumber=11228129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:34:24Z","timestamp":1763192064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11228129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ijcnn64981.2025.11228129","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}