{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:18:07Z","timestamp":1774271887962,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science and Technology Council","award":["NSTC 113\u20132222\u2013E\u2013194\u2013006\u2013MY3"],"award-info":[{"award-number":["NSTC 113\u20132222\u2013E\u2013194\u2013006\u2013MY3"]}]},{"name":"National Science and Technology Council, Taiwan","award":["NSTC 114\u20132221\u2013E\u2013006\u2013122\u2013MY2"],"award-info":[{"award-number":["NSTC 114\u20132221\u2013E\u2013006\u2013122\u2013MY2"]}]},{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-025-00518-7","type":"journal-article","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:31:16Z","timestamp":1769841076000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs"],"prefix":"10.1007","volume":"63","author":[{"given":"Shih-Chia","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Hsuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling-Ju","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Shun","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"518_CR1","unstructured":"Abboud, A., Cohen-Addad, V., Lee, E., Manurangsi, P.: Improved approximation algorithms and lower bounds for search-diversification problem. Preliminary version. In: Proceesings of the 49th International Colloquiumon Automata, Languages, and Programming (ICALP), Article No. 7, pp. 7:1\u20137:18 (2022). arXiv:2203.01857 [cs.DS]"},{"key":"518_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R., Xie, N.: Testing $$k$$-wise and almost $$k$$-wise independence. In: STOC, pp. 496\u2013505. ACM (2007)","DOI":"10.1145\/1250790.1250863"},{"key":"518_CR3","first-page":"6","volume":"1","author":"N Alon","year":"2011","unstructured":"Alon, N., Arora, S., Manokaran, R., Moshkovitz, D., Weinstein, O.: Inapproximability of densest $$k$$-subgraph from average case hardness. Manuscript 1, 6 (2011)","journal-title":"Manuscript"},{"key":"518_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.1024","volume":"38","author":"T Andreae","year":"2001","unstructured":"Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Netw. 38, 59\u201367 (2001)","journal-title":"Netw."},{"key":"518_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480192240226","volume":"8","author":"T Andreae","year":"1995","unstructured":"Andreae, T., Bandelt, H.-J.: Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM J. Discret. Math. 8, 1\u201316 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"518_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58, 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"518_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34, 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"518_CR8","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ipl.2010.05.011","volume":"110","author":"J Backer","year":"2010","unstructured":"Backer, J., Keil, J.M.: Constant factor approximation algorithms for the densest $$k$$-subgraph problem on proper interval graphs and bipartite permutation graphs. Inf. Process. Lett. 110, 635\u2013638 (2010)","journal-title":"Inf. Process. Lett."},{"key":"518_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(99)00160-X","volume":"73","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Chekuri, C.: Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73, 17\u201321 (2000)","journal-title":"Inf. Process. Lett."},{"key":"518_CR10","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charika, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high $$\\log$$-densities: an $$O(n^{1\/4})$$-approximation algorithms for the densest $$k$$-subgraph. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC\u201910), pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"issue":"1","key":"518_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00453-007-9142-2","volume":"55","author":"BE Birnbaum","year":"2009","unstructured":"Birnbaum, B.E., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 55(1), 42\u201359 (2009)","journal-title":"Algorithmica"},{"key":"518_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"518_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovic\u0306, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75, 133\u2013138 (2000)","journal-title":"Inf. Process. Lett."},{"key":"518_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1051\/ita:2000115","volume":"34","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Seibert, S.: Improved lower bounds on the approximability of the traveling salesman problem. RAIRO - Theoretical Inf. Appl. 34, 213\u2013255 (2000)","journal-title":"RAIRO - Theoretical Inf. Appl."},{"key":"518_CR15","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem (Extended Abstract). In: Proc. CIAC 2000, LNCS 1767, pp.\u00a072\u201386. Springer (2000). Full version in Theoretical Computer Science, vol.\u00a0285, pp.\u00a03\u201324 (2002)","DOI":"10.1016\/S0304-3975(01)00287-0"},{"key":"518_CR16","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (Extended Abstract). In: Proc. STACS 2000, LNCS 1770, pp.\u00a0382\u2013394. Springer (2000)","DOI":"10.1007\/3-540-46541-3_32"},{"key":"518_CR17","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. In: Proc. FSTTCS 2002, LNCS 2556, pp.\u00a059\u201370. Springer (2002). Full version in Theoretical Computer Science, vol. 326, pp.\u00a0137\u2013153 (2004)","DOI":"10.1016\/j.tcs.2004.06.019"},{"key":"518_CR18","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On $$k$$-Edge-Connectivity Problems with Sharpened Triangle Inequality. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) Algorithms and Complexity, Proc. 5th Italian Conference, CIAC 2003, LNCS 2653, pp.\u00a0189\u2013200. Springer (2003)","DOI":"10.1007\/3-540-44849-7_24"},{"key":"518_CR19","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"H-J B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Seibert, S.: Stability of approximation. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall\/CRC (2007) . (Chapter 31)"},{"key":"518_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.jda.2008.03.003","volume":"6","author":"H-J B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On $$k$$-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6, 605\u2013617 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"518_CR21","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.ejor.2017.04.034","volume":"262","author":"N Bourgeois","year":"2017","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T.: Exact and superpolynomial approximation algorithms for the densest $$k$$-subgraph problem. Eur. J. Oper. Res. 262, 894\u2013903 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"518_CR22","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ipl.2014.04.009","volume":"114","author":"M-S Chang","year":"2014","unstructured":"Chang, M.-S., Chen, L.-H., Hung, L.-J., Rossmanith, P., Wu, G.-H.: Exact algorithms for problems related to the densest $$k$$-set problem. Inf. Process. Lett. 114, 510\u2013513 (2014)","journal-title":"Inf. Process. Lett."},{"key":"518_CR23","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Fleischer, R., Li, J.: Densest $$k$$-subgraph approximation on intersection graphs. In: Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA\u201910), pp.\u00a083\u201393 (2010)","DOI":"10.1007\/978-3-642-18318-8_8"},{"key":"518_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jcss.2017.09.012","volume":"92","author":"L-H Chen","year":"2018","unstructured":"Chen, L.-H., Cheng, D.-W., Hsieh, S.-Y., Hung, L.-J., Klasing, R., Lee, C.-W., Wu, B.Y.: Approximability and inapproximability of the star $$p$$-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92, 92\u2013112 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"518_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2019.05.008","volume":"806","author":"L-H Chen","year":"2020","unstructured":"Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: Approximation algorithms for the $$p$$-hub center routing problem in parameterized metric graphs. Theoret. Comput. Sci. 806, 271\u2013280 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"518_CR26","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1007\/s00453-022-00941-z","volume":"84","author":"L-H Chen","year":"2022","unstructured":"Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: On the approximability of the single allocation $$p$$-hub center problem with parameterized triangle inequality. Algorithmica 84, 1993\u20132027 (2022)","journal-title":"Algorithmica"},{"key":"518_CR27","unstructured":"Chuzhoy, J., Dalirrooyfard, M., Grinberg, V., Tan, Z.: A new conjecture on hardness of 2-CSP\u2019s with implications to hardness of densest $$k$$-subgraph and other problems. In: Proceeding of the 14th Innovations in Theoretical Computer Science Conference (ITCS), Article No.\u00a038, pp.\u00a038:1\u201338:23 (2023)"},{"key":"518_CR28","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press (2009)"},{"key":"518_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9, 27\u201340 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"157","key":"518_CR30","first-page":"1","volume":"12","author":"A Farag\u00f3","year":"2019","unstructured":"Farag\u00f3, A., Mojaveri, Z.R.: In search of the densest subgraph. Algorithms 12(157), 1\u201318 (2019)","journal-title":"Algorithms"},{"key":"518_CR31","unstructured":"Feige, U., Seltser, M.: On the Dense $$k$$-Subgraph Problem. Technical Report, The Weizmann Institute (1997)"},{"key":"518_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense $$k$$-subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"518_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21, 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"key":"518_CR34","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-60207-8_21","volume-title":"Jewels are Forever","author":"J Hromkovi\u010d","year":"1999","unstructured":"Hromkovi\u010d, J.: Stability of approximation algorithms and the knapsack problem. In: Karhum\u00e4ki, J., Maurer, H., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 238\u2013249. Springer (1999)"},{"key":"518_CR35","volume-title":"Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics","author":"J Hromkovi\u010d","year":"2003","unstructured":"Hromkovi\u010d, J.: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd edn. Springer (2003)","edition":"2"},{"key":"518_CR36","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/rsa.3240030402","volume":"3","author":"M Jerrum","year":"1992","unstructured":"Jerrum, M.: Large cliques elude the metropolis process. Random Struct. Algorithms 3, 347\u2013360 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"518_CR37","first-page":"155","volume":"9","author":"JM Keil","year":"1991","unstructured":"Keil, J.M., Brecht, T.: The complexity of clustering in planar graphs. J. Comb. Math. Comb. Comput. 9, 155\u2013159 (1991)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"518_CR38","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S Khot","year":"2006","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, dense $$k$$-subgraph, and bipartite clique. SIAM J. Comput. 36, 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"key":"518_CR39","doi-asserted-by":"crossref","unstructured":"Klasing, R., M\u00f6mke, T.: A modern view on stability of approximation. In: Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovi\u010d on the Occasion of His 60th Birthday, LNCS 11011, pp. 393\u2013408 (2018)","DOI":"10.1007\/978-3-319-98355-4_22"},{"key":"518_CR40","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10878-007-9069-1","volume":"14","author":"M Liazi","year":"2007","unstructured":"Liazi, M., Milis, I., Zissimopoulos, V.: The densest $$k$$-subgraph problem on clique graphs. J. Comb. Optim. 14, 465\u2013474 (2007)","journal-title":"J. Comb. Optim."},{"key":"518_CR41","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ipl.2008.03.016","volume":"108","author":"M Liazi","year":"2008","unstructured":"Liazi, M., Milis, I., Zissimopoulos, V.: A constant approximation algorithm for the densest $$k$$-subgraph problem on chordal graphs. Inf. Process. Lett. 108, 29\u201332 (2008)","journal-title":"Inf. Process. Lett."},{"key":"518_CR42","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.: A method of matrix analysis of group structure. Psychometrika 14, 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"518_CR43","unstructured":"Manurangsi, P., Rubinstein, A., Schramm, T.: The Strongish Planted Clique Hypothesis and its consequences. In: Proceedings of 12th Innovations in Theoretical Computer Science Conference (ITCS), Article No.\u00a010, pp.\u00a010:1\u201310:21 (2021)"},{"key":"518_CR44","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ipl.2015.06.003","volume":"115","author":"T M\u00f6mke","year":"2015","unstructured":"M\u00f6mke, T.: An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality. Inf. Process. Lett. 115, 866\u2013871 (2015)","journal-title":"Inf. Process. Lett."},{"key":"518_CR45","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s00453-014-9956-7","volume":"74","author":"T Nonner","year":"2016","unstructured":"Nonner, T.: PTAS for densest $$k$$-subgraph in interval graphs. Algorithmica 74, 528\u2013539 (2016)","journal-title":"Algorithmica"},{"key":"518_CR46","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42, 299\u2013310 (1994)","journal-title":"Oper. Res."},{"key":"518_CR47","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-981-13-1217-5_58","volume-title":"Proceedings of 2nd International Conference on Communication, Computing and Networking, Lecture Notes in Networks and Systems","author":"H Singh","year":"2019","unstructured":"Singh, H., Kumar, M., Aggarwal, P.: Approximation of heaviest $$k$$-subgraph problem by size reduction of input graph. In: Krishna, C., Dutta, M., Kumar, R. (eds.) Proceedings of 2nd International Conference on Communication, Computing and Networking, Lecture Notes in Networks and Systems, vol. 46, pp. 599\u2013606. Springer, Singapore (2019)"},{"key":"518_CR48","first-page":"241","volume":"42","author":"M Sydow","year":"2014","unstructured":"Sydow, M.: Approximation guarantees for max sum and max min facility dispersion with parameterised triangle inequality and applications in result diversification. Math. Applicanda 42, 241\u2013257 (2014)","journal-title":"Math. Applicanda"},{"key":"518_CR49","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2022.04.007","volume":"922","author":"H-P Yeh","year":"2022","unstructured":"Yeh, H.-P., Lu, W., Chen, L.-H., Hung, L.-J., Klasing, R., Hsieh, S.-Y.: Hardness and approximation for the star $$p$$-hub routing cost problem in metric graphs. Theoret. Comput. Sci. 922, 13\u201324 (2022)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00518-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00518-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00518-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:47Z","timestamp":1774268747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00518-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,31]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00518-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,31]]},"assertion":[{"value":"4 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}