{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:44:14Z","timestamp":1782953054790,"version":"3.54.5"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227294","type":"print"},{"value":"9783032227300","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22730-0_30","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:24:31Z","timestamp":1776270271000},"page":"636-657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9796-9675","authenticated-orcid":false,"given":"Paul","family":"Wild","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-5906","authenticated-orcid":false,"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1019-6449","authenticated-orcid":false,"given":"Karla","family":"Messing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5050-2565","authenticated-orcid":false,"given":"Jonas","family":"Forster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"30_CR1","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and concrete categories: The joy of cats. John Wiley & Sons Inc. (1990), http:\/\/tac.mta.ca\/tac\/reprints\/articles\/17\/tr17abs.html, republished in: Reprints in Theory and Applications of Categories, No. 17 (2006) pp.\u00a01\u2013507"},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"de\u00a0Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Software Eng. 35(2), 258\u2013273 (2009). https:\/\/doi.org\/10.1109\/TSE.2008.106","DOI":"10.1109\/TSE.2008.106"},{"key":"30_CR3","unstructured":"Aolaritei, L., Wang, O., Zhu, J., Jordan, M., Marzouk, Y.: Conformal prediction under L\u00e9vy-Prokhorov distribution shifts: Robustness to local and global perturbations. In: Neural Information Processing Systems, NeurIPS 2025 (2025), to appear. Preprint available at https:\/\/arxiv.org\/abs\/2502.14105"},{"key":"30_CR4","doi-asserted-by":"publisher","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Coalgebraic behavioral metrics. Log. Methods Comput. Sci. 14(3) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(3:20)2018","DOI":"10.23638\/LMCS-14(3:20)2018"},{"key":"30_CR5","unstructured":"Bennouna, M.A., Lucas, R., Parys, B.P.G.V.: Certified robust neural networks: Generalization and corruption resistance. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) International Conference on Machine Learning, ICML 2023. Proc. Machine Learning Res., vol.\u00a0202, pp. 2092\u20132112. PMLR (2023), https:\/\/proceedings.mlr.press\/v202\/bennouna23a.html"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Bonchi, F., K\u00f6nig, B., Petri\u015fan, D.: Up-to techniques for behavioural metrics via fibrations. Mathematical Structures in Computer Science 33(4\u20135), 182\u2013221 (2023). https:\/\/doi.org\/10.1017\/S0960129523000166","DOI":"10.1017\/S0960129523000166"},{"key":"30_CR7","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Silva, A., Sokolova, A.: The Power of Convex Algebras. In: Meyer, R., Nestmann, U. (eds.) Concurrency Theory, CONCUR 2017. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a085, pp. 23:1\u201323:18. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.23","DOI":"10.4230\/LIPIcs.CONCUR.2017.23"},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"\u00c7elik, T.\u00d6., Jamneshan, A., Mont\u00fafar, G., Sturmfels, B., Venturello, L.: Optimal transport to a variety. In: Slamanig, D., Tsigaridas, E.P., Zafeirakopoulos, Z. (eds.) Mathematical Aspects of Computer and Information Sciences, MACIS 2019. LNCS, vol. 11989, pp. 364\u2013381. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_29","DOI":"10.1007\/978-3-030-43120-4_29"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"D\u2019Angelo, K., Gurke, S., Kirss, J.M., K\u00f6nig, B., Najafi, M., R\u00f3\u017cowski, W., Wild, P.: Behavioural metrics: Compositionality of the Kantorovich lifting and an application to up-to techniques. In: Concurrency Theory, CONCUR 2024. LIPIcs, vol.\u00a0311, pp. 20:1\u201320:19. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2024), https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2024.20","DOI":"10.4230\/LIPIcs.CONCUR.2024.20"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: Logic, simulation and games. In: Quantitative Evaluation of Systems, QEST 2008. pp. 264\u2013273. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/QEST.2008.42","DOI":"10.1109\/QEST.2008.42"},{"key":"30_CR11","unstructured":"Desharnais, J., Sokolova, A.: $$\\varepsilon $$-distance via L\u00e9vy-Prokhorov lifting. In: Computer Science Logic, CSL 2026 (2026), to appear. Preprint available at https:\/\/arxiv.org\/abs\/2507.10732"},{"key":"30_CR12","unstructured":"Dudley, R.M.: Real Analysis and Probability. Cambridge Studies in Advanced Mathematics, Cambridge University Press, 2 edn. (2002)"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Forster, J., Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Quantitative Hennessy-Milner theorems via notions of density. In: Klin, B., Pimentel, E. (eds.) Computer Science Logic, CSL 2023. LIPIcs, vol.\u00a0252, pp. 22:1\u201322:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2023.22","DOI":"10.4230\/LIPIcs.CSL.2023.22"},{"key":"30_CR14","doi-asserted-by":"publisher","unstructured":"Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Kantorovich functors and characteristic logics for behavioural distances. In: Kupferman, O., Sobocinski, P. (eds.) Foundations of Software Science and Computation Structures, FoSSaCS 2023. LNCS, vol. 13992, pp. 46\u201367. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_3","DOI":"10.1007\/978-3-031-30829-1_3"},{"key":"30_CR15","doi-asserted-by":"publisher","unstructured":"Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Relators and notions of simulation revisited. In: Logic in Computer Science, LICS 2025. pp. 776\u2013789. IEEE (2025). https:\/\/doi.org\/10.1109\/LICS65433.2025.00064","DOI":"10.1109\/LICS65433.2025.00064"},{"key":"30_CR16","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Continuous previsions. In: Duparc, J., Henzinger, T.A. (eds.) Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04646, pp. 542\u2013557. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74915-8_40","DOI":"10.1007\/978-3-540-74915-8_40"},{"key":"30_CR17","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Simulation hemi-metrics between infinite-state stochastic games. In: Amadio, R.M. (ed.) Foundations of Software Science and Computational Structures, 11th International Conference, FoSSaCS 2008. Lecture Notes in Computer Science, vol.\u00a04962, pp. 50\u201365. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_5","DOI":"10.1007\/978-3-540-78499-9_5"},{"key":"30_CR18","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Isomorphism theorems between models of mixed choice. Math. Struct. Comput. Sci. 27(6), 1032\u20131067 (2017). https:\/\/doi.org\/10.1017\/S0960129515000547","DOI":"10.1017\/S0960129515000547"},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Kantorovich-Rubinstein quasi-metrics i: Spaces of measures and of continuous valuations. Topology and its Applications 295, 107673 (2021). https:\/\/doi.org\/10.1016\/j.topol.2021.107673","DOI":"10.1016\/j.topol.2021.107673"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Hofmann, D.: Topological theories and closed objects. Adv. Math. 215(2), 789 \u2013 824 (2007). https:\/\/doi.org\/10.1016\/j.aim.2007.04.013","DOI":"10.1016\/j.aim.2007.04.013"},{"key":"30_CR21","doi-asserted-by":"publisher","unstructured":"Hofmann, D., Seal, G., Tholen, W.: Monoidal Topology: A Categorical Approach to Order, Metric, and Topology, vol.\u00a0153. Cambridge University Press (2014). https:\/\/doi.org\/10.1017\/CBO9781107517288, http:\/\/dx.doi.org\/10.1017\/CBO9781107517288","DOI":"10.1017\/CBO9781107517288"},{"key":"30_CR22","doi-asserted-by":"publisher","unstructured":"Humeau, S., Petrisan, D., Rot, J.: Correspondences between codensity and coupling-based liftings, a practical approach. In: Endrullis, J., Schmitz, S. (eds.) Computer Science Logic, CSL 2025. LIPIcs, vol.\u00a0326, pp. 29:1\u201329:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.CSL.2025.29","DOI":"10.4230\/LIPICS.CSL.2025.29"},{"key":"30_CR23","unstructured":"Kantorovich, L.V.: The mathematical method of production planning and organization. Management Science 6(4), 363\u2013422 (1939)"},{"key":"30_CR24","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Hasuo, I.: Codensity games for bisimilarity. In: Logic in Computer Science, LICS 2019. pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785691","DOI":"10.1109\/LICS.2019.8785691"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Kupke, C., Rot, J., Hasuo, I.: Expressivity of quantitative modal logics: Categorical foundations via codensity and approximation. In: Logic in Computer Science, LICS 2021. pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470656","DOI":"10.1109\/LICS52264.2021.9470656"},{"key":"30_CR26","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) bisimulation games and real-valued modal logics for coalgebras. In: Concurrency Theory, CONCUR 2018. LIPIcs, vol.\u00a0118, pp. 37:1\u201337:17. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2018). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2018.37","DOI":"10.4230\/LIPICS.CONCUR.2018.37"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Mio, M., Vignudelli, V.: Monads and quantitative equational theories for nondeterminism and probability. In: Konnov, I., Kov\u00e1cs, L. (eds.) Concurrency Theory, CONCUR 2020. LIPIcs, vol.\u00a0171, pp. 28:1\u201328:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2020.28","DOI":"10.4230\/LIPICS.CONCUR.2020.28"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Log. 45(1), 19\u201333 (2004). https:\/\/doi.org\/10.1305\/NDJFL\/1094155277","DOI":"10.1305\/NDJFL\/1094155277"},{"key":"30_CR29","doi-asserted-by":"publisher","unstructured":"Prokhorov, Y.V.: Convergence of random processes and limit theorems in probability theory. Theory of Probability & Its Applications 1(2), 157\u2013214 (1956). https:\/\/doi.org\/10.1137\/1101016","DOI":"10.1137\/1101016"},{"key":"30_CR30","doi-asserted-by":"publisher","unstructured":"Rady, A., van Breugel, F.: Explainability of probabilistic bisimilarity distances for labelled Markov chains. In: Kupferman, O., Sobocinski, P. (eds.) Foundations of Software Science and Computation Structures, FoSSaCS 2023. LNCS, vol. 13992, pp. 285\u2013307. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_14","DOI":"10.1007\/978-3-031-30829-1_14"},{"key":"30_CR31","doi-asserted-by":"publisher","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"30_CR32","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der, L.: Expressivity of coalgebraic modal logic: The limits and beyond. Theor. Comput. Sci. 390(2), 230\u2013247 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.023","DOI":"10.1016\/j.tcs.2007.09.023"},{"key":"30_CR33","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der, L., Pattinson, D.: Description logics and fuzzy probability. In: Walsh, T. (ed.) International Joint Conference on Artificial Intelligence, IJCAI 2011. pp. 1075\u20131081. IJCAI\/AAAI (2011). https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-184","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-184"},{"key":"30_CR34","unstructured":"Turkenburg, R., Beohar, H., van Breugel, F., Kupke, C., Rot, J.: Constructing witnesses for lower bounds on behavioural distances. In: Computer Science Logic, CSL 2026 (2026), to appear. Preprint available at https:\/\/arxiv.org\/abs\/2504.08639"},{"key":"30_CR35","doi-asserted-by":"publisher","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1), 115\u2013142 (2005). https:\/\/doi.org\/10.1016\/J.TCS.2004.09.035","DOI":"10.1016\/J.TCS.2004.09.035"},{"key":"30_CR36","doi-asserted-by":"publisher","unstructured":"Villani, C.: Optimal Transport \u2013 Old and New. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-540-71050-9","DOI":"10.1007\/978-3-540-71050-9"},{"key":"30_CR37","doi-asserted-by":"publisher","unstructured":"Wild, P.: The Model Theory of Quantitative Coalgebraic Modal Logics. Ph.D. thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (2024). https:\/\/doi.org\/10.25593\/open-fau-480","DOI":"10.25593\/open-fau-480"},{"key":"30_CR38","doi-asserted-by":"publisher","unstructured":"Wild, P., Schr\u00f6der, L.: Characteristic logics for behavioural hemimetrics via fuzzy lax extensions. Log. Methods Comput. Sci. 18(2) (2022). https:\/\/doi.org\/10.46298\/lmcs-18(2:19)2022","DOI":"10.46298\/lmcs-18(2:19)2022"},{"key":"30_CR39","doi-asserted-by":"publisher","unstructured":"Wild, P., Schr\u00f6der, L., Messing, K., K\u00f6nig, B., Forster, J.: Generalized Kantorovich-Rubinstein duality beyond Hausdorff and Kantorovich (2025). https:\/\/doi.org\/10.48550\/arXiv.2510.23552","DOI":"10.48550\/arXiv.2510.23552"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22730-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:48:14Z","timestamp":1782949694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22730-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227294","9783032227300"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22730-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2026\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}