{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:28:47Z","timestamp":1775266127491,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T00:00:00Z","timestamp":1541635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00236-018-0329-6","type":"journal-article","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T05:54:23Z","timestamp":1541656463000},"page":"405-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Depletable channels: dynamics, behaviour, and efficiency in network design"],"prefix":"10.1007","volume":"56","author":[{"given":"Pietro","family":"Cenciarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8859-9844","authenticated-orcid":false,"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivano","family":"Salvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"329_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handobook of Process Algebra","author":"L Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handobook of Process Algebra, pp. 197\u2013292. North-Holland, Amsterdam (2001)"},{"key":"329_CR2","volume-title":"Network Flows, Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows, Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ (1993)"},{"issue":"3","key":"329_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.adhoc.2003.09.010","volume":"3","author":"K Akkaya","year":"2005","unstructured":"Akkaya, K., Younis, M.F.: A survey on routing protocols for wireless sensor networks. Ad Hoc Netw. 3(3), 325\u2013349 (2005)","journal-title":"Ad Hoc Netw."},{"issue":"8","key":"329_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/MCOM.2002.1024422","volume":"40","author":"I Akyildiz","year":"2002","unstructured":"Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Commun. Mag. 40(8), 102\u2013116 (2002)","journal-title":"IEEE Commun. Mag."},{"key":"329_CR5","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven, CT (1956)"},{"key":"329_CR6","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J., Nestmann, U., Alima, L.O., Gurov, D.: Verifying a structured peer-to-peer overlay network: the static case. In: Global Computing, volume 3267 of LNCS, pp. 250\u2013265. Springer (2005)","DOI":"10.1007\/978-3-540-31794-4_13"},{"key":"329_CR7","volume-title":"Algorithms and Protocols for Wireless Sensor Networks","year":"2009","unstructured":"Boukerche, A. (ed.): Algorithms and Protocols for Wireless Sensor Networks. Wiley, New York (2009)"},{"issue":"3","key":"329_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10817-015-9358-9","volume":"56","author":"T Bourke","year":"2016","unstructured":"Bourke, T., van Glabbeek, R.J., H\u00f6fner, P.: Mechanizing a process algebra for network protocols. J. Autom. Reason. 56(3), 309\u2013341 (2016)","journal-title":"J. Autom. Reason."},{"key":"329_CR9","first-page":"258","volume":"12","author":"D Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein paradoxon aus der verkehrsplannung. Unternehmensforschung 12, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"329_CR10","doi-asserted-by":"crossref","unstructured":"Bres, E., van Glabbeek, R.\u00a0J., H\u00f6fner, P.: A timed process algebra for wireless networks with an application in routing\u2014(extended abstract). In: Proceedings of ESOP, volume 9632 of LNCS, pp. 95\u2013122. Springer (2016)","DOI":"10.1007\/978-3-662-49498-1_5"},{"key":"329_CR11","unstructured":"Cenciarelli, P., Gorla, D., Salvo, I.: A polynomial-time algorithm for detecting the possibility of braess paradox in directed graphs. Algorithmica. A preliminary version is available at arXiv:1610.09320 (in press)"},{"key":"329_CR12","doi-asserted-by":"crossref","unstructured":"Cenciarelli, P., Gorla, D., Salvo, I.: Depletable channels: dynamics and behaviour. In: Proceedings of FCT09, volume 5690 of LNCS, pp. 50\u201361. Springer (2009)","DOI":"10.1007\/978-3-642-03409-1_6"},{"key":"329_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ipl.2017.10.008","volume":"131","author":"P Cenciarelli","year":"2018","unstructured":"Cenciarelli, P., Gorla, D., Salvo, I.: Inefficiencies in network models: a graph-theoretic perspective. Inf. Process. Lett. 131, 44\u201350 (2018)","journal-title":"Inf. Process. Lett."},{"key":"329_CR14","doi-asserted-by":"crossref","unstructured":"Cenciarelli, P., Gorla, D., Tuosto, E.: Network applications of graph bisimulation. In: Proceedings of ICGT08, volume 5214 of LNCS, pp. 131\u2013146. Springer (2008)","DOI":"10.1007\/978-3-540-87405-8_10"},{"key":"329_CR15","doi-asserted-by":"crossref","unstructured":"Cerone, A., Hennessy, M.: Modelling probabilistic wireless networks. Log. Methods Comput. Sci. 9(3) (2013)","DOI":"10.2168\/LMCS-9(3:26)2013"},{"key":"329_CR16","doi-asserted-by":"crossref","unstructured":"Cerone, A., Hennessy, M.: Characterising testing preorders for broadcasting distributed systems. In: Proceedings of Trustworthy Global Computing, volume 8902 of LNCS, pp. 67\u201381. Springer (2014)","DOI":"10.1007\/978-3-662-45917-1_5"},{"key":"329_CR17","doi-asserted-by":"crossref","unstructured":"Cerone, A., Hennessy, M., Merro, M.: Modelling mac-layer communications in wireless systems. Log. Methods Comput. Sci. 11(1) (2015)","DOI":"10.2168\/LMCS-11(1:18)2015"},{"key":"329_CR18","doi-asserted-by":"crossref","unstructured":"Chen, X., Diao, Z., Hu, X.: Excluding braess paradox in nonatomic selfish routing. In: Proceedings of SAGT15, volume 9347 of LNCS, pp. 219\u2013230. Springer (2015)","DOI":"10.1007\/978-3-662-48433-3_17"},{"key":"329_CR19","doi-asserted-by":"crossref","unstructured":"Chen, X., Diao, Z., Hu, X.: Network characterizations for excluding braess\u2019s paradox. Theory Comput. Syst. 1\u201334 (2016)","DOI":"10.1007\/s00224-016-9710-4"},{"key":"329_CR20","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"329_CR21","doi-asserted-by":"crossref","unstructured":"De Nicola, R.: Behavioral equivalences. In: Encyclopedia of Parallel Computing, pp. 120\u2013127. Springer (2011)","DOI":"10.1007\/978-0-387-09766-4_517"},{"key":"329_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"329_CR23","first-page":"214","volume":"11","author":"C Ene","year":"2002","unstructured":"Ene, C., Muntean, T.: Testing theories for broadcasting processes. Sci. Ann. Cuza Univ. 11, 214\u2013230 (2002)","journal-title":"Sci. Ann. Cuza Univ."},{"issue":"1","key":"329_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02996932","volume":"38","author":"F Escalante","year":"1972","unstructured":"Escalante, F.: Schnittverb\u00e4nde in graphen. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 38(1), 199\u2013220 (1972)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"329_CR25","doi-asserted-by":"crossref","unstructured":"Fehnker, A., McIver, A.: Formal techniques for the analysis of wireless networks. In: Proceedings of IEEE-ISOLA. IEEE (2006)","DOI":"10.1109\/ISoLA.2006.51"},{"key":"329_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"329_CR27","doi-asserted-by":"crossref","unstructured":"Ganjali, Y., Keshavarzian, A.: Load balancing in ad hoc networks: single-path routing versus multi-path routing. In: INFOCOM04, vol. 2, pp. 1120\u20131125 (2004)","DOI":"10.1109\/INFCOM.2004.1356998"},{"key":"329_CR28","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of np-Completeness (1979)"},{"issue":"28","key":"329_CR29","doi-asserted-by":"publisher","first-page":"3262","DOI":"10.1016\/j.tcs.2011.03.017","volume":"412","author":"F Ghassemi","year":"2011","unstructured":"Ghassemi, F., Fokkink, W., Movaghar, A.: Verification of mobile ad hoc networks: an algebraic approach. Theor. Comput. Sci. 412(28), 3262\u20133282 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"329_CR30","doi-asserted-by":"crossref","unstructured":"Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Proceedings of Coordination, volume 4467 of LNCS, pp. 132\u2013150. Springer (2007)","DOI":"10.1007\/978-3-540-72794-1_8"},{"key":"329_CR31","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"J Golumbic","year":"1980","unstructured":"Golumbic, J.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"issue":"8","key":"329_CR32","first-page":"453","volume":"2","author":"D Helen","year":"2014","unstructured":"Helen, D., Arivazhagan, D.: Applications, advantages and challenges of ad hoc networks. J. Acad. Ind. Res. 2(8), 453\u2013457 (2014)","journal-title":"J. Acad. Ind. Res."},{"issue":"10","key":"329_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0898-1221(98)00077-7","volume":"35","author":"M Iri","year":"1998","unstructured":"Iri, M.: Theory of uncontrollable flows\u2014a new type of network-flow theory as a model for the twenty-first century of multiple values. Comput. Math. Appl. 35(10), 107\u2013123 (1998)","journal-title":"Comput. Math. Appl."},{"key":"329_CR34","unstructured":"Jhaveri, D.R.: Mobile ad-hoc networking with AODV: a review. 6, 165\u2013191 (2015)"},{"issue":"1","key":"329_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P Kanellakis","year":"1990","unstructured":"Kanellakis, P., Smolka, S.: CCS expressions, finite state processes and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990)","journal-title":"Inf. Comput."},{"issue":"3","key":"329_CR36","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D.: Listing all minimal separators of a graph. SIAM J. Comput. 27(3), 605\u2013613 (1998)","journal-title":"SIAM J. Comput."},{"issue":"19","key":"329_CR37","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1016\/j.tcs.2010.01.023","volume":"411","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Sangiorgi, D.: An operational semantics for a calculus for wireless systems. Theor. Comput. Sci. 411(19), 1928\u20131948 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"329_CR38","doi-asserted-by":"crossref","unstructured":"Lanotte, R., Merro, M.: Semantic analysis of gossip protocols for wireless sensor networks. In: Proceedings of CONCUR, volume 6901 of LNCS, pp. 156\u2013170. Springer (2011)","DOI":"10.1007\/978-3-642-23217-6_11"},{"key":"329_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.scico.2013.01.005","volume":"81","author":"D Macedonio","year":"2014","unstructured":"Macedonio, D., Merro, M.: A semantic analysis of key management protocols for wireless sensor networks. Sci. Comput. Program. 81, 53\u201378 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"329_CR40","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ic.2007.11.010","volume":"207","author":"M Merro","year":"2009","unstructured":"Merro, M.: An observational theory for mobile ad hoc networks (full version). Inf. Comput. 207(2), 194\u2013208 (2009)","journal-title":"Inf. Comput."},{"issue":"47","key":"329_CR41","doi-asserted-by":"publisher","first-page":"6585","DOI":"10.1016\/j.tcs.2011.07.016","volume":"412","author":"M Merro","year":"2011","unstructured":"Merro, M., Ballardin, F., Sibilio, E.: A timed calculus for wireless systems. Theor. Comput. Sci. 412(47), 6585\u20136611 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"329_CR42","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00165-011-0210-7","volume":"25","author":"M Merro","year":"2013","unstructured":"Merro, M., Sibilio, E.: A calculus of trustworthy ad hoc networks. Form. Asp. Comput. 25(5), 801\u2013832 (2013)","journal-title":"Form. Asp. Comput."},{"key":"329_CR43","doi-asserted-by":"crossref","unstructured":"Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. In: Proceedings of MFPS, volume 158 of ENTCS, pp. 331\u2013353 (2006)","DOI":"10.1016\/j.entcs.2006.04.017"},{"key":"329_CR44","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139626774","volume-title":"Energy and Spectrum Efficient Wireless Network Design","author":"G Miao","year":"2014","unstructured":"Miao, G., Song, G.: Energy and Spectrum Efficient Wireless Network Design. Cambridge University Press, Cambridge (2014)"},{"key":"329_CR45","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network topology and the efficiency of equilibrium. Games Econ. Behav. 57, 321\u2013346 (2006)","journal-title":"Games Econ. Behav."},{"key":"329_CR46","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River, NJ (1989)"},{"key":"329_CR47","volume-title":"Ad Hoc Networks: Technologies and Protocols","year":"2005","unstructured":"Mohapatra, P., Krishnamurthy, S. (eds.): Ad Hoc Networks: Technologies and Protocols. Springer, New York (2005)"},{"issue":"1\u20132","key":"329_CR48","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2006.08.036","volume":"367","author":"S Nanz","year":"2006","unstructured":"Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1\u20132), 203\u2013227 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"329_CR49","doi-asserted-by":"crossref","unstructured":"Nehra, N., Patel, R.B., Bhat, V.K.: Routing with load balancing in ad hoc network: a mobile agent approach. In: Proceedings of ICIS 2007. IEEE (2007)","DOI":"10.1109\/ICIS.2007.161"},{"key":"329_CR50","doi-asserted-by":"crossref","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Theoretical Computer Science, volume 104 of LNCS, pp. 167\u2013183. Springer (1981)","DOI":"10.1007\/BFb0017309"},{"key":"329_CR51","doi-asserted-by":"crossref","unstructured":"Petrioli, C., Spenza, D., Tommasino, P., Trifiletti, A.: A novel wake-up receiver with addressing capability for wireless sensor nodes. In: Proceedings of DCOSS, pp. 18\u201325. IEEE (2014)","DOI":"10.1109\/DCOSS.2014.9"},{"key":"329_CR52","doi-asserted-by":"crossref","unstructured":"Phillips, C.A.: The network inhibition problem. In: Proceedings of STOC, pp. 776\u2013785. ACM Press (1993)","DOI":"10.1145\/167088.167286"},{"issue":"5","key":"329_CR53","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of braess\u2019s paradox: designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5), 922\u2013953 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"329_CR54","volume-title":"Introduction to Bisimulation and Coinduction","author":"D Sangiorgi","year":"2012","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge Universtity Press, Cambridge (2012)"},{"key":"329_CR55","volume-title":"Introduction to Wireless Systems","author":"PM Shankar","year":"2001","unstructured":"Shankar, P.M.: Introduction to Wireless Systems. Wiley, New York (2001)"},{"issue":"1\u20132","key":"329_CR56","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H Shen","year":"1997","unstructured":"Shen, H., Liang, W.: Efficient enumeration of all minimal separators in a graph. Theor. Comput. Sci. 180(1\u20132), 169\u2013180 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"329_CR57","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.scico.2009.07.008","volume":"75","author":"A Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program. 75(6), 440\u2013469 (2010)","journal-title":"Sci. Comput. Program."},{"key":"329_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-8770-7","volume-title":"Ad Hoc Networks: A Statistical Perspective","author":"JP Singh","year":"2018","unstructured":"Singh, J.P., Dutta, P., Chakrabarti, A.: Ad Hoc Networks: A Statistical Perspective. Springer, New York (2018)"},{"key":"329_CR59","doi-asserted-by":"crossref","unstructured":"Spenza, D., Magno, M., Basagni, S., Benini, L., Paoli, M., Petrioli, C.: Beyond duty cycling: wake-up radio with selective awakenings for long-lived wireless sensing systems. In: Proceedings of INFOCOM, pp. 522\u2013530. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218419"},{"key":"329_CR60","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings of STOC, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"329_CR61","volume-title":"Ad Hoc Mobile Wireless Networks: Protocols and Systems","author":"C Toh","year":"2002","unstructured":"Toh, C.: Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall, Upper Saddle River, NJ (2002)"},{"key":"329_CR62","doi-asserted-by":"publisher","DOI":"10.1002\/0470091126","volume-title":"Ad Hoc Wireless Networks: A Communication-Theoretic Perspective","author":"OK Tonguz","year":"2006","unstructured":"Tonguz, O.K., Ferrari, G.: Ad Hoc Wireless Networks: A Communication-Theoretic Perspective. Wiley, New York (2006)"},{"key":"329_CR63","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum (extended abstract). In: Proceedings of CONCUR, volume 458 of LNCS, pp. 278\u2013297. Springer (1990)","DOI":"10.1007\/BFb0039066"},{"key":"329_CR64","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Proceedings of CONCUR, volume 715 of LNCS, pp. 66\u201381. Springer (1993)","DOI":"10.1007\/3-540-57208-2_6"},{"issue":"4","key":"329_CR65","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-015-0262-7","volume":"29","author":"RJ Glabbeek van","year":"2016","unstructured":"van Glabbeek, R.J., H\u00f6fner, P., Portmann, M., Tan, W.L.: Modelling and verifying the AODV routing protocol. Distrib. Comput. 29(4), 279\u2013315 (2016)","journal-title":"Distrib. Comput."},{"key":"329_CR66","doi-asserted-by":"crossref","unstructured":"Zanjireh, M.M., Larijani, H.: A survey on centralised and distributed clustering routing algorithms for WSNS. In: IEEE 81st Vehicular Technology Conference, pp. 1\u20136 (2015)","DOI":"10.1109\/VTCSpring.2015.7145650"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-018-0329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-018-0329-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-018-0329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:24:45Z","timestamp":1775262285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-018-0329-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,8]]},"references-count":66,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["329"],"URL":"https:\/\/doi.org\/10.1007\/s00236-018-0329-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,8]]},"assertion":[{"value":"19 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}