{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:04:52Z","timestamp":1691640292214},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we study the <jats:italic>k<\/jats:italic>-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) polynomial kernel for this problem parameterized by the cost of clustering. We complement this result by establishing lower bounds for the problem that eliminate the existence of an (exact) kernel of polynomial size and a PTAS.<\/jats:p>","DOI":"10.1007\/s00224-023-10129-9","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T09:02:22Z","timestamp":1688979742000},"page":"785-824","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lossy Kernelization of Same-Size Clustering"],"prefix":"10.1007","volume":"67","author":[{"given":"Sayan","family":"Bandyapadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Simonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"10129_CR1","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"10129_CR2","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 224\u2013237. ACM (2017)","DOI":"10.1145\/3055399.3055456"},{"issue":"3","key":"10129_CR3","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1137\/18M1172508","volume":"33","author":"E Eiben","year":"2019","unstructured":"Eiben, E., Kumar, M., Mouawad, A.E., Panolan, F., Siebertz, S.: Lossy kernels for connected dominating set on sparse graphs. SIAM J. Discret. Math. 33(3), 1743\u20131771 (2019)","journal-title":"SIAM J. Discret. Math."},{"key":"10129_CR4","unstructured":"Siebertz, S.: Lossy kernels for connected distance-$$r$$ domination on nowhere dense graph classes. CoRR abs\/1707.09819 (2017)"},{"key":"10129_CR5","unstructured":"Krithika, R., Misra, P., Rai, A., Tale, P.: Lossy kernels for graph contraction problems. In: Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a065, pp. 23:1\u201323:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"10129_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00224-018-9892-z","volume":"63","author":"A Agrawal","year":"2019","unstructured":"Agrawal, A., Saurabh, S., Tale, P.: On the parameterized complexity of contraction to generalization of trees. Theory Comput. Syst. 63(3), 587\u2013614 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10129_CR7","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/18M1209489","volume":"35","author":"P Dvor\u00e1k","year":"2021","unstructured":"Dvor\u00e1k, P., Feldmann, A.E., Knop, D., Masar\u00edk, T., Toufar, T., Vesel\u00fd, P.: Parameterized approximation schemes for steiner trees with small number of steiner vertices. SIAM J. Discret. Math. 35(1), 546\u2013574 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"10129_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization. Cambridge University Press, Cambridge (2019). Theory of parameterized preprocessing","DOI":"10.1017\/9781107415157"},{"issue":"6","key":"10129_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.3390\/a13060146","volume":"13","author":"AE Feldmann","year":"2020","unstructured":"Feldmann, A.E., Karthik, C.S., Lee, E., Manurangsi, P.: A survey on approximation in parameterized complexity: Hardness and algorithms. Algorithms 13(6), 146 (2020)","journal-title":"Algorithms"},{"key":"10129_CR10","unstructured":"Cohen-Addad, V., Gupta, A., Kumar, A., Lee, E., Li, J.: Tight FPT approximations for k-median and k-means. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, vol. 132, pp. 42:1\u201342:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10129_CR11","unstructured":"Cohen-Addad, V., Li, J.: On the fixed-parameter tractability of capacitated clustering. In: 46th International Colloquium on Automata, Languages, and Programming, (ICALP), LIPIcs, vol. 132, pp. 41:1\u201341:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10129_CR12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for $$k$$-means and $$k$$-median clustering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 291\u2013300. ACM (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"10129_CR13","unstructured":"H\u00f6ppner, F., Klawonn, F.: Clustering with size constraints. In: L.C. Jain, M.\u00a0Sato-Ilic, M.\u00a0Virvou, G.A. Tsihrintzis, V.E. Balas, C.\u00a0Abeynayake (eds.) Computational Intelligence Paradigms, Innovative Applications, vol. 137, pp. 167\u2013180. Springer (2008)"},{"key":"10129_CR14","doi-asserted-by":"crossref","unstructured":"Vallejo-Huanga, D., Morillo, P., Ferri, C.: Semi-supervised clustering algorithms for grouping scientific articles. In: International Conference on Computational Science (ICCS), Procedia Computer Science, vol. 108, pp. 325\u2013334. Elsevier (2017)","DOI":"10.1016\/j.procs.2017.05.206"},{"key":"10129_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Li, T., Ding, C., Zhang, X.: Binary matrix factorization with applications. In: ICDM\u201907, pp. 391\u2013400. IEEE (2007)","DOI":"10.1109\/ICDM.2007.99"},{"key":"10129_CR16","doi-asserted-by":"crossref","unstructured":"Li, T.: A general model for clustering binary data. In: KDD\u201905, pp. 188\u2013197 (2005)","DOI":"10.1145\/1081870.1081894"},{"issue":"05","key":"10129_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(05), 557\u2013570 (2002)","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"4","key":"10129_CR18","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s00453-019-00616-2","volume":"82","author":"H Ding","year":"2020","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. Algorithmica 82(4), 808\u2013852 (2020)","journal-title":"Algorithmica"},{"issue":"1","key":"10129_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-017-9820-7","volume":"62","author":"A Bhattacharya","year":"2018","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster Algorithms for the Constrained k-means Problem. Theory of Computing Systems 62(1), 93\u2013115 (2018)","journal-title":"Theory of Computing Systems"},{"key":"10129_CR20","unstructured":"Bandyapadhyay, S., Fomin, F.V., Simonov, K.: On coresets for fair clustering in metric and euclidean spaces and their applications. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, vol. 198, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"10129_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5:1\u20135:32 (2010)","DOI":"10.1145\/1667053.1667054"},{"issue":"1","key":"10129_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jagm.1999.1024","volume":"33","author":"N Alon","year":"1999","unstructured":"Alon, N., Sudakov, B.: On two segmentation problems. Journal of Algorithms 33(1), 173\u2013184 (1999)","journal-title":"Journal of Algorithms"},{"key":"10129_CR23","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp. 569\u2013578. ACM (2011)","DOI":"10.1145\/1993636.1993712"},{"key":"10129_CR24","unstructured":"Baker, D., Braverman, V., Huang, L., Jiang, S.H.C., Krauthgamer, R., Wu, X.: Coresets for clustering in graphs of bounded treewidth. In: International Conference on Machine Learning, pp. 569\u2013579. PMLR (2020)"},{"issue":"3","key":"10129_CR25","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/18M1209854","volume":"49","author":"D Feldman","year":"2020","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering. SIAM Journal on Computing 49(3), 601\u2013657 (2020)","journal-title":"SIAM Journal on Computing"},{"key":"10129_CR26","doi-asserted-by":"crossref","unstructured":"Sohler, C., Woodruff, D.P.: Strong coresets for $$k$$-median and subspace approximation: Goodbye dimension. In: Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 802\u2013813. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00081"},{"key":"10129_CR27","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Reddy, C.K. (eds.): Data Clustering: Algorithms and Applications. CRC Press (2013)","DOI":"10.1201\/b15410"},{"issue":"1","key":"10129_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10129_CR29","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"10129_CR30","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating k-median via pseudo-approximation. SIAM J. Comput. 45(2), 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"key":"10129_CR31","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T.W., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for k-median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13(2), 23:1\u201323:31 (2017)","DOI":"10.1145\/2981561"},{"key":"10129_CR32","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM J. Comput. 49(4) (2020)","DOI":"10.1137\/18M1171321"},{"key":"10129_CR33","unstructured":"Manurangsi, P., Raghavendra, P.: A birthday repetition theorem and complexity of approximating dense csps. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"10129_CR34","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for euclidean k-medians and related problems. In: J.S. Vitter (ed.) Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 106\u2013113. ACM (1998)","DOI":"10.1145\/276698.276718"},{"key":"10129_CR35","unstructured":"Cohen-Addad, V., Mathieu, C.: Effectiveness of local search for geometric optimization. In: L.\u00a0Arge, J.\u00a0Pach (eds.) 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, LIPIcs, vol.\u00a034, pp. 329\u2013343. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"10129_CR36","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Varadarajan, K.R.: On variants of k-means clustering. In: S.P. Fekete, A.\u00a0Lubiw (eds.) 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, LIPIcs, vol.\u00a051, pp. 14:1\u201314:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","DOI":"10.1016\/j.comgeo.2015.10.003"},{"issue":"2","key":"10129_CR37","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for k-means and k-median in euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10129_CR38","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/17M1127181","volume":"48","author":"Z Friggstad","year":"2019","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for k-means in doubling metrics. SIAM J. Comput. 48(2), 452\u2013480 (2019)","journal-title":"SIAM J. Comput."},{"key":"10129_CR39","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., de\u00a0Mesmay, A., Rotenberg, E., Roytman, A.: The bane of low-dimensionality clustering. In: A.\u00a0Czumaj (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 441\u2013456. SIAM (2018)","DOI":"10.1137\/1.9781611975031.30"},{"key":"10129_CR40","unstructured":"Feng, Q., Zhang, Z., Huang, Z., Xu, J., Wang, J.: A unified framework of FPT approximation algorithms for clustering problems. In: Y.\u00a0Cao, S.\u00a0Cheng, M.\u00a0Li (eds.) 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference), LIPIcs, vol. 181, pp. 5:1\u20135:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"10129_CR41","doi-asserted-by":"crossref","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrained clustering: Advances in algorithms, theory, and applications. CRC Press (2008)","DOI":"10.1201\/9781584889977"},{"key":"10129_CR42","doi-asserted-by":"crossref","unstructured":"Byrka, J., Rybicki, B., Uniyal, S.: An approximation algorithm for uniform capacitated k-median problem with $$1+\\varepsilon $$ capacity violation. In: Q.\u00a0Louveaux, M.\u00a0Skutella (eds.) Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Li\u00e8ge, Belgium, June 1-3, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9682, pp. 262\u2013274. Springer (2016)","DOI":"10.1007\/978-3-319-33461-5_22"},{"key":"10129_CR43","doi-asserted-by":"crossref","unstructured":"Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated k-median problems. In: P.\u00a0Indyk (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 722\u2013736. SIAM (2015)","DOI":"10.1137\/1.9781611973730.49"},{"key":"10129_CR44","unstructured":"Chuzhoy, J., Rabani, Y.: Approximating k-median with non-uniform capacities. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 952\u2013958. SIAM (2005)"},{"key":"10129_CR45","unstructured":"Demirci, H.G., Li, S.: Constant approximation for capacitated k-median with $$(1+\\varepsilon )$$-capacity violation. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 73:1\u201373:14 (2016)"},{"key":"10129_CR46","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated k-median beyond the natural LP relaxation. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 696\u2013707 (2015)","DOI":"10.1137\/1.9781611973730.47"},{"key":"10129_CR47","doi-asserted-by":"crossref","unstructured":"Li, S.: On uniform capacitated k-median beyond the natural LP relaxation. ACM Trans. Algorithms 13(2), 22:1\u201322:18 (2017)","DOI":"10.1145\/2983633"},{"key":"10129_CR48","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: S.\u00a0Chawla (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pp. 2241\u20132259. SIAM (2020)","DOI":"10.1137\/1.9781611975994.138"},{"key":"10129_CR49","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10129_CR50","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Purohit, N.: Parameterized complexity of categorical clustering with size constraints. CoRR abs\/2104.07974 (2021)","DOI":"10.1007\/978-3-030-83508-8_28"},{"key":"10129_CR51","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"10129_CR52","volume-title":"Matching theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. AMS Chelsea Publishing, Providence, RI (2009)"},{"issue":"2","key":"10129_CR53","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10618-019-00669-5","volume":"34","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Panolan, F.: Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2), 478\u2013532 (2020)","journal-title":"Data Min. Knowl. Discov."},{"key":"10129_CR54","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Algorithm design. Addison-Wesley (2006)"},{"key":"10129_CR55","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. CoRR abs\/1812.03155 (2018)"},{"key":"10129_CR56","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: Gap location. Comput. Complex. 4, 133\u2013157 (1994)","journal-title":"Comput. Complex."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10129-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10129-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10129-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T10:08:40Z","timestamp":1691575720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10129-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10129"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10129-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"23 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}