{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:26Z","timestamp":1740122306967,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T00:00:00Z","timestamp":1525910400000},"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":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10458-018-9388-x","type":"journal-article","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T02:42:22Z","timestamp":1525920142000},"page":"569-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new distributed algorithm for efficient generalized arc-consistency propagation"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4264-3330","authenticated-orcid":false,"given":"Shufeng","family":"Kong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9840-780X","authenticated-orcid":false,"given":"Jae Hee","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3332-2546","authenticated-orcid":false,"given":"Sanjiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,10]]},"reference":[{"issue":"3","key":"9388_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"33","author":"B Awerbuch","year":"1987","unstructured":"Awerbuch, B., & Gallager, R. (1987). A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, 33(3), 315\u2013322.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9388_CR2","unstructured":"Baudot, B., & Deville, Y. (1997). Analysis of distributed arc-consistency algorithms. Technical report, Universit\u00e9 catholique de Louvain."},{"issue":"1","key":"9388_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","volume":"65","author":"C Bessiere","year":"1994","unstructured":"Bessiere, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1), 179\u2013190.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9388_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0004-3702(98)00105-2","volume":"107","author":"C Bessiere","year":"1999","unstructured":"Bessiere, C., Freuder, E. C., & R\u00e9gin, J. C. (1999). Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence, 107(1), 125\u2013148.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9388_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., R\u00e9gin, J. C., Yap, R. H., & Zhang, Y. (2005). An optimal coarse-grained arc consistency algorithm. Artificial Intelligence, 165(2), 165\u2013185.","journal-title":"Artificial Intelligence"},{"key":"9388_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1613\/jair.3840","volume":"47","author":"JC Boerkoel Jr","year":"2013","unstructured":"Boerkoel, J. C, Jr., & Durfee, E. H. (2013). Distributed reasoning for multiagent simple temporal problems. Journal of Artificial Intelligence Research, 47, 95\u2013156.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9388_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-82453-1_11","volume-title":"Logics and models of concurrent systems","author":"KM Chandy","year":"1985","unstructured":"Chandy, K. M., & Misra, J. (1985). A paradigm for detecting quiescent properties in distributed computations. In K. R. Apt (Ed.), Logics and models of concurrent systems (pp. 325\u2013341). New York: Springer."},{"issue":"1","key":"9388_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"KM Chandy","year":"1985","unstructured":"Chandy, K. M., & Lamport, L. (1985). Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems (TOCS), 3(1), 63\u201375.","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"issue":"1","key":"9388_CR9","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"KM Chandy","year":"1986","unstructured":"Chandy, K. M., & Misra, J. (1986). How processes learn. Distributed Computing, 1(1), 40\u201352.","journal-title":"Distributed Computing"},{"issue":"4","key":"9388_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"SE\u20138","author":"EJH Chang","year":"1982","unstructured":"Chang, E. J. H. (1982). Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering, SE\u20138(4), 391\u2013401.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"9388_CR11","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/21.135689","volume":"21","author":"SE Conry","year":"1991","unstructured":"Conry, S. E., Kuwabara, K., Lesser, V. R., & Meyer, R. A. (1991). Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man, and Cybernetics, 21(6), 1462\u20131477.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1\u20133","key":"9388_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0004-3702(92)90008-L","volume":"58","author":"PR Cooper","year":"1992","unstructured":"Cooper, P. R., & Swain, M. J. (1992). Arc consistency: Parallelism and domain dependence. Artificial Intelligence, 58(1\u20133), 207\u2013235.","journal-title":"Artificial Intelligence"},{"issue":"1\u20133","key":"9388_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1\u20133), 61\u201395.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"9388_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"EW Dijkstra","year":"1986","unstructured":"Dijkstra, E. W., Feijen, W. H., & Van Gasteren, A. M. (1986). Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5), 217\u2013219. https:\/\/doi.org\/10.1016\/0020-0190(83)90092-3 .","journal-title":"Information Processing Letters"},{"issue":"1","key":"9388_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"EW Dijkstra","year":"1980","unstructured":"Dijkstra, E. W., & Scholten, C. S. (1980). Termination detection for diffusing computations. Information Processing Letters, 11(1), 1\u20134.","journal-title":"Information Processing Letters"},{"key":"9388_CR16","doi-asserted-by":"crossref","unstructured":"Eriksen, O, & Skyum, S. (1985). Symmetric distributed termination. DAIMI report series 14(189).","DOI":"10.7146\/dpb.v14i189.7462"},{"key":"9388_CR17","doi-asserted-by":"crossref","unstructured":"Faltings, B., L\u00e9aut\u00e9, T., & Petcu, A. (2008). Privacy guarantees through distributed constraint satisfaction. In 2008 IEEE\/WIC\/ACM international conference on web intelligence and intelligent agent technology (Vol.\u00a02, pp. 350\u2013358).","DOI":"10.1109\/WIIAT.2008.177"},{"key":"9388_CR18","unstructured":"Grinshpoun, T. (2012). When you say (DCOP) privacy, what do you mean?\u2014Categorization of DCOP privacy and insights on internal constraint privacy. In: J. Filipe, A. L. N. Fred (Eds.), ICAART 2012\u2014Proceedings of the 4th international conference on agents and artificial intelligence (Vol. 1, pp. 380\u2013386)\u2014Artificial Intelligence, Vilamoura, Algarve, Portugal, 6\u20138 February, 2012. SciTePress."},{"issue":"1","key":"9388_CR19","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1613\/jair.5322","volume":"57","author":"T Grinshpoun","year":"2016","unstructured":"Grinshpoun, T., & Tassa, T. (2016). P-syncbb: A privacy preserving branch and bound dcop algorithm. Journal of Artificial Intelligence Research, 57(1), 621\u2013660.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9388_CR20","unstructured":"Gu, J., Sosic, R. (1991). A parallel architecture for constraint satisfaction. In: International conference on industrial and engineering applications of artificial intelligence and expert systems (pp. 229\u2013237)."},{"issue":"3\u20134","key":"9388_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1020594125144","volume":"7","author":"Y Hamadi","year":"2002","unstructured":"Hamadi, Y. (2002). Optimal distributed arc-consistency. Constraints, 7(3\u20134), 367\u2013385.","journal-title":"Constraints"},{"key":"9388_CR22","unstructured":"Hassine, A. B., & Ghedira, K. (2002). How to establish arc-consistency by reactive agents. In Proceedings of the 15th European conference on artificial intelligence (pp. 156\u2013160)."},{"key":"9388_CR23","doi-asserted-by":"crossref","unstructured":"Hassine, A. B., Ghedira, K., & Ho, T. B. (2004). New distributed filtering-consistency approach to general networks. In Proceedings of the 17th international conference on industrial and engineering applications of artificial intelligence and expert systems (pp. 708\u2013717).","DOI":"10.1007\/978-3-540-24677-0_73"},{"key":"9388_CR24","doi-asserted-by":"crossref","unstructured":"Huang, S. T. (1989). Detecting termination of distributed computations by external agents. In Proceedings of the 9th international conference on distributed computing systems (pp. 79\u201384).","DOI":"10.1109\/ICDCS.1989.37933"},{"key":"9388_CR25","unstructured":"Hubbe, P. D., & Freuder, E. C. (1992). An efficient cross product representation of the constraint satisfaction problem search space. In Proceedings of the tenth national conference on artificial intelligence (pp. 421\u2013427)."},{"issue":"1","key":"9388_CR26","first-page":"295","volume":"6","author":"DA Huffman","year":"1971","unstructured":"Huffman, D. A. (1971). Impossible objects as nonsense sentences. Machine Intelligence, 6(1), 295\u2013323.","journal-title":"Machine Intelligence"},{"issue":"6","key":"9388_CR27","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1109\/21.135687","volume":"21","author":"MN Huhns","year":"1991","unstructured":"Huhns, M. N., & Bridgeland, D. M. (1991). Multiagent truth maintenance. IEEE Transactions on Systems, Man, and Cybernetics, 21(6), 1437\u20131445.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"9388_CR28","doi-asserted-by":"crossref","unstructured":"Kong, S., Lee, J. H., & Li, S. (2018). Multiagent simple temporal problem: The Arc-consistency approach. In Thirty-Second AAAI Conference on Artificial Intelligence, AAAI\u201918. AAAI Press.","DOI":"10.1609\/aaai.v32i1.12087"},{"issue":"1","key":"9388_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/71.363410","volume":"6","author":"TH Lai","year":"1995","unstructured":"Lai, T. H., & Wu, L. F. (1995). An (n -1)-resilient algorithm for distributed termination detection. IEEE Transactions on Parallel and Distributed Systems, 6(1), 63\u201378.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9388_CR30","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1613\/jair.3983","volume":"47","author":"T L\u00e9aut\u00e9","year":"2013","unstructured":"L\u00e9aut\u00e9, T., & Faltings, B. (2013). Protecting privacy through distributed computation in multi-agent decision making. Journal of Artificial Intelligence Research, 47, 649\u2013695.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9388_CR31","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.artint.2013.05.006","volume":"201","author":"S Li","year":"2013","unstructured":"Li, S., Liu, W., & Wang, S. (2013). Qualitative constraint satisfaction problems: An extended framework with landmarks. Artificial Intelligence, 201, 32\u201358.","journal-title":"Artificial Intelligence"},{"key":"9388_CR32","volume-title":"Distributed algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N. A. (1996). Distributed algorithms. Burlington: Morgan Kaufmann."},{"issue":"1","key":"9388_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9388_CR34","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10458-006-5951-y","volume":"13","author":"RT Maheswaran","year":"2006","unstructured":"Maheswaran, R. T., Pearce, J. P., Bowring, E., Varakantham, P., & Tambe, M. (2006). Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications. Autonomous Agents and Multi-Agent Systems, 13(1), 27\u201360.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9388_CR35","doi-asserted-by":"crossref","unstructured":"Maruyama, H. (1990). Structural disambiguation with constraint propagation. In ACL (pp. 31\u201338).","DOI":"10.3115\/981823.981828"},{"key":"9388_CR36","unstructured":"Mason, C. L., & Johnson, R. R. (1988). Datms: A framework for distributed assumption based reasoning. Technical report, Lawrence Livermore National Lab., CA (USA)."},{"issue":"3","key":"9388_CR37","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0164-1212(98)10034-1","volume":"43","author":"J Matocha","year":"1998","unstructured":"Matocha, J., & Camp, T. (1998). A taxonomy of distributed termination detection algorithms. Journal of Systems and Software, 43(3), 207\u2013221.","journal-title":"Journal of Systems and Software"},{"issue":"3","key":"9388_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F Mattern","year":"1987","unstructured":"Mattern, F. (1987). Algorithms for distributed termination detection. Distributed Computing, 2(3), 161\u2013175.","journal-title":"Distributed Computing"},{"issue":"2","key":"9388_CR39","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0020-0190(94)00129-4","volume":"52","author":"J Mayo","year":"1994","unstructured":"Mayo, J., & Kearns, P. (1994). Distributed termination detection with roughly synchronized clocks. Information Processing Letters, 52(2), 105\u2013108.","journal-title":"Information Processing Letters"},{"issue":"1","key":"9388_CR40","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10601-006-9013-5","volume":"12","author":"A Meisels","year":"2007","unstructured":"Meisels, A., & Zivan, R. (2007). Asynchronous forward-checking for discsps. Constraints, 12(1), 131\u2013150.","journal-title":"Constraints"},{"issue":"2","key":"9388_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R Mohr","year":"1986","unstructured":"Mohr, R., & Henderson, T. C. (1986). Arc and path consistency revisited. Artificial Intelligence, 28(2), 225\u2013233.","journal-title":"Artificial Intelligence"},{"key":"9388_CR42","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U Montanari","year":"1974","unstructured":"Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7, 95\u2013132.","journal-title":"Information Sciences"},{"issue":"1\u20132","key":"9388_CR43","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0167-6423(97)00012-9","volume":"30","author":"T Nguyen","year":"1998","unstructured":"Nguyen, T., & Deville, Y. (1998). A distributed arc-consistency algorithm. Science of Computer Programming, 30(1\u20132), 227\u2013250.","journal-title":"Science of Computer Programming"},{"key":"9388_CR44","unstructured":"Raynal, M. (2013). Distributed termination detection. In Distributed algorithms for message-passing systems (pp. 367\u2013399). Berlin: Springer."},{"issue":"5","key":"9388_CR45","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01407901","volume":"16","author":"A Samal","year":"1987","unstructured":"Samal, A., & Henderson, T. (1987). Parallel consistent labeling algorithms. International Journal of Parallel Programming, 16(5), 341\u2013364.","journal-title":"International Journal of Parallel Programming"},{"key":"9388_CR46","doi-asserted-by":"crossref","unstructured":"Savaux, J., Vion, J., Piechowiak, S., Mandiau, R., Matsui, T., Hirayama, K., Yokoo, M., Elmane, S., & Silaghi, M. (2016). DisCSPs with privacy recast as planning problems for self-interested agents. In 2016 IEEE\/WIC\/ACM international conference on web intelligence (WI) (pp. 359\u2013366).","DOI":"10.1109\/WI.2016.0057"},{"key":"9388_CR47","doi-asserted-by":"crossref","unstructured":"Shavit, N., & Francez, N. (1986) A new approach to detection of locally indicative stability. In International colloquium on automata, languages, and programming (pp. 344\u2013358). Springer.","DOI":"10.1007\/3-540-16761-7_84"},{"key":"9388_CR48","unstructured":"Silaghi, M. (2002). A comparison of distributed constraint satisfaction approaches with respect to privacy. In In DCR. Citeseer."},{"key":"9388_CR49","unstructured":"Sultanik, E. A., Lass, R. N., & Regli, W .C. (2007). Dcopolis: A framework for simulating and deploying distributed constraint optimization algorithms. In Proceedings of the workshop on distributed constraint reasoning."},{"issue":"6","key":"9388_CR50","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.1109\/21.135688","volume":"21","author":"K Sycara","year":"1991","unstructured":"Sycara, K., Roth, S. F., Sadeh, N., & Fox, M. S. (1991). Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6), 1446\u20131461.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"1","key":"9388_CR51","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"RW Topor","year":"1984","unstructured":"Topor, R. W. (1984). Termination detection for distributed computations. Information Processing Letters, 18(1), 33\u201336.","journal-title":"Information Processing Letters"},{"issue":"1","key":"9388_CR52","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/24.24583","volume":"38","author":"S Venkatesan","year":"1989","unstructured":"Venkatesan, S. (1989). Reliable protocols for distributed termination detection. IEEE Transactions on Reliability, 38(1), 103\u2013110.","journal-title":"IEEE Transactions on Reliability"},{"issue":"1","key":"9388_CR53","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.artint.2004.10.006","volume":"161","author":"RJ Wallace","year":"2005","unstructured":"Wallace, R. J., & Freuder, E. C. (2005). Constraint-based reasoning and privacy\/efficiency tradeoffs in multi-agent problem solving. Artificial Intelligence, 161(1), 209\u2013227.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"9388_CR54","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M Yokoo","year":"1998","unstructured":"Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5), 673\u2013685.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"9388_CR55","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1010078712316","volume":"3","author":"M Yokoo","year":"2000","unstructured":"Yokoo, M., & Hirayama, K. (2000). Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 3(2), 185\u2013207.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"1","key":"9388_CR56","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.artint.2004.10.007","volume":"161","author":"M Yokoo","year":"2005","unstructured":"Yokoo, M., Suzuki, K., & Hirayama, K. (2005). Secure distributed constraint satisfaction: Reaching agreement without revealing private information. Artificial Intelligence, 161(1), 229\u2013245.","journal-title":"Artificial Intelligence"},{"key":"9388_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, Y., & Mackworth, A. K. (1991). Parallel and distributed algorithms for finite constraint satisfaction problems. In Proceedings of the 3th IEEE symposium on parallel and distributed processing (pp. 394\u2013397).","DOI":"10.1109\/SPDP.1991.218214"},{"key":"9388_CR58","unstructured":"Zhang, Y., & Yap, R. H. C. (2001). Making ac-3 an optimal algorithm. In Proceedings of the 17th international joint conference on artificial intelligence (pp. 316\u2013321)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-018-9388-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9388-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9388-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T01:46:45Z","timestamp":1661219205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-018-9388-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,10]]},"references-count":58,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s10458-018-9388-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2018,5,10]]},"assertion":[{"value":"10 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}