{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:16:01Z","timestamp":1751602561022,"version":"3.41.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T00:00:00Z","timestamp":1524787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61722207","61672275"],"award-info":[{"award-number":["61722207","61672275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00446-018-0332-8","type":"journal-article","created":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T11:00:14Z","timestamp":1524826814000},"page":"227-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["What can be sampled locally?"],"prefix":"10.1007","volume":"33","author":[{"given":"Weiming","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9204-7794","authenticated-orcid":false,"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,27]]},"reference":[{"issue":"4","key":"332_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"332_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Luby, M., Goldberg, A.V., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 364\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"issue":"5","key":"332_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2979675","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L.: Deterministic ($$\\varDelta $$+ 1)-coloring in sublinear (in $$\\varDelta $$) time in static, dynamic, and faulty networks. J. ACM 63(5), 47 (2016)","journal-title":"J. ACM"},{"issue":"5","key":"332_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2027216.2027221","volume":"58","author":"L Barenboim","year":"2011","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23 (2011)","journal-title":"J. ACM"},{"issue":"3","key":"332_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63(3), 20 (2016)","journal-title":"J. ACM"},{"key":"332_CR6","doi-asserted-by":"crossref","unstructured":"Bubley, R., Dyer, M.: Path coupling: a technique for proving rapid mixing in markov chains. In: Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 223\u2013231 (1997)","DOI":"10.1109\/SFCS.1997.646111"},{"issue":"6","key":"332_CR7","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1137\/15M1032314","volume":"45","author":"JY Cai","year":"2016","unstructured":"Cai, J.Y., Chen, X., Lu, P.: Nonnegative weighted# CSP: an effective complexity dichotomy. SIAM J. Comput. 45(6), 2177\u20132198 (2016)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"332_CR8","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.jcss.2015.11.009","volume":"82","author":"JY Cai","year":"2016","unstructured":"Cai, J.Y., Galanis, A., Goldberg, L.A., Guo, H., Jerrum, M., \u0160tefankovi\u010d, D., Vigoda, E.: # bis-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5), 690\u2013711 (2016)","journal-title":"J. Comput. Syst. Sci."},{"issue":"49","key":"332_CR9","doi-asserted-by":"publisher","first-page":"17408","DOI":"10.1073\/pnas.1408184111","volume":"111","author":"B Calderhead","year":"2014","unstructured":"Calderhead, B.: A general construction for parallelizing Metropolis\u2013Hastings algorithms. Proc. Natl. Acad. Sci. 111(49), 17408\u201317413 (2014)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"332_CR10","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Kopelowitz, T., Pettie, S.: An exponential separation between randomized and deterministic complexity in the LOCAL model. In: Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 615\u2013624 (2016)","DOI":"10.1109\/FOCS.2016.72"},{"key":"332_CR11","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Pettie, S., Su, H.H.: Distributed algorithms for the Lov\u00e1sz local lemma and graph coloring. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 134\u2013143 (2014)","DOI":"10.1145\/2611462.2611465"},{"issue":"1\u20132","key":"332_CR12","first-page":"11","volume":"48","author":"M D\u00e1niel","year":"2004","unstructured":"D\u00e1niel, M.: Graph colouring problems and their applications in scheduling. Period. Polytech. Electr. Eng. 48(1\u20132), 11\u201316 (2004)","journal-title":"Period. Polytech. Electr. Eng."},{"issue":"1","key":"332_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2432622.2432624","volume":"60","author":"A Das Sarma","year":"2013","unstructured":"Das Sarma, A., Nanongkai, D., Pandurangan, G., Tetali, P.: Distributed random walks. J. ACM 60(1), 2 (2013)","journal-title":"J. ACM"},{"key":"332_CR14","doi-asserted-by":"crossref","unstructured":"De\u00a0Sa, C., Olukotun, K., R\u00e9, C.: Ensuring rapid mixing and low bias for asynchronous Gibbs sampling. In: Proceedings of the 33rd International Conference on Machine Learning (ICML), pp. 1567\u20131576 (2016)","DOI":"10.24963\/ijcai.2017\/672"},{"key":"332_CR15","unstructured":"De\u00a0Sa, C., Zhang, C., Olukotun, K., R\u00e9, C.: Rapidly mixing Gibbs sampling for a class of factor graphs using hierarchy width. In: Advances in Neural Information Processing Systems (NIPS), pp. 3097\u20133105 (2015)"},{"issue":"3","key":"332_CR16","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1137\/1115049","volume":"15","author":"RL Dobrushin","year":"1970","unstructured":"Dobrushin, R.L.: Prescribing a system of random variables by conditional distributions. Theory Probab. Appl. 15(3), 458\u2013486 (1970)","journal-title":"Theory Probab. Appl."},{"key":"332_CR17","unstructured":"Doshi-Velez, F., Mohamed, S., Ghahramani, Z., Knowles, D.A.: Large scale nonparametric Bayesian inference: data parallelisation in the Indian buffet process. In: Advances in Neural Information Processing Systems (NIPS), pp. 1294\u20131302 (2009)"},{"key":"332_CR18","doi-asserted-by":"crossref","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: Dobrushin conditions and systematic scan. In: Proceedings of the 10th International Workshop on Randomization and Computation (RANDOM), pp. 327\u2013338. Springer, Berlin (2006)","DOI":"10.1007\/11830924_31"},{"issue":"1","key":"332_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1214\/105051605000000683","volume":"16","author":"M Dyer","year":"2006","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: Systematic scan for sampling colorings. Ann. Appl. Probab. 16(1), 185\u2013230 (2006)","journal-title":"Ann. Appl. Probab."},{"key":"332_CR20","doi-asserted-by":"crossref","unstructured":"Efthymiou, C., Hayes, T.P., \u0160tefankovic, D., Vigoda, E., Yin, Y.: Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model. In: Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 704\u2013713 (2016)","DOI":"10.1109\/FOCS.2016.80"},{"key":"332_CR21","unstructured":"Feng, W., Hayes, T.P., Yin, Y.: Distributed symmetry breaking in sampling (optimal distributed randomly coloring with fewer colors). arXiv preprint arXiv:1802.06953 (2018)"},{"key":"332_CR22","doi-asserted-by":"crossref","unstructured":"Feng, W., Yin, Y.: On local distributed sampling and counting. arXiv preprint arXiv:1802.06686 (2018)","DOI":"10.1145\/3212734.3212757"},{"key":"332_CR23","unstructured":"Fischer, M., Ghaffari, M.: A simple parallel and distributed sampling technique: local glauber dynamics. arXiv preprint arXiv:1802.06676 (2018)"},{"key":"332_CR24","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Heinrich, M., Kosowski, A.: Local conflict coloring. In: Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 625\u2013634 (2016)","DOI":"10.1109\/FOCS.2016.73"},{"issue":"5","key":"332_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2499228","volume":"60","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM 60(5), 35 (2013)","journal-title":"J. ACM"},{"key":"332_CR26","first-page":"53","volume":"34","author":"A Frieze","year":"2007","unstructured":"Frieze, A., Vigoda, E.: A survey on the use of markov chains to randomly sample colourings. Oxf. Lect. Ser. Math. Appl. 34, 53 (2007)","journal-title":"Oxf. Lect. Ser. Math. Appl."},{"issue":"6","key":"332_CR27","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2785964","volume":"62","author":"A Galanis","year":"2015","unstructured":"Galanis, A., \u0160tefankovi\u010d, D., Vigoda, E.: Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region. J. ACM 62(6), 50 (2015)","journal-title":"J. ACM"},{"issue":"04","key":"332_CR28","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1017\/S0963548315000401","volume":"25","author":"A Galanis","year":"2016","unstructured":"Galanis, A., \u0160tefankovi\u010d, D., Vigoda, E.: Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. Comb. Probab. Comput. 25(04), 500\u2013559 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"332_CR29","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"332_CR30","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. arXiv preprint arXiv:1611.02663 (2016)","DOI":"10.1145\/3055399.3055471"},{"key":"332_CR31","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Su, H.H.: Distributed degree splitting, edge coloring, and orientations. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2505\u20132523 (2017)","DOI":"10.1137\/1.9781611974782.166"},{"key":"332_CR32","unstructured":"Gonzalez, J.E., Low, Y., Gretton, A., Guestrin, C.: Parallel Gibbs sampling: From colored fields to thin junction trees. In: Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS), vol.\u00a015, pp. 324\u2013332 (2011)"},{"key":"332_CR33","doi-asserted-by":"crossref","unstructured":"Guo, H., Jerrum, M., Liu, J.: Uniform sampling through the Lov\u00e1sz local lemma. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 342\u2013355 (2017)","DOI":"10.1145\/3055399.3055410"},{"key":"332_CR34","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Schneider, J., Su, H.H.: Distributed $$({\\varDelta } +1)$$-coloring in sublogarithmic rounds. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 465\u2013478 (2016)","DOI":"10.1145\/2897518.2897533"},{"key":"332_CR35","doi-asserted-by":"crossref","unstructured":"Hayes, T.P.: A simple condition implying rapid mixing of single-site dynamics on spin systems. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 39\u201346 (2006)","DOI":"10.1109\/FOCS.2006.6"},{"key":"332_CR36","unstructured":"Holroyd, A.E., Schramm, O., Wilson, D.B.: Finitary coloring. arXiv preprint arXiv:1412.2725 (2014)"},{"issue":"2","key":"332_CR37","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of $$k$$-colorings of a low-degree graph. Random Struct. Algorithms 7(2), 157\u2013165 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"332_CR38","unstructured":"Johnson, M.J., Saunderson, J., Willsky, A.S.: Analyzing Hogwild parallel Gaussian Gibbs sampling. In: Advances in Neural Information Processing Systems (NIPS), pp. 2715\u20132723 (2013)"},{"key":"332_CR39","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 23th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300\u2013309 (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"332_CR40","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), pp. 980\u2013989. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109666"},{"issue":"2","key":"332_CR41","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2742012","volume":"63","author":"F Kuhn","year":"2016","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17 (2016)","journal-title":"J. ACM"},{"key":"332_CR42","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 7\u201315 (2006)","DOI":"10.1145\/1146381.1146387"},{"key":"332_CR43","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Soc., Providence (2009)"},{"issue":"1","key":"332_CR44","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"332_CR45","doi-asserted-by":"crossref","unstructured":"Lu, P., Yin, Y.: Improved FPTAS for multi-spin systems. In: Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM), pp. 639\u2013654 (2013)","DOI":"10.1007\/978-3-642-40328-6_44"},{"issue":"4","key":"332_CR46","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"332_CR47","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M Mezard","year":"2009","unstructured":"Mezard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press, Oxford (2009)"},{"issue":"2","key":"332_CR48","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), 11 (2010)","journal-title":"J. ACM"},{"issue":"6","key":"332_CR49","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259\u20131277 (1995)","journal-title":"SIAM J. Comput."},{"key":"332_CR50","unstructured":"Newman, D., Asuncion, A., Smyth, P., Welling, M.: Distributed inference for latent Dirichlet allocation. In: Proceedings of the 20th International Conference on Neural Information Processing Systems (NIPS), pp. 1081\u20131088 (2007)"},{"key":"332_CR51","unstructured":"Niu, F., Recht, B., R\u00e9, C., Wright, S.J.: Hogwild: a lock-free approach to parallelizing stochastic gradient descent. In: Advances in Neural Information Processing Systems (NIPS), pp. 693\u2013701 (2011)"},{"key":"332_CR52","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-sensitive Approach. SIAM, Philadelphia (2000)"},{"issue":"3","key":"332_CR53","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02199113","volume":"86","author":"J Salas","year":"1997","unstructured":"Salas, J., Sokal, A.D.: Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Stat. Phys. 86(3), 551\u2013579 (1997)","journal-title":"J. Stat. Phys."},{"issue":"5","key":"332_CR54","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/11085178X","volume":"41","author":"AD Sarma","year":"2012","unstructured":"Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235\u20131265 (2012)","journal-title":"SIAM J. Comput."},{"key":"332_CR55","doi-asserted-by":"crossref","unstructured":"Sly, A.: Computational transition at the uniqueness threshold. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 287\u2013296 (2010)","DOI":"10.1109\/FOCS.2010.34"},{"issue":"6","key":"332_CR56","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1214\/13-AOP888","volume":"42","author":"A Sly","year":"2014","unstructured":"Sly, A., Sun, N.: Counting in two-spin models on $$d$$-regular graphs. Ann. Probab. 42(6), 2383\u20132416 (2014)","journal-title":"Ann. Probab."},{"key":"332_CR57","unstructured":"Smyth, P., Welling, M., Asuncion, A.U.: Asynchronous distributed learning of topic models. In: Advances in Neural Information Processing Systems (NIPS), pp. 81\u201388 (2009)"},{"issue":"21","key":"332_CR58","doi-asserted-by":"publisher","first-page":"2607","DOI":"10.1103\/PhysRevLett.57.2607","volume":"57","author":"RH Swendsen","year":"1986","unstructured":"Swendsen, R.H., Wang, J.S.: Replica Monte Carlo simulation of spin-glasses. Phys. Rev. Lett. 57(21), 2607 (1986)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"332_CR59","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1063\/1.533196","volume":"41","author":"E Vigoda","year":"2000","unstructured":"Vigoda, E.: Improved bounds for sampling colorings. J. Math. Phys. 41(3), 1555\u20131569 (2000)","journal-title":"J. Math. Phys."},{"key":"332_CR60","doi-asserted-by":"crossref","unstructured":"Weitz, D.: Counting independent sets up to the tree threshold. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 140\u2013149 (2006)","DOI":"10.1145\/1132516.1132538"},{"key":"332_CR61","unstructured":"Xu, M., Lakshminarayanan, B., Teh, Y.W., Zhu, J., Zhang, B.: Distributed bayesian posterior sampling via moment sharing. In: Proceedings of the 27th International Conference on Neural Information Processing Systems (NIPS), pp. 3356\u20133364 (2014)"},{"key":"332_CR62","unstructured":"Yan, F., Xu, N., Qi, Y.: Parallel inference for latent Dirichlet allocation on graphics processing units. In: Advances in Neural Information Processing Systems (NIPS), pp. 2134\u20132142 (2009)"},{"key":"332_CR63","doi-asserted-by":"crossref","unstructured":"Yang, Y., Chen, J., Zhu, J.: Distributing the stochastic gradient sampler for large-scale LDA. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1975\u20131984 (2016)","DOI":"10.1145\/2939672.2939821"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0332-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-018-0332-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0332-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T23:50:34Z","timestamp":1751586634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-018-0332-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,27]]},"references-count":63,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["332"],"URL":"https:\/\/doi.org\/10.1007\/s00446-018-0332-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2018,4,27]]},"assertion":[{"value":"8 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}