{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:30:42Z","timestamp":1786602642229,"version":"build-2736575974"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARC","award":["DP230101445,FT210100303"],"award-info":[{"award-number":["DP230101445,FT210100303"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/icde65706.2026.00052","type":"proceedings-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T19:16:38Z","timestamp":1786562198000},"page":"615-628","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint"],"prefix":"10.1109","author":[{"given":"Siwoo","family":"Song","sequence":"first","affiliation":[{"name":"Samsung Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wonseok","family":"Shin","sequence":"additional","affiliation":[{"name":"Standigm Inc"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[{"name":"Seoul National University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[{"name":"LUISS University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[{"name":"University of New South Wales"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000385"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023032"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-021-04197-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaf482"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/303"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-018-2908-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MLCAD62225.2024.10740256"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2025.3549701"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322295"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174653"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00160"},{"key":"ref17","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3160393"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/BigComp.2018.00140"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3203856"},{"key":"ref21","first-page":"337","article-title":"Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Han","year":"2013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3689031.3717474"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2980257"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00749-x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598591"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00321"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3589312"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425888"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3639315"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3654949"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3622781.3674173"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3161328"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE65448.2025.00338"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"ref39","volume-title":"Hypergraph datasets","author":"Benson","year":"2024"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403222"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abh1303"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380152"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3353199"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3653306"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-023-01230-5"}],"event":{"name":"2026 IEEE 42nd International Conference on Data Engineering (ICDE)","location":"Montreal, QC, Canada","start":{"date-parts":[[2026,5,4]]},"end":{"date-parts":[[2026,5,8]]}},"container-title":["2026 IEEE 42nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11629178\/11629165\/11629221.pdf?arnumber=11629221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T06:11:48Z","timestamp":1786601508000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11629221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/icde65706.2026.00052","relation":{},"subject":[],"published":{"date-parts":[[2026,5]]}}}