{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:48:49Z","timestamp":1773661729621,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00500-025-10734-5","type":"journal-article","created":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T10:45:50Z","timestamp":1771411550000},"page":"2109-2133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Effective resistance and kernel-based graph sparsification for community detection in complex networks"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5420-9959","authenticated-orcid":false,"given":"Annalisa","family":"Socievole","sequence":"first","affiliation":[]},{"given":"Clara","family":"Pizzuti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,18]]},"reference":[{"key":"10734_CR1","unstructured":"Arora R, Upadhyay J (2019) On differentially private graph sparsification and applications. Advances in neural information processing systems 32"},{"key":"10734_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejc.2018.02.002","volume":"80","author":"K Avrachenkov","year":"2019","unstructured":"Avrachenkov K, Chebotarev P, Rubanov D (2019) Similarities on graphs: Kernels versus proximity measures. European Journal of Combinatorics 80:47\u201356","journal-title":"European Journal of Combinatorics"},{"key":"10734_CR3","doi-asserted-by":"crossref","unstructured":"Avrachenkov K, Chebotarev P, Rubanov D (2017) Kernels on graphs as proximity measures. In: International Workshop on Algorithms and Models for the Web-graph, pp 27\u201341. Springer","DOI":"10.1007\/978-3-319-67810-8_3"},{"key":"10734_CR4","doi-asserted-by":"crossref","unstructured":"Aynulin R (2019) Impact of network topology on efficiency of proximity measures for community detection. In: International Conference on Complex Networks and Their Applications, pp 188\u2013197. Springer","DOI":"10.1007\/978-3-030-36687-2_16"},{"key":"10734_CR5","doi-asserted-by":"crossref","unstructured":"Aynulin R (2019) Efficiency of transformations of proximity measures for graph clustering. In: Algorithms and Models for the Web Graph: 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6\u20137, 2019, Proceedings 16, pp 16\u201329. Springer","DOI":"10.1007\/978-3-030-25070-6_2"},{"key":"10734_CR6","doi-asserted-by":"crossref","unstructured":"Barrat A, Barthelemy M, Pastor-Satorras R, Vespignan A (2004) The architecture of complex weighted networks. In: Proc. National Academy of Science, pp. 1013747\u2013","DOI":"10.1073\/pnas.0400087101"},{"key":"10734_CR7","doi-asserted-by":"crossref","unstructured":"Bencz\u00far AA, Karger DR (1996) Approximating st minimum cuts in \u00f5 (n 2) time. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp 47\u201355","DOI":"10.1145\/237814.237827"},{"key":"10734_CR8","doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008(10):10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"issue":"4","key":"10734_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01270385","volume":"6","author":"AK Chandra","year":"1996","unstructured":"Chandra AK, Raghavan P, Ruzzo WL, Smolensky R, Tiwari P (1996) The electrical resistance of a graph captures its commute and cover times. Computational Complexity 6(4):312\u2013340","journal-title":"Computational Complexity"},{"key":"10734_CR10","unstructured":"Chebotarev P, Shamis E (2006) On proximity measures for graph vertices. arXiv preprint math\/0602073"},{"issue":"1","key":"10734_CR11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"J Chen","year":"2021","unstructured":"Chen J, Li J, Bruna J (2021) Deep learning on graphs for node classification: A survey. IEEE Transactions on Neural Networks and Learning Systems 32(1):4\u201324","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10734_CR12","doi-asserted-by":"crossref","unstructured":"Coscia M, Neffke FM (2017) Network backboning with noisy data. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp 425\u2013436. IEEE","DOI":"10.1109\/ICDE.2017.100"},{"key":"10734_CR13","doi-asserted-by":"crossref","unstructured":"Coscia M, Rossi L (2019) The impact of projection and backboning on network topologies. In: Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp 286\u2013293","DOI":"10.1145\/3341161.3342862"},{"issue":"1","key":"10734_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.93.012304","volume":"93","author":"N Dianati","year":"2016","unstructured":"Dianati N (2016) Unwinding the hairball graph: Pruning algorithms for weighted complex networks. Physical Review E 93(1):012304","journal-title":"Physical Review E"},{"key":"10734_CR15","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222","volume-title":"Random Walks and Electric Networks","author":"PG Doyle","year":"1984","unstructured":"Doyle PG, Snell JL (1984) Random Walks and Electric Networks. The Mathematical Association of America, USA"},{"issue":"1","key":"10734_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern recognition 41(1):176\u2013190","journal-title":"Pattern recognition"},{"key":"10734_CR17","doi-asserted-by":"crossref","unstructured":"Fung WS, Hariharan R, Harvey NJ, Panigrahi D (2011) A general framework for graph sparsification. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp 71\u201380","DOI":"10.1145\/1993636.1993647"},{"key":"10734_CR18","doi-asserted-by":"crossref","unstructured":"Gancio J, Rubido N (2022) Community detection by resistance distance: automation and benchmark testing. In: Complex Networks & Their Applications X: Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021 10, pp 309\u2013320. Springer","DOI":"10.1007\/978-3-030-93409-5_26"},{"key":"10734_CR19","unstructured":"Goldberg DE (1989) Genetic algorithms in search. Optimization, and MachineLearning"},{"issue":"12","key":"10734_CR20","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proceedings of the national academy of sciences 99(12):7821\u20137826","journal-title":"Proceedings of the national academy of sciences"},{"key":"10734_CR21","first-page":"1025","volume":"30","author":"WL Hamilton","year":"2017","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. Advances in Neural Information Processing Systems (NeurIPS) 30:1025\u20131035 arXiv:1706.02216","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"10734_CR22","unstructured":"Hashemi M, Gong S, Ni J, Fan W, Prakash BA, Jin W (2024) A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation. arXiv preprint arXiv:2402.03358"},{"key":"10734_CR23","doi-asserted-by":"crossref","unstructured":"Jambulapati A, Sachdeva S, Sidford A, Tian K, Zhao Y (2024) Eulerian graph sparsification by effective resistance decomposition. arXiv preprint arXiv:2408.10172","DOI":"10.1137\/1.9781611978322.50"},{"issue":"13","key":"10734_CR24","doi-asserted-by":"publisher","first-page":"6811","DOI":"10.3390\/app12136811","volume":"12","author":"J Kim","year":"2022","unstructured":"Kim J, Jeong S, Lim S (2022) Link pruning for community detection in social networks. Applied Sciences 12(13):6811","journal-title":"Applied Sciences"},{"key":"10734_CR25","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations (ICLR). arXiv:1609.02907"},{"issue":"1","key":"10734_CR26","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randi\u0107 M (1993) Resistance distance. Journal of mathematical chemistry 12(1):81\u201395","journal-title":"Journal of mathematical chemistry"},{"issue":"1","key":"10734_CR27","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1038\/s41467-018-08160-3","volume":"10","author":"T Kobayashi","year":"2019","unstructured":"Kobayashi T, Takaguchi T, Barrat A (2019) The structured backbone of temporal social ties. Nature communications 10(1):220","journal-title":"Nature communications"},{"issue":"4","key":"10734_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Physical review E 78(4):046110","journal-title":"Physical review E"},{"key":"10734_CR29","doi-asserted-by":"crossref","unstructured":"Li J, Zhang T, Tian H, Jin S, Fardad M, Zafarani R (2022) Graph sparsification with graph convolutional networks. International Journal of Data Science and Analytics, 1\u201314","DOI":"10.1007\/s41060-021-00288-8"},{"key":"10734_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"Z Li","year":"2020","unstructured":"Li Z, Han Z, Wu S, Wang L, Wang X (2020) Graph neural networks: A review of methods and applications. AI Open 1:57\u201381","journal-title":"AI Open"},{"key":"10734_CR31","unstructured":"Liu Z, Zhou K, Jiang Z, Li L, Chen R, Choi S-H, Hu X (2023) Dspar: An embarrassingly simple strategy for efficient gnn training and inference via degree-based sparsification. Transactions on Machine Learning Research"},{"issue":"23","key":"10734_CR32","first-page":"9807","volume":"8","author":"B Lu","year":"2012","unstructured":"Lu B, Liu C, Wang Y (2012) Discovery of community structure in complex networks based on resistance distance and center nodes. J. Comput. Inf. Syst 8(23):9807\u20139814","journal-title":"J. Comput. Inf. Syst"},{"issue":"11","key":"10734_CR33","doi-asserted-by":"publisher","first-page":"1010650","DOI":"10.1371\/journal.pcbi.1010650","volume":"18","author":"A Mercier","year":"2022","unstructured":"Mercier A, Scarpino S, Moore C (2022) Effective resistance against pandemics: Mobility network sparsification for high-fidelity epidemic simulations. PLOS Computational Biology 18(11):1010650","journal-title":"PLOS Computational Biology"},{"issue":"4","key":"10734_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042822","volume":"88","author":"ME Newman","year":"2013","unstructured":"Newman ME (2013) Spectral methods for community detection and graph partitioning. Physical Review E-Statistical, Nonlinear, and Soft Matter Physics 88(4):042822","journal-title":"Physical Review E-Statistical, Nonlinear, and Soft Matter Physics"},{"key":"10734_CR35","unstructured":"Park Y, Song M (1998) A genetic algorithm for clustering problems. In: Proceedings of the Third Annual Conference on Genetic Programming, vol. 1998, pp 568\u2013575"},{"key":"10734_CR36","doi-asserted-by":"crossref","unstructured":"Pizzuti C, Socievole A (2021) An effective resistance based genetic algorithm for community detection. In: IJCCI, pp 28\u201336","DOI":"10.5220\/0010644300003063"},{"key":"10734_CR37","doi-asserted-by":"crossref","unstructured":"Pizzuti C, Socievole A (2021) Effective resistance based weight thresholding for community detection. In: Italian Workshop on Artificial Life and Evolutionary Computation, pp 14\u201323. Springer","DOI":"10.1007\/978-3-031-23929-8_2"},{"key":"10734_CR38","doi-asserted-by":"crossref","unstructured":"Pizzuti C, Socievole A (2022) Kernels on attributed networks for community detection. In: 2022 13th International Conference on Information, Intelligence, Systems & Applications (IISA), pp 1\u20138. IEEE","DOI":"10.1109\/IISA56318.2022.9904348"},{"issue":"4","key":"10734_CR39","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences 105(4):1118\u20131123","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"10734_CR40","doi-asserted-by":"publisher","first-page":"68001","DOI":"10.1209\/0295-5075\/101\/68001","volume":"101","author":"N Rubido","year":"2013","unstructured":"Rubido N, Grebogi C, Baptista MS (2013) Structure and function in flow networks. Europhysics Letters 101(6):68001","journal-title":"Europhysics Letters"},{"key":"10734_CR41","doi-asserted-by":"crossref","unstructured":"Saerens M, Fouss F, Yen L, Dupont P (2004) The principal components analysis of a graph, and its relationships to spectral clustering. In: European Conference on Machine Learning, pp 371\u2013383. Springer","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"10734_CR42","doi-asserted-by":"crossref","unstructured":"Socievole A, Pizzuti C (2023) Community detection in dense networks using effective resistance and link pruning. In: 2023 International Conference on Information and Communication Technologies for Disaster Management (ICT-DM), pp 1\u20137. IEEE","DOI":"10.1109\/ICT-DM58371.2023.10286913"},{"key":"10734_CR43","doi-asserted-by":"crossref","unstructured":"Socievole A, Pizzuti C (2023) Effective resistance based community detection in complex networks. In: International Conference on Numerical Computations: Theory and Algorithms, pp 197\u2013209. Springer","DOI":"10.1007\/978-3-031-81241-5_14"},{"key":"10734_CR44","doi-asserted-by":"crossref","unstructured":"Sommer F, Fouss F, Saerens M (2016) Comparison of graph node distances on clustering tasks. In: International Conference on Artificial Neural Networks, pp 192\u2013201. Springer","DOI":"10.1007\/978-3-319-44778-0_23"},{"key":"10734_CR45","doi-asserted-by":"crossref","unstructured":"Sommer F, Fouss F, Saerens M (2016) Comparison of graph node distances on clustering tasks. In: Artificial Neural Networks and Machine Learning - ICANN 2016 - 25th International Conference on Artificial Neural Networks, Barcelona, Spain, September 6-9, 2016, Proceedings, Part I, pp 192\u2013201","DOI":"10.1007\/978-3-319-44778-0_23"},{"key":"10734_CR46","doi-asserted-by":"crossref","unstructured":"Sommer F, Fouss F, Saerens M (2017) Modularity-driven kernel k-means for community detection. In: Artificial Neural Networks and Machine Learning - ICANN 2017 - 26th International Conference on Artificial Neural Networks, Alghero, Italy, September 11-14, 2017, Proceedings, Part II, pp 423\u2013433","DOI":"10.1007\/978-3-319-68612-7_48"},{"key":"10734_CR47","doi-asserted-by":"crossref","unstructured":"Spielman DA, Srivastava N (1996) Graph sparsification by effective resistances. Siam Journal on Computing (40), 1913","DOI":"10.1137\/080734029"},{"key":"10734_CR48","doi-asserted-by":"crossref","unstructured":"Spielman DA, Srivastava N (2008) Graph sparsification by effective resistances. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp 563\u2013568","DOI":"10.1145\/1374376.1374456"},{"issue":"1","key":"10734_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2024.107404","volume":"362","author":"Z Su","year":"2025","unstructured":"Su Z, Kurths J, Meyerhenke H (2025) Generic network sparsification via hybrid edge sampling. Journal of the Franklin Institute 362(1):107404","journal-title":"Journal of the Franklin Institute"},{"key":"10734_CR50","volume-title":"Graph Spectra for Complex Networks","author":"P Van Mieghem","year":"2011","unstructured":"Van Mieghem P (2011) Graph Spectra for Complex Networks. Cambridge University Press, New York, NY, USA"},{"issue":"3","key":"10734_CR51","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.032311","volume":"96","author":"P Van Mieghem","year":"2017","unstructured":"Van Mieghem P, Devriendt K, Cetinay H (2017) Pseudoinverse of the laplacian and best spreader node in a network. Physical Review E 96(3):032311","journal-title":"Physical Review E"},{"key":"10734_CR52","doi-asserted-by":"publisher","unstructured":"Wang C, Pei J, Bailey J, Zhou Y, Zhang R, Qin L (2019) Dynamic graph neural networks for attributed community detection. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD), pp 1229\u20131237. https:\/\/doi.org\/10.1145\/3292500.3330867","DOI":"10.1145\/3292500.3330867"},{"key":"10734_CR53","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.042304","volume":"E98","author":"X Yan","year":"2018","unstructured":"Yan X, Jeub LGS, Flammini A, Radicchi F, Fortunato S (2018) Weight thresholding on complex networks. Physical Review E E98:042304","journal-title":"Physical Review E"},{"key":"10734_CR54","doi-asserted-by":"crossref","unstructured":"Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2007) Graph nodes clustering based on the commute-time kernel. In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp 1037\u20131045","DOI":"10.1007\/978-3-540-71701-0_117"},{"issue":"3","key":"10734_CR55","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.datak.2008.10.006","volume":"68","author":"L Yen","year":"2009","unstructured":"Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2009) Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. Data & Knowledge Engineering 68(3):338\u2013361","journal-title":"Data & Knowledge Engineering"},{"key":"10734_CR56","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.datak.2008.10.006","volume":"68","author":"L Yen","year":"2009","unstructured":"Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2009) Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. Data & Knowledge Engineering 68:338\u2013361","journal-title":"Data & Knowledge Engineering"},{"key":"10734_CR57","unstructured":"Yu S, Alesiani F, Yin W, Jenssen R, Principe JC (2022) Principle of relevant information for graph sparsification. In: Uncertainty in Artificial Intelligence, pp 2331\u20132341. PMLR"},{"key":"10734_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.018","volume":"526","author":"T Zhang","year":"2019","unstructured":"Zhang T, Bu C (2019) Detecting community structure in complex networks via resistance distance. Physica A: Statistical Mechanics and its Applications 526:120782","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"10734_CR59","doi-asserted-by":"crossref","unstructured":"Zhang Z, Cui P, Zhu W, Zheng Y, Wang F (2019) Attributed graph clustering: A deep attentive embedding approach. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp 4327\u20134333. arXiv:1906.06532","DOI":"10.24963\/ijcai.2019\/601"},{"key":"10734_CR60","unstructured":"Zhang G, Sun X, Yue Y, Jiang C, Wang K, Chen T, Pan S (2024) Graph sparsification via mixture of graphs. arXiv preprint arXiv:2405.14260"},{"key":"10734_CR61","doi-asserted-by":"crossref","unstructured":"Zheng Z, Chen X, Lin X (2023) Kernel based dual-channel attributed graph community detection. IEEE Transactions on Network Science and Engineering","DOI":"10.1109\/TNSE.2023.3302530"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10734-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10734-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10734-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:48:57Z","timestamp":1773658137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10734-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,18]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10734"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10734-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,18]]},"assertion":[{"value":"25 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2026","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}