{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:40Z","timestamp":1740169120372,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762078","61363058","61762079","61966004"],"award-info":[{"award-number":["61762078","61363058","61762079","61966004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Trusted Software","award":["kx201910"],"award-info":[{"award-number":["kx201910"]}]},{"name":"Research Fund of Guangxi Key Lab of Multi-Source Information Mining and Security","award":["MIMS18-08"],"award-info":[{"award-number":["MIMS18-08"]}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["2018A610057"],"award-info":[{"award-number":["2018A610057"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY17F030002"],"award-info":[{"award-number":["LY17F030002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2941766","type":"journal-article","created":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T19:37:45Z","timestamp":1568662665000},"page":"136568-136580","source":"Crossref","is-referenced-by-count":1,"title":["HcRPC: Highly Compact Reachability Preserving Graph Compression With Corrections"],"prefix":"10.1109","volume":"7","author":[{"given":"Rui","family":"Bing","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5104-8982","authenticated-orcid":false,"given":"Huifang","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xiangchun","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.06.001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.57"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376675"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.20.77"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0388-y"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.133"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260809"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835873"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020566"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364035"},{"article-title":"An algorithm for finding a minimum equivalent graph of a digraph","year":"1967","author":"moyles","key":"ref40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623701"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2453957"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2601611"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020492"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783321"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.11"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.40"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38562-9_55"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18579-4_14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2018.00044"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2018.03.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622386"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899921"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRCICN.2016.7813655"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687711"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1515\/BC.2000.113"},{"key":"ref21","article-title":"The \n$\\rho$\n-operator: Enabling querying for semantic associations on the semantic Web","author":"anyanwu","year":"2003","journal-title":"Proc 12th WWW Conf"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1065"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213855"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.30"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989419"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08839789.pdf?arnumber=8839789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:46Z","timestamp":1628624446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8839789\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2941766","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}