{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T20:29:55Z","timestamp":1783628995019,"version":"3.55.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902069"],"award-info":[{"award-number":["61902069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2021J011068"],"award-info":[{"award-number":["2021J011068"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11227-023-05751-w","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T14:01:58Z","timestamp":1699365718000},"page":"7399-7432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Entropy-driven differential privacy protection scheme based on social graphlet attributes"],"prefix":"10.1007","volume":"80","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zuan-yang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun-liang","family":"Si","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiu-cai","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"5751_CR1","doi-asserted-by":"publisher","first-page":"122372","DOI":"10.1016\/j.physa.2019.122372","volume":"535","author":"U Can","year":"2019","unstructured":"Can U, Alatas B (2019) A new direction in social network analysis: online social network analysis problems and applications. Phys A Stat Mech Appl 535:122372","journal-title":"Phys A Stat Mech Appl"},{"issue":"11","key":"5751_CR2","first-page":"1","volume":"55","author":"Y Li","year":"2023","unstructured":"Li Y, Purcell M, Rakotoarivelo T, Smith D, Ranbaduge T, Ng KS (2023) Private graph data release: a survey. ACM Comput Surv 55(11):1\u201339","journal-title":"ACM Comput Surv"},{"issue":"2","key":"5751_CR3","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1080\/19361610.2020.1751558","volume":"16","author":"M Kiranmayi","year":"2021","unstructured":"Kiranmayi M, Maheswari N (2021) A review on privacy preservation of social networks using graphs. J Appl Secur Res 16(2):190\u2013223","journal-title":"J Appl Secur Res"},{"issue":"5594","key":"5751_CR4","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"5751_CR5","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"issue":"2","key":"5751_CR6","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TNSE.2022.3216803","volume":"10","author":"R Huang","year":"2022","unstructured":"Huang R, Chen Z, Zhai G, He J, Chu X (2022) A graph entropy measure from urelement to higher-order graphlets for network analysis. IEEE Trans Netw Sci Eng 10(2):631\u2013644","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"5751_CR7","doi-asserted-by":"publisher","first-page":"122237","DOI":"10.1016\/j.techfore.2022.122237","volume":"187","author":"Y Hong","year":"2023","unstructured":"Hong Y, Hu J, Zhao Y (2023) Would you go invisible on social media? An empirical study on the antecedents of users\u2019 lurking behavior. Technol Forecast Soc Change 187:122237","journal-title":"Technol Forecast Soc Change"},{"key":"5751_CR8","doi-asserted-by":"publisher","first-page":"4374","DOI":"10.1109\/ACCESS.2020.3036101","volume":"10","author":"Y Gao","year":"2022","unstructured":"Gao Y, Li Y, Sun Y, Cai Z, Ma L, Pusti\u0161ek M, Hu S (2022) IEEE access special section: privacy preservation for large-scale user data in social networks. IEEE Access 10:4374\u20134379","journal-title":"IEEE Access"},{"issue":"1","key":"5751_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1186\/s40537-022-00566-7","volume":"9","author":"F Cerruto","year":"2022","unstructured":"Cerruto F, Cirillo S, Desiato D, Gambardella SM, Polese G (2022) Social network data analysis to highlight privacy threats in sharing data. J Big Data 9(1):19","journal-title":"J Big Data"},{"key":"5751_CR10","doi-asserted-by":"crossref","unstructured":"Rossi A, Arenas MP, Kocyigit E, Hani M (2022) Challenges of protecting confidentiality in social media data and their ethical import. In: 2022 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp 554\u2013561","DOI":"10.1109\/EuroSPW55150.2022.00066"},{"key":"5751_CR11","doi-asserted-by":"crossref","unstructured":"Shejy G (2022) Data privacy and security in social networks. In: Principles of Social Networking: The New Horizon and Emerging Challenges, pp 387\u2013411","DOI":"10.1007\/978-981-16-3398-0_17"},{"issue":"4","key":"5751_CR12","first-page":"669","volume":"45","author":"W Qian","year":"2022","unstructured":"Qian W, Shen Q, Wu P, Wu Z (2022) Research progress on privacy-preserving techniques in big data computing environment. Chin J Comput 45(4):669\u2013701","journal-title":"Chin J Comput"},{"key":"5751_CR13","doi-asserted-by":"publisher","first-page":"3239","DOI":"10.1109\/TIFS.2020.2985524","volume":"15","author":"C Wei","year":"2020","unstructured":"Wei C, Ji S, Liu C, Chen W, Wang T (2020) AsgLDP: collecting and generating decentralized attributed graphs with local differential privacy. IEEE Trans Inf Forensics Secur 15:3239\u20133254","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"5751_CR14","doi-asserted-by":"crossref","unstructured":"Weng L, Karsai M, Perra N, Menczer F, Flammini A (2018) Attention on weak ties in social and communication networks. In: Complex Spreading Phenomena in Social Systems, 213","DOI":"10.1007\/978-3-319-77332-2_12"},{"key":"5751_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3389\/frai.2020.00046","volume":"3","author":"M Laitinen","year":"2020","unstructured":"Laitinen M, Fatemi M, Lundberg J (2020) Size matters: digital social networks and language change. Front Artif Intell 3:46","journal-title":"Front Artif Intell"},{"issue":"6612","key":"5751_CR16","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.abl4476","volume":"377","author":"K Rajkumar","year":"2022","unstructured":"Rajkumar K, Saint-Jacques G, Bojinov I, Brynjolfsson E, Aral S (2022) A causal test of the strength of weak ties. Science 377(6612):1304\u20131310","journal-title":"Science"},{"key":"5751_CR17","doi-asserted-by":"crossref","unstructured":"Burke M, Kraut R (2013) Using Facebook after losing a job: differential benefits of strong and weak ties. In: Proceedings of the 2013 Conference on Computer Supported Cooperative Work, pp 1419\u20131430","DOI":"10.1145\/2441776.2441936"},{"issue":"1","key":"5751_CR18","first-page":"127","volume":"40","author":"ML Doerfel","year":"2016","unstructured":"Doerfel ML, Moore PJ (2016) Digitizing strength of weak ties: understanding social network relationships through online discourse analysis. Ann Int Commun Assoc 40(1):127\u2013148","journal-title":"Ann Int Commun Assoc"},{"key":"5751_CR19","first-page":"702","volume":"4","author":"Y Liu","year":"2022","unstructured":"Liu Y, Chen H, Liu Y, Zhao D, Li C (2022) State-of-the-art privacy attacks and defenses on graphs. Chin J Comput 4:702\u2013734","journal-title":"Chin J Comput"},{"key":"5751_CR20","first-page":"8887","volume":"975","author":"A Jha","year":"2017","unstructured":"Jha A, Dave M, Madan S (2017) Big data security and privacy: a review on issues, challenges and privacy preserving methods. Int J Comput Appl 975:8887","journal-title":"Int J Comput Appl"},{"issue":"2","key":"5751_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433652","volume":"54","author":"P Ribeiro","year":"2021","unstructured":"Ribeiro P, Paredes P, Silva ME, Aparicio D, Silva F (2021) A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Comput Surv (CSUR) 54(2):1\u201336","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"3","key":"5751_CR22","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/COMST.2016.2533668","volume":"18","author":"JH Abawajy","year":"2016","unstructured":"Abawajy JH, Ninggal MIH, Herawan T (2016) Privacy preserving social network data publication. IEEE Commun Surv Tutorials 18(3):1974\u20131997","journal-title":"IEEE Commun Surv Tutorials"},{"key":"5751_CR23","doi-asserted-by":"publisher","first-page":"114006","DOI":"10.1016\/j.eswa.2020.114006","volume":"164","author":"D Antonakaki","year":"2021","unstructured":"Antonakaki D, Fragopoulou P, Ioannidis S (2021) A survey of twitter research: data model, graph structure, sentiment analysis and attacks. Expert Syst Appl 164:114006","journal-title":"Expert Syst Appl"},{"key":"5751_CR24","doi-asserted-by":"publisher","first-page":"107438","DOI":"10.1016\/j.knosys.2021.107438","volume":"231","author":"W Ye","year":"2021","unstructured":"Ye W, Liu Z, Pan L (2021) Who are the celebrities? Identifying vital users on Sina Weibo microblogging network. Knowl Based Syst 231:107438","journal-title":"Knowl Based Syst"},{"key":"5751_CR25","unstructured":"Mittal P, Papamanthou C, Song D (2012) Preserving link privacy in social network based systems. arXiv preprint arXiv:1208.6189"},{"key":"5751_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.ins.2022.05.040","volume":"605","author":"C Ni","year":"2022","unstructured":"Ni C, Cang LS, Gope P, Min G (2022) Data anonymization evaluation for big data and IoT environment. Inf Sci 605:381\u2013392","journal-title":"Inf Sci"},{"key":"5751_CR27","doi-asserted-by":"crossref","unstructured":"Xue M, Karras P, Chedy R, Kalnis P, Pung HK (2012) Delineating social network data anonymization via random edge perturbation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp 475\u2013484","DOI":"10.1145\/2396761.2396823"},{"key":"5751_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-021-00706-0","volume":"31","author":"K Huang","year":"2022","unstructured":"Huang K, Hu H, Zhou S, Guan J, Ye Q, Zhou X (2022) Privacy and efficiency guaranteed social subgraph matching. VLDB J 31:1\u201322","journal-title":"VLDB J"},{"key":"5751_CR29","doi-asserted-by":"publisher","first-page":"113454","DOI":"10.1016\/j.eswa.2020.113454","volume":"153","author":"R Mortazavi","year":"2020","unstructured":"Mortazavi R, Erfani S (2020) GRAM: an efficient ($$k$$, $$l$$) graph anonymization method. Expert Syst Appl 153:113454","journal-title":"Expert Syst Appl"},{"issue":"1","key":"5751_CR30","first-page":"165","volume":"43","author":"C Tang","year":"2022","unstructured":"Tang C, Li P, Wang H, Wang C, Shen Z (2022) K-vretr privacy protection method for location-based services. J Chin Comput Syst 43(1):165\u2013172","journal-title":"J Chin Comput Syst"},{"key":"5751_CR31","doi-asserted-by":"publisher","first-page":"9102","DOI":"10.1109\/TKDE.2022.3221333","volume":"35","author":"W Ren","year":"2022","unstructured":"Ren W, Ghazinour K, Lian X (2022) $$kt$$-safety: graph release via $$k$$-anonymity and $$t$$-closeness. IEEE Trans Knowl Data Eng 35:9102","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5751_CR32","doi-asserted-by":"crossref","unstructured":"Dwork C, Naor M, Pitassi T, Rothblum GN (2010) Differential privacy under continual observation. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp 715\u2013724","DOI":"10.1145\/1806689.1806787"},{"issue":"3\u20134","key":"5751_CR33","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork C, Roth A et al (2014) The algorithmic foundations of differential privacy. Found Trends Theor Comput Sci 9(3\u20134):211\u2013407","journal-title":"Found Trends Theor Comput Sci"},{"key":"5751_CR34","doi-asserted-by":"crossref","unstructured":"Nguyen HH, Imine A, Rusinowitch M (2015) Differentially private publication of social graphs at linear cost. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp 596\u2013599","DOI":"10.1145\/2808797.2809385"},{"issue":"5","key":"5751_CR35","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1049\/cje.2017.08.008","volume":"27","author":"Y Li","year":"2018","unstructured":"Li Y, Liu S, Li D, Wang J (2018) Release connection fingerprints in social networks using personalized diffierential privacy. Chin J Electron 27(5):1104\u20131110","journal-title":"Chin J Electron"},{"key":"5751_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen BP, Ngo H, Kim J, Kim J (2016) Publishing graph data with subgraph differential privacy. In: Information Security Applications: 16th International Workshop, WISA 2015, Jeju Island, Korea, August 20\u201322, 2015, Revised Selected Papers 16, pp 134\u2013145","DOI":"10.1007\/978-3-319-31875-2_12"},{"key":"5751_CR37","doi-asserted-by":"crossref","unstructured":"Adhikari MB, Suppakitpaisarn V, Paul A, Rangan CP (2020) Two-stage framework for accurate and differentially private network information publication. In: Computational Data and Social Networks: 9th International Conference, CSoNet 2020, Dallas, TX, USA, December 11\u201313, 2020, Proceedings 9, pp 267\u2013279","DOI":"10.1007\/978-3-030-66046-8_22"},{"key":"5751_CR38","doi-asserted-by":"crossref","unstructured":"Roohi L, Rubinstein BI, Teague V (2019) Differentially-private two-party egocentric betweenness centrality. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp 2233\u20132241","DOI":"10.1109\/INFOCOM.2019.8737405"},{"key":"5751_CR39","doi-asserted-by":"publisher","first-page":"102303","DOI":"10.1016\/j.adhoc.2020.102303","volume":"110","author":"B Ning","year":"2021","unstructured":"Ning B, Sun Y, Tao X, Li G (2021) Differential privacy protection on weighted graph in wireless networks. Ad Hoc Netw 110:102303","journal-title":"Ad Hoc Netw"},{"key":"5751_CR40","doi-asserted-by":"publisher","first-page":"118925","DOI":"10.1016\/j.ins.2023.04.004","volume":"636","author":"L Qu","year":"2023","unstructured":"Qu L, Yang J, Wang Y (2023) Homogeneous network publishing privacy protection based on differential privacy uncertainty. Inf Sci 636:118925","journal-title":"Inf Sci"},{"key":"5751_CR41","doi-asserted-by":"publisher","first-page":"4164","DOI":"10.1109\/TKDE.2021.3128946","volume":"35","author":"X Jian","year":"2021","unstructured":"Jian X, Wang Y, Chen L (2021) Publishing graphs under node differential privacy. IEEE Trans Knowl Data Eng 35:4164","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5751_CR42","doi-asserted-by":"crossref","unstructured":"Kassiano V, Gounaris A, Papadopoulos AN, Tsichlas K (2017) Mining uncertain graphs: an overview. In: Algorithmic Aspects of Cloud Computing: Second International Workshop, ALGOCLOUD 2016, Aarhus, Denmark, August 22, 2016, Revised Selected Papers, pp 87\u2013116","DOI":"10.1007\/978-3-319-57045-7_6"},{"issue":"4","key":"5751_CR43","first-page":"1106","volume":"30","author":"ZQ Wu","year":"2019","unstructured":"Wu ZQ, Hu J, Tain YP, Shi WC, Yan J (2019) Privacy preserving algorithms of uncertain graphs in social networks. J Softw 30(4):1106\u20131120","journal-title":"J Softw"},{"key":"5751_CR44","doi-asserted-by":"crossref","unstructured":"Boldi P, Bonchi F, Gionis A, Tassa T (2012) Injecting uncertainty in graphs for identity obfuscation. arXiv preprint arXiv:1208.4145","DOI":"10.14778\/2350229.2350254"},{"key":"5751_CR45","doi-asserted-by":"crossref","unstructured":"Yan J, Zhang L, Shi W, Hu J, Wu Z (2017) Uncertain graph method based on triadic closure improving privacy preserving in social network. In: 2017 International Conference on Networking and Network Applications (NaNA), pp 190\u2013195","DOI":"10.1109\/NaNA.2017.34"},{"key":"5751_CR46","doi-asserted-by":"crossref","unstructured":"Yan J, Zhang L, Tian Y, Wen G, Hu J (2018) An uncertain graph approach for preserving privacy in social networks based on important nodes. pp 107\u2013111","DOI":"10.1109\/NANA.2018.8648723"},{"key":"5751_CR47","doi-asserted-by":"crossref","unstructured":"Xu J, Zhang H, Xu L (2022) An uncertain graph privacy preserving scheme based on node similarity in social networks. In: 2022 IEEE 19th International Conference on Mobile Ad Hoc and Smart Systems (MASS), pp 108\u2013114","DOI":"10.1109\/MASS56207.2022.00022"},{"issue":"1","key":"5751_CR48","first-page":"61","volume":"42","author":"J Zheng","year":"2022","unstructured":"Zheng J, Yang L (2022) Differential privacy algorithm of uncertain graph based on ternary closure. Jiangxi Metall 42(1):61\u201368","journal-title":"Jiangxi Metall"},{"issue":"12","key":"5751_CR49","first-page":"116","volume":"28","author":"J Hu","year":"2018","unstructured":"Hu J, Shi W, Yan J, Wu Z (2018) Research on privacy preserving method based on uncertain graph. Comput Technol Dev Comput Technol Dev 28(12):116\u2013121","journal-title":"Comput Technol Dev Comput Technol Dev"},{"issue":"2","key":"5751_CR50","first-page":"422","volume":"43","author":"J Hu","year":"2022","unstructured":"Hu J, Zhang J, Xu L, Lin L (2022) Research on influence of relationship between attribute and density affinity. J Chin Comput Syst 43(2):422\u2013429","journal-title":"J Chin Comput Syst"},{"issue":"7","key":"5751_CR51","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1109\/TCYB.2017.2720180","volume":"48","author":"Z Li","year":"2017","unstructured":"Li Z, Liu J, Wu K (2017) A multiobjective evolutionary algorithm based on structural and attribute similarities for community detection in attributed networks. IEEE Trans Cybern 48(7):1963\u20131976","journal-title":"IEEE Trans Cybern"},{"key":"5751_CR52","doi-asserted-by":"crossref","unstructured":"Tian Y, Yan J, Hu J, Wu Z (2018) A privacy preserving model in uncertain graph mining. In: 2018 International Conference on Networking and Network Applications (NaNA), pp 102\u2013106","DOI":"10.1109\/NANA.2018.8648772"},{"key":"5751_CR53","doi-asserted-by":"crossref","unstructured":"Rioul O (2021) This is it: a primer on Shannon\u2019s entropy and information. In: Information Theory: Poincar\u00e9 Seminar 2018, pp 49\u201386","DOI":"10.1007\/978-3-030-81480-9_2"},{"issue":"6","key":"5751_CR54","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1109\/TIT.2016.2555904","volume":"62","author":"A Li","year":"2016","unstructured":"Li A, Pan Y (2016) Structural information and dynamical complexity of networks. IEEE Trans Inf Theory 62(6):3290\u20133339","journal-title":"IEEE Trans Inf Theory"},{"key":"5751_CR55","doi-asserted-by":"crossref","unstructured":"Bhuiyan MA, Rahman M, Rahman M, Al\u00a0Hasan M (2012) Guise: uniform sampling of graphlets for large graph analysis. In: 2012 IEEE 12th International Conference on Data Mining. IEEE, pp 91\u2013100","DOI":"10.1109\/ICDM.2012.87"},{"key":"5751_CR56","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-44485-5_9","volume-title":"Complex Networks","author":"RV Sol\u00e9","year":"2004","unstructured":"Sol\u00e9 RV, Valverde S (2004) Information theory of complex networks: on evolution and architectural constraints. In: Ben-Naim E, Frauenfelder H, Toroczkai Z (eds) Complex Networks. Springer, Berlin, pp 189\u2013207"},{"issue":"1","key":"5751_CR57","doi-asserted-by":"publisher","first-page":"9340","DOI":"10.1038\/s41598-017-09475-9","volume":"7","author":"M Cai","year":"2017","unstructured":"Cai M, Cui Y, Stanley HE (2017) Analysis and evaluation of the entropy indices of a static network structure. Sci Rep 7(1):9340","journal-title":"Sci Rep"},{"key":"5751_CR58","doi-asserted-by":"crossref","unstructured":"Xu X, Yuruk N, Feng Z, Schweiger TA (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 824\u2013833","DOI":"10.1145\/1281192.1281280"},{"key":"5751_CR59","unstructured":"Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, vol 25"},{"key":"5751_CR60","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM\u201920). ACM, pp 1325\u20131334","DOI":"10.1145\/3340531.3411866"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05751-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05751-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05751-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T11:36:20Z","timestamp":1711366580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05751-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"references-count":60,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["5751"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05751-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"19 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}