{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:02:23Z","timestamp":1773662543590,"version":"3.50.1"},"reference-count":121,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NUS ODPRT","award":["R-252-000-C04-133"],"award-info":[{"award-number":["R-252-000-C04-133"]}]},{"name":"National Science Foundation","award":["CCF-2008422"],"award-info":[{"award-number":["CCF-2008422"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00446-025-00496-6","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:29:59Z","timestamp":1773656999000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Narrowing the LOCAL\u2013CONGEST gaps in sparse networks via expander decompositions"],"prefix":"10.1007","volume":"39","author":[{"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Hao","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"key":"496_CR1","unstructured":"Alev, V.L., Anari, N., Lau, L.C., Gharan, S.O.: Graph clustering using effective resistance. In: 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11\u201314, 2018, Cambridge, MA, USA, pp. 41(1\u201341), 16 (2018)"},{"key":"496_CR2","doi-asserted-by":"crossref","unstructured":"Akhoondian Amiri, S., Schmid, S., Siebertz, S.: A local constant factor MDS approximation for bounded genus graphs. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 227\u2013233 (2016)","DOI":"10.1145\/2933057.2933084"},{"key":"496_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithm 7, 567\u2013583 (1986)","journal-title":"J. Algorithm"},{"issue":"5","key":"496_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2775105","volume":"62","author":"S Arora","year":"2015","unstructured":"Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. J. ACM 62(5), 1\u201325 (2015)","journal-title":"J. ACM"},{"issue":"3","key":"496_CR5","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/17M1112406","volume":"48","author":"I Abraham","year":"2019","unstructured":"Abraham, I., Gavoille, C., Gupta, A., Neiman, O., Talwar, K.: Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. SIAM J. Comput. 48(3), 1120\u20131145 (2019)","journal-title":"SIAM J. Comput."},{"key":"496_CR6","unstructured":"Ahmadi, M., Kuhn, F., Oshman, R.: Distributed approximate maximum matching in the CONGEST model. In: Proc.\u00a032nd International Symposium on Distributed Computing (DISC), pp. 6:1\u20136:17 (2018)"},{"key":"496_CR7","doi-asserted-by":"crossref","unstructured":"Arasu, A., R\u00e9, C., Suciu, D.: Large-scale deduplication with constraints using dedupalog. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 952\u2013963 (2009)","DOI":"10.1109\/ICDE.2009.43"},{"issue":"3","key":"496_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326170","volume":"15","author":"Saeed Akhoondian Amiri","year":"2019","unstructured":"Amiri, Saeed Akhoondian, Schmid, Stefan, Siebertz, Sebastian: Distributed dominating set approximations beyond planar graphs. ACM Trans. Algorithms (TALG) 15(3), 1\u201318 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1\u20133","key":"496_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"496_CR10","doi-asserted-by":"crossref","unstructured":"Bachrach, N., Censor-Hillel, K., Dory, M., Efron, Y., Leitersdorf, D., Paz, A.: Hardness of distributed optimization. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), pp. 238\u2013247 (2019)","DOI":"10.1145\/3293611.3331597"},{"key":"496_CR11","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Censor-Hillel, K., Ghaffari, M., Schwartzman, G.: Distributed approximation of maximum independent set and maximum matching. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 165\u2013174 (2017)","DOI":"10.1145\/3087801.3087806"},{"key":"496_CR12","unstructured":"Bonamy, M., Cook, L., Groenland, C., Wesolek, A.: A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. In: Seth G. (eds) 35th International Symposium on Distributed Computing (DISC 2021), volume 209 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 13:1\u201313:18, Dagstuhl, Germany (2021)"},{"issue":"5\u20136","key":"496_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22(5\u20136), 363\u2013379 (2010)","journal-title":"Distrib. Comput."},{"issue":"3","key":"496_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63(3), 20\u201345 (2016)","journal-title":"J. ACM"},{"key":"496_CR15","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Feuilloley, L., Pierron, T.: Local certification of graph decompositions and applications to minor-free classes. CoRR abs\/2108.00059 (2021)","DOI":"10.2139\/ssrn.4223289"},{"key":"496_CR16","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Garcia-Soriano, D., Liberty, E.: Correlation clustering: From theory to practice. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201914, pp. 1972\u20131972 (2014)","DOI":"10.1145\/2623330.2630808"},{"key":"496_CR17","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Chang, Y-J., Le Gall, F., Leitersdorf, D.: Tight distributed listing of cliques. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2878\u20132891. SIAM (2021)","DOI":"10.1137\/1.9781611976465.171"},{"key":"496_CR18","first-page":"15","volume":"209","author":"M\u00e9lanie Cambus","year":"2021","unstructured":"Cambus, M\u00e9lanie., Choo, Davin, Miikonen, Havu, Uitto, Jara: Massively parallel correlation clustering in bounded arboricity graphs. In 35th International Symposium on Distributed Computing (DISC) 209, 15\u201318 (2021)","journal-title":"In 35th International Symposium on Distributed Computing (DISC)"},{"key":"496_CR19","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Dalvi, N., Kumar, R.: Correlation clustering in mapreduce. In: Proc.\u00a020th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 641\u2013650 (2014)","DOI":"10.1145\/2623330.2623743"},{"key":"496_CR20","unstructured":"Censor-Hillel, K.: Distributed Subgraph Finding: Progress and Challenges. In: Nikhil, B., Emanuela, M., James, W. (eds.) 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 3:1\u20133:14. Dagstuhl, Germany (2021)"},{"issue":"1","key":"496_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00446-018-0324-8","volume":"32","author":"K Censor-Hillel","year":"2019","unstructured":"Censor-Hillel, K., Fischer, E., Schwartzman, G., Vasudev, Y.: Fast distributed algorithms for testing graph properties. Distrib. Comput. 32(1), 41\u201357 (2019)","journal-title":"Distrib. Comput."},{"key":"496_CR22","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Gao, Y., Li, J., Nanongkai, D., Peng, R., Saranurak, T. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In: Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1158\u20131167. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00111"},{"issue":"3","key":"496_CR23","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"496_CR24","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.jda.2005.07.006","volume":"4","author":"A Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed algorithms for weighted problems in sparse graphs. J. Discrete Algorithms 4(4), 588\u2013607 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"496_CR25","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed almost exact approximations for minor-closed families. In: Yossi, A., Thomas, E. (eds.) Algorithms\u2014ESA 2006, pp. 244\u2013255. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11841036_24"},{"key":"496_CR26","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed approximation algorithms for weighted problems in minor-closed families. In: Proceedings of the 13th Annual International Conference on Computing and Combinatorics (COCOON), pp. 515\u2013525. Springer, Berlin(2007)","DOI":"10.1007\/978-3-540-73545-8_50"},{"key":"496_CR27","doi-asserted-by":"crossref","unstructured":"Chang, Y-J.: Efficient distributed decomposition and routing algorithms in minor-free networks and their applications. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 55\u201366 (2023)","DOI":"10.1145\/3583668.3594604"},{"key":"496_CR28","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Szyma\u0144ska, E.: Distributed approximation algorithms for planar graphs. In: Italian Conference on Algorithms and Complexity (CIAC) (2006)","DOI":"10.1007\/11758471_29"},{"key":"496_CR29","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Hanckowiak, M., Szymanska, E.: Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs. In: Proceedings of International Symposium on Algorithms and Computation (ISAAC), volume 5878 of Lecture Notes in Computer Science, pp. 668\u2013678 (2009)","DOI":"10.1007\/978-3-642-10631-6_68"},{"key":"496_CR30","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Han\u0107kowiak, M., Szyma\u0144ska, E., Wawrzyniak, W., Witkowski, M.: Distributed local approximation of the minimum k-tuple dominating set in planar graphs. In International Conference on Principles of Distributed Systems (OPODIS), pp. 49\u201359. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-14472-6_4"},{"key":"496_CR31","doi-asserted-by":"crossref","unstructured":"Chang, Y-J., Huang, S-E., Hsin-Hao, S.: Deterministic expander routing: Faster and more versatile. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 194\u2013204 (2024)","DOI":"10.1145\/3662158.3662797"},{"key":"496_CR32","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: International Symposium on Distributed Computing (DISC), pp. 78\u201392. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"496_CR33","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.tcs.2019.12.027","volume":"809","author":"A Czygrinow","year":"2020","unstructured":"Czygrinow, A., Han\u0107kowiak, M., Wawrzyniak, W., Witkowski, M.: Distributed approximation algorithms for $$k$$-dominating set in graphs of bounded genus and linklessly embeddable graphs. Theoret. Comput. Sci. 809, 327\u2013338 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"496_CR34","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Le Gall, F., Leitersdorf, D.: On distributed listing of cliques. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 474\u2013482 (2020)","DOI":"10.1145\/3382734.3405742"},{"key":"496_CR35","unstructured":"Chuzhoy, J., Nimavat, R.: Large minors in expanders. arXiv:1901.09349 (2019)"},{"issue":"3","key":"496_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446330","volume":"68","author":"Yi-Jun Chang","year":"2021","unstructured":"Chang, Yi-Jun., Pettie, Seth, Saranurak, Thatchaphol, Zhang, Hengjie: Near-optimal distributed triangle enumeration via expander decompositions. J. ACM 68(3), 1\u201336 (2021)","journal-title":"J. ACM"},{"key":"496_CR37","doi-asserted-by":"crossref","unstructured":"Chang, Y-J., Saranurak, T.: Deterministic distributed expander decomposition and routing with applications in distributed derandomization. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2020)","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"496_CR38","doi-asserted-by":"crossref","unstructured":"Chang, Y.-J., Su, H.-H.: Narrowing the LOCAL-CONGEST gaps in sparse networks via expander decompositions. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC), pp. 301\u2013312. New York, NY, USA (2022)","DOI":"10.1145\/3519270.3538423"},{"issue":"2","key":"496_CR39","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K Diks","year":"1993","unstructured":"Diks, K., Djidjev, H.N., Sykora, O., Vrto, I.: Edge separators of planar and outerplanar graphs with applications. J. Algorithms 14(2), 258\u2013279 (1993)","journal-title":"J. Algorithms"},{"key":"496_CR40","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201904, pp. 840\u2013849. USA (2004)"},{"key":"496_CR41","doi-asserted-by":"crossref","unstructured":"Daga, M., Henzinger, M., Nanongkai, D., Saranurak, T.: Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 343\u2013354. New York, NY, USA (2019)","DOI":"10.1145\/3313276.3316346"},{"issue":"1","key":"496_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear time approximation for maximum weight matching. J. ACM 61(1), 1\u201323 (2014)","journal-title":"J. ACM"},{"key":"496_CR43","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with $$0,1$$-vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"496_CR44","unstructured":"Eden, T., Fiat, N., Fischer, O., Kuhn, F., Oshman, R.: Sublinear-time distributed algorithms for detecting small cliques and even cycles. In: Proceedings of the International Symposium on Distributed Computing (DISC), pp. 15:1\u201315:16 (2019)"},{"key":"496_CR45","doi-asserted-by":"crossref","unstructured":"Emanuel, D., Fiat, A., Zwick, U.: Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In: Proc.\u00a0European Symposium on Algorithms (ESA), pp. 208\u2013220 (2003)","DOI":"10.1007\/978-3-540-39658-1_21"},{"key":"496_CR46","doi-asserted-by":"crossref","unstructured":"Efron, Y., Grossman, O., Khoury, S.: Beyond alice and bob: Improved inapproximability for maximum independent set in CONGEST. In: Yuval E., Christian C. (eds.) ACM Symposium on Principles of Distributed Computing (PODC), pp. 511\u2013520 (2020)","DOI":"10.1145\/3382734.3405702"},{"issue":"1","key":"496_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"AK Elmagarmid","year":"2007","unstructured":"Elmagarmid, A.K., Ipeirotis, P.G., Verykios, V.S.: Duplicate record detection: a survey. IEEE Trans. Knowl. Data Eng. 19(1), 1\u201316 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"496_CR48","doi-asserted-by":"crossref","unstructured":"Esperet, L., L\u00e9v\u00eaque, B.: Local certification of graphs on surfaces. arXiv:2102.04133 (2021)","DOI":"10.1016\/j.tcs.2022.01.023"},{"key":"496_CR49","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ic.2018.07.001","volume":"262","author":"G Even","year":"2018","unstructured":"Even, G., Medina, M., Ron, D.: Best of two local models: centralized local and distributed local algorithms. Inf. Comput. 262, 69\u201389 (2018)","journal-title":"Inf. Comput."},{"issue":"3","key":"496_CR50","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"496_CR51","doi-asserted-by":"crossref","unstructured":"Elsner, M., Schudy, W.: Bounding and comparing methods for correlation clustering beyond ILP. In: Proceedings of the Workshop on Integer Linear Programming for Natural Language Processing, pages 19\u201327, Boulder, Colorado (2009)","DOI":"10.3115\/1611638.1611641"},{"key":"496_CR52","unstructured":"Faour, S., Fuchs, M., Kuhn, F.: Distributed CONGEST approximation of weighted vertex covers and matchings. CoRR, abs\/2111.10577 (2021)"},{"key":"496_CR53","unstructured":"Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., R\u00e9mila, E., Todinca, I.: local certification of graphs with bounded genus. CoRR, abs\/2007.08084 (2020)"},{"key":"496_CR54","doi-asserted-by":"crossref","unstructured":"Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., R\u00e9mila, \u00c9., Todinca, I.: Compact distributed certification of planar graphs. Algorithmica, pp. 1\u201330 (2021)","DOI":"10.1007\/s00453-021-00823-w"},{"key":"496_CR55","doi-asserted-by":"crossref","unstructured":"Fischer, M., Ghaffari, M., Kuhn, F.: Deterministic distributed edge-coloring via hypergraph maximal matching. In: Proc.\u00a058th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 180\u2013191 (2017)","DOI":"10.1109\/FOCS.2017.25"},{"key":"496_CR56","unstructured":"Fischer, M.: Improved deterministic distributed matching via rounding. Distrib. Comput. 1\u201313 (2018)"},{"key":"496_CR57","unstructured":"Fischer, M., Mitrovic, S., Uitto, J.: Deterministic (1+$$\\epsilon $$)-approximate maximum matching with poly(1\/$$\\epsilon $$) passes in the semi-streaming model. STOC 2022, abs\/2106.04179 (2021)"},{"key":"496_CR58","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Talwar, K.: An improved decomposition theorem for graphs excluding a fixed minor. In: Sanjeev A., Klaus J., Jos\u00e9 D.P.R., Amit S. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 36\u201346. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45198-3_4"},{"key":"496_CR59","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Grunau, C., Rozhon, V.: Improved deterministic network decomposition. In Proc.\u00a02021 ACM-SIAM Symposium on Discrete Algorithms, pp. 2904\u20132923. SIAM (2021)","DOI":"10.1137\/1.9781611976465.173"},{"key":"496_CR60","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks I: Planar embedding. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 29\u201338 (2016)","DOI":"10.1145\/2933057.2933109"},{"key":"496_CR61","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks II: Low-congestion shortcuts, MST, and min-cut. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 202\u2013219. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"496_CR62","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Low-congestion shortcuts for graphs excluding dense minors. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing PODC, pp. 213\u2013221 (2021)","DOI":"10.1145\/3465084.3467935"},{"key":"496_CR63","doi-asserted-by":"crossref","unstructured":"Mohsen, G., Harris, D.G., Fabian, K.: On derandomizing local distributed algorithms. In: Proc.\u00a059th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 662\u2013673 (2018)","DOI":"10.1109\/FOCS.2018.00069"},{"key":"496_CR64","unstructured":"Apache Giraph. http:\/\/giraph.apache.org"},{"key":"496_CR65","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 784\u2013797 (2017)","DOI":"10.1145\/3055399.3055471"},{"key":"496_CR66","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y., Uitto, J.: Deterministic distributed edge-coloring with fewer colors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 418\u2013430. ACM, New York, NY, USA (2018)","DOI":"10.1145\/3188745.3188906"},{"key":"496_CR67","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Hsin-Hao, S.: Distributed MST and routing in almost mixing time. In: Proceedings 37th ACM Symposium on Principles of Distributed Computing (PODC), pp. 131\u2013140 (2017)","DOI":"10.1145\/3087801.3087827"},{"key":"496_CR68","unstructured":"Ghaffari, M., Li, J.: New distributed algorithms in almost mixing time via transformations from parallel algorithms. In: Ulrich S., Josef W. (eds.) Proceedings 32nd International Symposium on Distributed Computing (DISC), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 31:1\u201331:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"496_CR69","unstructured":"Ghaffari, M., Parter, M.: Near-optimal distributed DFS in planar graphs. In: 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"3","key":"496_CR70","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s004930050060","volume":"19","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. Combinatorica 19(3), 335\u2013373 (1999)","journal-title":"Combinatorica"},{"issue":"4","key":"496_CR71","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00493-003-0037-9","volume":"23","author":"M Grohe","year":"2003","unstructured":"Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4), 613\u2013632 (2003)","journal-title":"Combinatorica"},{"key":"496_CR72","unstructured":"Gonzalez, J.E.., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: Graphx: Graph processing in a distributed dataflow framework. In: Proc.\u00a011th USENIX Conference on Operating Systems Design and Implementation (OSDI), pp. 599\u2013613 (2014)"},{"key":"496_CR73","doi-asserted-by":"crossref","unstructured":"Harris, D.G.: Distributed approximation algorithms for maximum matching in graphs and hypergraphs. In: Proc.\u00a060th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 700\u2013724 (2019)","DOI":"10.1109\/FOCS.2019.00048"},{"key":"496_CR74","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Hershkowitz, D. E., Wajc, D. Round-and message-optimal distributed graph algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC), pp. 119\u2013128 (2018)","DOI":"10.1145\/3212734.3212737"},{"key":"496_CR75","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Izumi, T., Zuzic, G.: Low-congestion shortcuts without embedding. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 451\u2013460 (2016)","DOI":"10.1145\/2933057.2933112"},{"key":"496_CR76","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Izumi, T., Zuzic, G.: Near-optimal low-congestion shortcuts on bounded parameter graphs. In: International Symposium on Distributed Computing (DISC), pp. 158\u2013172. Springer, Berlin (2016)","DOI":"10.1007\/978-3-662-53426-7_12"},{"issue":"1","key":"496_CR77","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480100373121","volume":"15","author":"M Ha\u0144\u0107kowiak","year":"2001","unstructured":"Ha\u0144\u0107kowiak, M., Karo\u0144ski, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM J. Discret. Math. 15(1), 41\u201357 (2001)","journal-title":"SIAM J. Discret. Math."},{"key":"496_CR78","unstructured":"Haeupler, B., Li, J.: Faster Distributed Shortest Path Approximations via Shortcuts. In: Ulrich S., Josef W. (eds.) 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 33:1\u201333:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"496_CR79","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Li, J., Zuzic, G.: Minor excluded network families admit fast distributed algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC), pp. 465\u2013474 (2018)","DOI":"10.1145\/3212734.3212776"},{"key":"496_CR80","doi-asserted-by":"crossref","unstructured":"Huang, S.-E., Su, H.-H.: $$(1-\\epsilon )$$-approximate maximum weighted matching in poly($$1\/\\epsilon $$, $$\\log n$$) time in the distributed and parallel settings. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC), pp. 44\u201354 (2023)","DOI":"10.1145\/3583668.3594570"},{"issue":"2","key":"496_CR81","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A Israeli","year":"1986","unstructured":"Israeli, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. Info. Proc. Lett. 22(2), 77\u201380 (1986)","journal-title":"Info. Proc. Lett."},{"key":"496_CR82","unstructured":"Izumi, T., Fran\u00e7ois, L.G., Magniez, F.: Quantum distributed algorithm for triangle finding in the CONGEST model. In: Christophe P., Markus B. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), volume 154 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 23:1\u201323:13. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020)"},{"issue":"6","key":"496_CR83","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput. 18(6), 1149\u20131178 (1989)","journal-title":"SIAM J. Comput."},{"key":"496_CR84","first-page":"35","volume":"179","author":"Ken-ichi Kawarabayashi","year":"2020","unstructured":"Kawarabayashi, Ken-ichi, Khoury, Seri, Schild, Aaron, Schwartzman, Gregory: Improved distributed approximations for maximum independent set. In 34th International Symposium on Distributed Computing (DISC), 179, 35\u201335 (2020)","journal-title":"In 34th International Symposium on Distributed Computing (DISC),"},{"issue":"1","key":"496_CR85","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0684-x","volume":"23","author":"K Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K., Mohar, B.: Some recent progress and applications in graph minor theory. Graphs Combin. 23(1), 1\u201346 (2007)","journal-title":"Graphs Combin."},{"issue":"12","key":"496_CR86","doi-asserted-by":"publisher","first-page":"8996","DOI":"10.1093\/imrn\/rnz086","volume":"2021","author":"M Krivelevich","year":"2021","unstructured":"Krivelevich, M., Nenadov, R.: Complete minors in graphs without sparse cuts. Int. Math. Res. Not. 2021(12), 8996\u20139015 (2021)","journal-title":"Int. Math. Res. Not."},{"key":"496_CR87","doi-asserted-by":"crossref","unstructured":"Klein, P.: Serge A Plotkin, and Satish Rao. Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the 25th annual ACM symposium on Theory of computing (STOC), pp. 682\u2013690 (1993)","DOI":"10.1145\/167088.167261"},{"key":"496_CR88","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rubinfeld, R.: Short paths in expander graphs. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 86\u201395. IEEE (1996)","DOI":"10.1109\/SFCS.1996.548467"},{"key":"496_CR89","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: A separator theorem in minor-closed classes. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 153\u2013162. IEEE (2010)","DOI":"10.1109\/FOCS.2010.22"},{"key":"496_CR90","doi-asserted-by":"crossref","unstructured":"Kumar, A., Seshadhri, C., Stolman, A.: Finding forbidden minors in sublinear time: a $${O}(n^{1\/2 + o(1)})$$-query one-sided tester for minor closed properties on bounded degree graphs. In: Proceedings 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013520 (2018)","DOI":"10.1109\/FOCS.2018.00055"},{"issue":"1","key":"496_CR91","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274663","volume":"66","author":"Ken-Ichi Kawarabayashi","year":"2018","unstructured":"Kawarabayashi, Ken-Ichi., Thorup, Mikkel: Deterministic edge connectivity in near-linear time. J. ACM 66(1), 1\u20134 (2018)","journal-title":"J. ACM"},{"issue":"3","key":"496_CR92","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: good, bad and spectral. J. ACM 51(3), 497\u2013515 (2004)","journal-title":"J. ACM"},{"key":"496_CR93","unstructured":"Le\u00a0Gall, F., Miyamoto M.: Lower bounds for induced cycle detection in distributed computing. In: Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC) (2021)"},{"issue":"1","key":"496_CR94","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00446-020-00382-3","volume":"34","author":"R Levi","year":"2021","unstructured":"Levi, R., Medina, M., Ron, D.: Property testing of planarity in the congest model. Distrib. Comput. 34(1), 15\u201332 (2021)","journal-title":"Distrib. Comput."},{"key":"496_CR95","doi-asserted-by":"crossref","unstructured":"Li, J., Parter, M.: Planar diameter via metric compression. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 152\u2013163 (2019)","DOI":"10.1145\/3313276.3316358"},{"issue":"5","key":"496_CR96","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2786753","volume":"62","author":"Zvi Lotker","year":"2015","unstructured":"Lotker, Zvi, Patt-Shamir, Boaz, Pettie, Seth: Improved distributed approximate matching. J. ACM 62(5), 1\u201317 (2015)","journal-title":"J. ACM"},{"issue":"2","key":"496_CR97","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/080714403","volume":"39","author":"Z Lotker","year":"2009","unstructured":"Lotker, Z., Patt-Shamir, B., Ros\u00e9n, A.: Distributed approximate matching. SIAM J. Comput. 39(2), 445\u2013460 (2009)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"496_CR98","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-013-0186-z","volume":"26","author":"C Lenzen","year":"2013","unstructured":"Lenzen, C., Pignolet, Y.-A., Wattenhofer, R.: Distributed minimum dominating set approximations in restricted families of graphs. Distrib. Comput. 26(2), 119\u2013137 (2013)","journal-title":"Distrib. Comput."},{"issue":"4","key":"496_CR99","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01303516","volume":"13","author":"N Linial","year":"1993","unstructured":"Linial, N., Saks, M.: Low diameter graph decompositions. Combinatorica 13(4), 441\u2013454 (1993)","journal-title":"Combinatorica"},{"key":"496_CR100","doi-asserted-by":"crossref","unstructured":"Laso\u0144, M., Sulkowska, M.: Modularity of minor-free graphs (2021)","DOI":"10.1002\/jgt.22896"},{"issue":"2","key":"496_CR101","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"Richard J Lipton","year":"1979","unstructured":"Lipton, Richard J., Tarjan, Robert Endre: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"496_CR102","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"496_CR103","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A. J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"3","key":"496_CR104","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"496_CR105","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818185","volume":"48","author":"Robert Ryan McCune","year":"2015","unstructured":"McCune, Robert Ryan, Weninger, Tim, Madey, Greg: Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. 48(2), 1\u201339 (2015)","journal-title":"ACM Comput. Surv."},{"key":"496_CR106","doi-asserted-by":"crossref","unstructured":"Nieberg, T.: Local, distributed weighted matching on general and wireless topologies. In: Proc.\u00a05th Int\u2019l Workshop on Foundations of Mobile Computing (DIALM-POMC), DIALM-POMC \u201908, pp. 87\u201392 (2008)","DOI":"10.1145\/1400863.1400880"},{"key":"496_CR107","doi-asserted-by":"crossref","unstructured":"Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1096\u20131115 (2020)","DOI":"10.1137\/1.9781611975994.67"},{"key":"496_CR108","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Saranurak, T., Wulff-Nilsen, C.: Dynamic minimum spanning forest with subpolynomial worst-case update time. In: Proceedings of IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 950\u2013961. IEEE (2017)","DOI":"10.1109\/FOCS.2017.92"},{"key":"496_CR109","unstructured":"Parter, M.: Distributed planar reachability in nearly optimal time. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"496_CR110","unstructured":"Pan, X., Papailiopoulos, D., Oymak, S., Recht, B., Ramchandran, K., Jordan, M.I.: Parallel correlation clustering on big graphs. In: Proc.\u00a028th International Conference on Neural Information Processing Systems (NIPS), pp. 82\u201390 (2015)"},{"key":"496_CR111","doi-asserted-by":"crossref","unstructured":"Rozho\u0148, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC) (2020)","DOI":"10.1145\/3357713.3384298"},{"issue":"3","key":"496_CR112","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"Neil Robertson","year":"1986","unstructured":"Robertson, Neil, Seymour, P.D.: Graph minors II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"1","key":"496_CR113","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"Neil Robertson","year":"2003","unstructured":"Robertson, Neil, Seymour, P.D.: Graph minors . XVI. excluding a non-planar graph. J. Comb. Theory Ser. B 89(1), 43\u201376 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"496_CR114","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"Neil Robertson","year":"2004","unstructured":"Robertson, Neil, Seymour, P.D.: Graph minors . XX. Wagner\u2019s conjecture. J. Combin. Theory Ser. B 92(2), 325\u2013357 (2004). (Special Issue Dedicated to Professor W.T. Tutte)","journal-title":"J. Combin. Theory Ser. B"},{"key":"496_CR115","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Proceedings 42nd ACM Symposium on Theory of Computing (STOC), pp. 755\u2013764 (2010)","DOI":"10.1145\/1806689.1806792"},{"key":"496_CR116","doi-asserted-by":"crossref","unstructured":"Daniel, A.: Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 81\u201390 (2004)","DOI":"10.1145\/1007352.1007372"},{"issue":"2","key":"496_CR117","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0304-3975(93)90031-N","volume":"112","author":"O S\u00fdkora","year":"1993","unstructured":"S\u00fdkora, O., Vr\u0165o, I.: Edge separators for graphs of bounded genus with applications. Theoret. Comput. Sci. 112(2), 419\u2013429 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"496_CR118","unstructured":"Swamy, C.: Correlation clustering: Maximizing agreements via semidefinite programming. In: Proc.\u00a015th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 526\u2013527 (2004)"},{"issue":"2","key":"496_CR119","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A Thomason","year":"2001","unstructured":"Thomason, A.: The extremal function for complete minors. J. Combin. Theory, Ser. B 81(2), 318\u2013338 (2001)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"3","key":"496_CR120","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ipl.2013.11.008","volume":"114","author":"W Wawrzyniak","year":"2014","unstructured":"Wawrzyniak, W.: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Inf. Process. Lett. 114(3), 94\u201398 (2014)","journal-title":"Inf. Process. Lett."},{"key":"496_CR121","doi-asserted-by":"crossref","unstructured":"Wattenhofer, M., Wattenhofer, R.: Distributed weighted matching. In: Proc.\u00a018th International Symposium on Distributed Computing (DISC), pp. 335\u2013348 (2004)","DOI":"10.1007\/978-3-540-30186-8_24"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00496-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-025-00496-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00496-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:05:11Z","timestamp":1773659111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-025-00496-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":121,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["496"],"URL":"https:\/\/doi.org\/10.1007\/s00446-025-00496-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]},"assertion":[{"value":"2 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}