{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:12:19Z","timestamp":1783750339450,"version":"3.55.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"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":[[2026,5,25]]},"DOI":"10.1109\/ets69887.2026.11591580","type":"proceedings-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T19:37:01Z","timestamp":1783712221000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Fast Circuit Analysis via Neighborhood-Guided Maximum Common Subgraph"],"prefix":"10.1109","author":[{"given":"Paolo","family":"Bernardi","sequence":"first","affiliation":[{"name":"Politecnico di Torino,Dip. di Automatica e Informatica,Turin,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Cardone","sequence":"additional","affiliation":[{"name":"Politecnico di Torino,Dip. di Automatica e Informatica,Turin,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Quer","sequence":"additional","affiliation":[{"name":"Politecnico di Torino,Dip. di Automatica e Informatica,Turin,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NOCS.2007.18"},{"key":"ref2","article-title":"PDG GEN: A Methodology for Fast and Accurate Simulation of On-chip Networks","author":"Macdonald","year":"2012","journal-title":"NOCS Special Section"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2013.6557149"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2010.29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/99"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/computation8020048"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5619"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/265"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25519"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5220\/0012130800003538"},{"key":"ref12","volume-title":"Solving hard subgraph problems in parallel","author":"McCreesh","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44953-1_23"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2654506"}],"event":{"name":"2026 IEEE European Test Symposium (ETS)","location":"Chania, Greece","start":{"date-parts":[[2026,5,25]]},"end":{"date-parts":[[2026,5,29]]}},"container-title":["2026 IEEE European Test Symposium (ETS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11591470\/11591504\/11591580.pdf?arnumber=11591580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:18:33Z","timestamp":1783747113000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11591580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ets69887.2026.11591580","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]}}}