{"id":"https://openalex.org/W4414198273","doi":"https://doi.org/10.1109/dac63849.2025.11133089","title":"H3Match: A Hybrid Heterogeneous Hypergraph Matching Method for Subcircuit Identification","display_name":"H3Match: A Hybrid Heterogeneous Hypergraph Matching Method for Subcircuit Identification","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4414198273","doi":"https://doi.org/10.1109/dac63849.2025.11133089"},"language":"en","primary_location":{"id":"doi:10.1109/dac63849.2025.11133089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108979636","display_name":"Bohao Li","orcid":null},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bohao Li","raw_affiliation_strings":["Zhejiang University"],"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077283883","display_name":"Qingsong Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingsong Peng","raw_affiliation_strings":["Zhejiang University"],"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100427135","display_name":"Changhong Wang","orcid":"https://orcid.org/0000-0001-7578-4856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Changhong Wang","raw_affiliation_strings":["Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Co. Ltd"],"affiliations":[{"raw_affiliation_string":"Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Co. Ltd","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085987622","display_name":"Tianming Ni","orcid":"https://orcid.org/0000-0001-6272-8660"},"institutions":[{"id":"https://openalex.org/I70908550","display_name":"Anhui Polytechnic University","ror":"https://ror.org/041sj0284","country_code":"CN","type":"education","lineage":["https://openalex.org/I70908550"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tianming Ni","raw_affiliation_strings":["Anhui Polytechnic University"],"affiliations":[{"raw_affiliation_string":"Anhui Polytechnic University","institution_ids":["https://openalex.org/I70908550"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022945347","display_name":"Tinghuan Chen","orcid":"https://orcid.org/0000-0002-9195-6619"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tinghuan Chen","raw_affiliation_strings":["The Chinese University of Hong Kong,Shenzhen"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Shenzhen","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100427492","display_name":"Qi Sun","orcid":"https://orcid.org/0000-0001-5153-6698"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Sun","raw_affiliation_strings":["Zhejiang University"],"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019840038","display_name":"Cheng Zhuo","orcid":null},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng Zhuo","raw_affiliation_strings":["Zhejiang University"],"affiliations":[{"raw_affiliation_string":"Zhejiang University","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5108979636"],"corresponding_institution_ids":["https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28088813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.8331999778747559,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.8331999778747559,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11550","display_name":"Text and Document Classification Technologies","score":0.829800009727478,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.7350999712944031,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.715499997138977},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6481000185012817},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5827999711036682},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.40779998898506165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3880999982357025},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.3605000078678131},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.35749998688697815},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3255000114440918}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.715499997138977},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6481000185012817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.595300018787384},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5827999711036682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4885999858379364},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3977000117301941},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3880999982357025},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33480000495910645},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.3027999997138977},{"id":"https://openalex.org/C166501922","wikidata":"https://www.wikidata.org/wiki/Q1786523","display_name":"Signal-flow graph","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.2978000044822693},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.287200003862381},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.26330000162124634},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2583000063896179},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dac63849.2025.11133089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W2020787948","https://openalex.org/W2126359798","https://openalex.org/W2134152592","https://openalex.org/W2138891774","https://openalex.org/W2147405597","https://openalex.org/W2157136768","https://openalex.org/W2608355501","https://openalex.org/W2795196889","https://openalex.org/W2948742909","https://openalex.org/W3013793321","https://openalex.org/W3035935734","https://openalex.org/W3036312847","https://openalex.org/W3085990079","https://openalex.org/W3114561146","https://openalex.org/W3126966810","https://openalex.org/W3127378783","https://openalex.org/W3198511427","https://openalex.org/W3216969643","https://openalex.org/W4212836324","https://openalex.org/W4225162755","https://openalex.org/W4252248754","https://openalex.org/W4300865726","https://openalex.org/W4315630789","https://openalex.org/W4388040426","https://openalex.org/W4404102066"],"related_works":[],"abstract_inverted_index":{"Subcircuit":[0],"matching":[1,53,113,116,132,137],"is":[2,64,192],"widely":[3],"applied":[4],"in":[5,165,181],"logic":[6],"synthesis,":[7],"design":[8],"verification,":[9,152],"hardware":[10],"security,":[11],"etc.":[12],"Previous":[13],"works":[14,26],"employ":[15],"redundant":[16],"circuit":[17,101],"representations,":[18],"coupled":[19],"with":[20,121,153],"timeconsuming":[21],"enumerative":[22],"search":[23],"methods.":[24,201],"Subsequent":[25],"use":[27],"a":[28,68,128,142,207],"hybrid":[29,60],"\u201capproximate":[30],"filtering":[31,49],"-":[32],"exact":[33,151,190,200],"verification\u201d":[34],"framework,":[35],"but":[36],"the":[37,43,81,88,98,106,111,159,163,203],"numerous":[38],"false":[39,75,107,187],"negatives":[40],"predicted":[41],"by":[42,157,179],"graph":[44],"neural":[45],"network":[46],"(GNN)":[47],"based":[48],"lead":[50],"to":[51,66,85,96,104,134,212],"severe":[52],"failure.":[54],"In":[55],"this":[56],"paper,":[57],"an":[58],"improved":[59],"method":[61,174],"named":[62],"H3Match":[63],"proposed":[65],"achieve":[67],"better":[69],"tradeoff":[70],"between":[71],"runtime,":[72],"accuracy,":[73],"and":[74,90,126],"negative":[76],"rate.":[77],"First,":[78],"we":[79,109,140],"model":[80],"circuits":[82],"as":[83,115],"hypergraphs":[84],"fully":[86],"capture":[87],"topology":[89],"construct":[91],"diverse":[92],"heterogeneous":[93],"hyperedge":[94],"features":[95],"facilitate":[97],"learning":[99],"of":[100],"topologies.":[102],"Second,":[103],"reduce":[105],"negatives,":[108],"reformulate":[110],"subgraph":[112],"problem":[114],"directed":[117,129],"acyclic":[118],"graphs":[119],"(DAGs)":[120],"embedded":[122],"circular":[123],"structure":[124],"information":[125],"develop":[127],"GNN-based":[130],"approximate":[131,166,173],"approach":[133],"identify":[135],"potential":[136],"subcircuits.":[138],"Finally,":[139],"propose":[141],"general":[143],"mixed":[144],"integer":[145],"nonlinear":[146],"programming":[147],"(MINLP)":[148],"formulation":[149],"for":[150],"convergency":[154],"speed":[155],"accelerated":[156],"extracting":[158],"initial":[160],"solution":[161],"from":[162],"results":[164,169],"matching.":[167],"Experimental":[168],"show":[170],"that":[171],"our":[172],"outperforms":[175],"state-of-the-art":[176],"(SOTA)":[177],"methods":[178],"4.31%":[180],"accuracy":[182],"while":[183],"achieving":[184],"virtually":[185],"zero":[186],"negatives.":[188],"Our":[189],"verification":[191],"on":[193],"average":[194],"$4.16":[195],"\\times$":[196,209],"faster":[197],"than":[198],"SOTA":[199],"Overall,":[202],"end-to-end":[204],"flow":[205],"achieves":[206],"$7.08":[208],"speedup":[210],"compared":[211],"existing":[213],"approaches.":[214]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}