{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:44:03Z","timestamp":1762508643470},"reference-count":131,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:p>We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms. First, GMS comes with a benchmark specification based on extensive literature review, prescribing representative problems, algorithms, and datasets. Second, GMS offers a carefully designed software platform for seamless testing of different fine-grained elements of graph mining algorithms, such as graph representations or algorithm subroutines. The platform includes parallel implementations of more than 40 considered baselines, and it facilitates developing complex and fast mining algorithms. High modularity is possible by harnessing set algebra operations such as set intersection and difference, which enables breaking complex graph mining algorithms into simple building blocks that can be separately experimented with. GMS is supported with a broad concurrency analysis for portability in performance insights, and a novel performance metric to assess the throughput of graph mining algorithms, enabling more insightful evaluation. As use cases, we harness GMS to rapidly redesign and accelerate state-of-the-art baselines of core graph mining problems: degeneracy reordering (by &gt;2X), maximal clique listing (by &gt;9\u00d7),<jats:italic>k<\/jats:italic>-clique listing (by up to 1.1\u00d7), and subgraph isomorphism (by 2.5\u00d7), also obtaining better theoretical performance bounds.<\/jats:p>","DOI":"10.14778\/3476249.3476252","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T16:46:23Z","timestamp":1635353183000},"page":"1922-1935","source":"Crossref","is-referenced-by-count":11,"title":["GraphMineSuite"],"prefix":"10.14778","volume":"14","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zur","family":"Vonarburg-Shmaria","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannick","family":"Schaffner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Schwarz","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Kwasniewski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Gianinazzi","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Beranek","sequence":"additional","affiliation":[{"name":"VSB, Ostrava, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kacper","family":"Janda","sequence":"additional","affiliation":[{"name":"AGH-UST, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Holenstein","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Leisinger","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Tatkowski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esref","family":"Ozdemir","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Balla","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Copik","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Lindenberger","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Konieczny","sequence":"additional","affiliation":[{"name":"AGH-UST, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Onur","family":"Mutlu","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_2_1_2_1","volume-title":"A survey of data mining techniques for social media analysis. arXiv preprint arXiv:1312.4617","author":"Adedoyin-Olowe M.","year":"2013"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1738952"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1738952"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2015.11"},{"key":"e_1_2_1_7_1","volume-title":"SDM","author":"Al M.","year":"2006"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_9"},{"key":"e_1_2_1_9_1","first-page":"58","volume-title":"Advancing Big Data Benchmarks","author":"Ammar K.","year":"2013"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235117"},{"key":"e_1_2_1_13_1","volume-title":"The gap benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer S.","year":"2015"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3433701.3433833"},{"key":"e_1_2_1_16_1","volume-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799","author":"Besta M.","year":"2018"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243198"},{"key":"e_1_2_1_18_1","first-page":"1150","volume-title":"Theoretical","author":"Bilardi G.","year":"2011"},{"key":"e_1_2_1_19_1","volume-title":"Problem based benchmark suite","author":"Blelloch G. E.","year":"2011"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/234313.234339"},{"key":"e_1_2_1_21_1","volume-title":"Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment","author":"Blondel V. D.","year":"2008"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513591.2527070"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"e_1_2_1_26_1","volume-title":"Introducing vf3: A new algorithm for subgraph isomorphism","author":"Carletti V.","year":"2017"},{"key":"e_1_2_1_27_1","volume-title":"The VF3-light subgraph isomorphism algorithm: when doing less is more effective","author":"Carletti V.","year":"2018"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20081-7_14"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2010.5609530"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2325"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2009.5306797"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173574.3173688"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050985"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3380936"},{"key":"e_1_2_1_43_1","volume-title":"Change-sensitive algorithms for maintaining maximal cliques in a dynamic graph. CoRR","author":"Das A.","year":"2016"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210414"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398682.3399168"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3243389"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.17"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2009164.2009194"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008656"},{"key":"e_1_2_1_53_1","volume-title":"Selected Papers of Alfr\u00e9d R\u00e9nyi","author":"Erd\u0151s P.","year":"1976"},{"key":"e_1_2_1_54_1","volume-title":"LATIN","author":"Farach-Colton M.","year":"2014"},{"key":"e_1_2_1_55_1","first-page":"45","volume-title":"AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection","author":"Gallagher B.","year":"2006"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196924"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612697"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.06.045"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/3291168.3291224"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01768-2_13"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223640"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622126"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.5555\/1738952"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2560"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_2_1_78_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014. J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2017.8231847"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_2_1_81_1","volume-title":"Shentu: processing multi-trillion edge graphs on millions of cores in seconds","author":"Lin H.","year":"2018"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.13"},{"key":"e_1_2_1_83_1","volume-title":"Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications, 390(6):1150--1170","author":"L\u00fc L.","year":"2011"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"e_1_2_1_85_1","volume-title":"12th International Symposium on Parameterized and Exact Computation (IPEC 2017","author":"Manoussakis G.","year":"2018"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_2_1_87_1","volume-title":"Graphzero: Breaking symmetry for efficient graph mining. arXiv preprint arXiv:1911.12877","author":"Mawhirter D.","year":"2019"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_2_1_91_1","first-page":"138","volume-title":"Advancing Big Data Benchmarks","author":"Ming Z.","year":"2013"},{"key":"e_1_2_1_92_1","volume-title":"Proceedings of the department of defense HPCMP users group conference","volume":"710","author":"Mucci P. J.","year":"1999"},{"key":"e_1_2_1_93_1","volume-title":"Introducing the graph 500","author":"Murphy R. C.","year":"2010"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807626"},{"key":"e_1_2_1_95_1","volume-title":"Honour thy neighbour---clique maintenance in dynamic graphs. on Probabilistic Graphical Models, page 201","author":"Ottosen T. J.","year":"2010"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_18"},{"key":"e_1_2_1_97_1","volume-title":"Near linear time algorithm to detect community structures in large-scale networks. Physical review E, 76(3):036106","author":"Raghavan U. N.","year":"2007"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.198"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2012.6360146"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.5555\/2556013"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.5555\/2888116.2888372"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_2_1_104_1","volume-title":"Phd in computer science","author":"Schank T.","year":"2007"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2390633"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000008651.28952.b6"},{"key":"e_1_2_1_110_1","volume-title":"Parboil: A revised benchmark suite for scientific and commercial throughput computing","author":"Stratton J. A.","year":"2012"},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.011"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_16"},{"key":"e_1_2_1_113_1","unstructured":"Y. Tang. Benchmarking graph databases with cyclone benchmark. 2016. Y. Tang. Benchmarking graph databases with cyclone benchmark. 2016."},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981345.2981428"},{"key":"e_1_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839491"},{"key":"e_1_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"e_1_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.5555\/3291168.3291225"},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.2174\/1574893609666140516005740"},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835958"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCST.2009.30"},{"issue":"1","key":"e_1_2_1_125_1","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TSC.2015.2479225","article-title":"Distributed maximal clique computation and management","volume":"9","author":"Xu Y.","year":"2015","journal-title":"IEEE Transactions on Services Computing"},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1145\/3283450"},{"key":"e_1_2_1_127_1","volume-title":"G-thinker: big graph mining made easier and faster. arXiv preprint arXiv:1709.03110","author":"Yan D.","year":"2017"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"e_1_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00077"},{"key":"e_1_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29"},{"key":"e_1_2_1_131_1","volume-title":"Kaleido: An efficient out-of-core graph mining system on a single machine. arXiv preprint arXiv:1905.09572","author":"Zhao C.","year":"2019"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3476249.3476252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T20:44:18Z","timestamp":1699735458000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3476249.3476252"}},"subtitle":["enabling high-performance<i>and<\/i>programmable graph mining algorithms with set algebra"],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":131,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10.14778\/3476249.3476252"],"URL":"https:\/\/doi.org\/10.14778\/3476249.3476252","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}