{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:48Z","timestamp":1740109308766,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T00:00:00Z","timestamp":1564790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T00:00:00Z","timestamp":1564790400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["246\/08","671\/13"],"award-info":[{"award-number":["246\/08","671\/13"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1147\/09"],"award-info":[{"award-number":["1147\/09"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["CCF-1217423"],"award-info":[{"award-number":["CCF-1217423"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1065125"],"award-info":[{"award-number":["CCF-1065125"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Research Council","award":["ERC-CoG 772839","819702"],"award-info":[{"award-number":["ERC-CoG 772839","819702"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00453-019-00612-6","type":"journal-article","created":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T06:13:55Z","timestamp":1564812835000},"page":"747-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Local Algorithms for Sparse Spanning Graphs"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3167-1766","authenticated-orcid":false,"given":"Reut","family":"Levi","sequence":"first","affiliation":[]},{"given":"Dana","family":"Ron","sequence":"additional","affiliation":[]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"issue":"2","key":"612_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00453-007-9075-9","volume":"51","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. Algorithmica 51(2), 160\u2013182 (2008)","journal-title":"Algorithmica"},{"issue":"4","key":"612_CR2","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":"612_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1132\u20131139 (2012)","DOI":"10.1137\/1.9781611973099.89"},{"key":"612_CR4","unstructured":"Alon, N., Seymour, P.D., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pp. 293\u2013299 (1990)"},{"issue":"1\u20132","key":"612_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/15427951.2008.10129302","volume":"5","author":"R Andersen","year":"2008","unstructured":"Andersen, R., Borgs, C., Chayes, J., Hopcroft, J., Mirrokni, V., Teng, S.: Local computation of pagerank contributions. Internet Math. 5(1\u20132), 23\u201345 (2008)","journal-title":"Internet Math."},{"key":"612_CR6","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Proceedings of the Forty-Seventh Annual Symposium on Foundations of Computer Science (FOCS), pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"612_CR7","doi-asserted-by":"crossref","unstructured":"Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: Proceedings of the Forty-First Annual ACM Symposium on the Theory of Computing (STOC), pp. 235\u2013244 (2009)","DOI":"10.1145\/1536414.1536449"},{"issue":"9","key":"612_CR8","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.jpdc.2005.03.011","volume":"65","author":"DA Bader","year":"2005","unstructured":"Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). J. Parallel Distrib. Comput. 65(9), 994\u20131006 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"612_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P Berkhin","year":"2006","unstructured":"Berkhin, P.: Bookmark-coloring algorithm for personalized pagerank computing. Internet Math. 3(1), 41\u201362 (2006)","journal-title":"Internet Math."},{"key":"612_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"612_CR11","unstructured":"Brakerski, Z.: Local property restoring. Unpublished manuscript (2008)"},{"key":"612_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-40328-6_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Andrea Campagna","year":"2013","unstructured":"Campagna, A., Guo, A., Rubinfeld, R.: Local reconstructors and tolerant testers for connectivity and diameter. In: Proceedings of the Seventeenth International Workshop on Randomization and Computation (RANDOM), pp. 411\u2013424 (2013)"},{"issue":"6","key":"612_CR13","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1137\/S0097539702403244","volume":"34","author":"B Chazelle","year":"2005","unstructured":"Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SIAM J. Comput. 34(6), 1370\u20131379 (2005)","journal-title":"SIAM J. Comput."},{"key":"612_CR14","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Seshadhri, C.: Online geometric reconstruction. In: Proceedings of the Twenty-Second Annual ACM Symposium on Computation Geometry (SoCG), pp. 386\u2013394 (2006)","DOI":"10.1145\/1137856.1137912"},{"key":"612_CR15","doi-asserted-by":"crossref","unstructured":"Dutta, A., Levi, R., Ron, D., Rubinfeld, R.: A simple online competitive adaptation of lempel-ziv compression with efficient random access support. In: Proceedings of the Data Compression Conference (DCC), pp. 113\u2013122 (2013)","DOI":"10.1109\/DCC.2013.19"},{"key":"612_CR16","doi-asserted-by":"crossref","unstructured":"Elkin, M., Neiman, O.: Efficient algorithms for constructing very sparse spanners and emulators. CoRR, \narXiv:1607.08337\n\n, (2016)","DOI":"10.1137\/1.9781611974782.41"},{"key":"612_CR17","unstructured":"Even, G., Medina, M., Ron, D.: Deterministic stateless centralized local algorithms for bounded degree graphs. In: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8\u201310, 2014. Proceedings, pp. 394\u2013405 (2014)"},{"key":"612_CR18","unstructured":"Feige, U., Mansour, Y., Schapire, R.E.: Learning and inference in the presence of corrupted inputs. In: Proceedings of the 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3\u20136, 2015, pp. 637\u2013657 (2015)"},{"key":"612_CR19","unstructured":"Fredman, M.L., Willard, D.E.: BLASTING through the information theoretic barrier with FUSION TREES. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13\u201317, 1990, Baltimore, Maryland, USA, pp. 1\u20137 (1990)"},{"issue":"2","key":"612_CR20","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"key":"612_CR21","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: Proceedings of the Fiftieth Annual Symposium on Foundations of Computer Science (FOCS), pp. 22\u201331 (2009)","DOI":"10.1109\/FOCS.2009.77"},{"key":"612_CR22","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of the 12th International Conference on World Wide Web, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"612_CR23","doi-asserted-by":"crossref","unstructured":"Jha, M., Raskhodnikova, S.: Testing and reconstruction of Lipschitz functions with applications to data privacy. In: Proceedings of the Seventeenth Annual Symposium on Foundations of Computer Science (FOCS), pp. 433\u2013442 (2011)","DOI":"10.1109\/FOCS.2011.13"},{"key":"612_CR24","doi-asserted-by":"crossref","unstructured":"Kale, S., Peres, Y., Seshadhri, C.: Noise tolerance of expanders and sublinear expander reconstruction. In: Proceedings of the Forty-Ninth Annual Symposium on Foundations of Computer Science (FOCS), pp. 719\u2013728 (2008)","DOI":"10.1109\/FOCS.2008.65"},{"key":"612_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-22006-7_12","volume-title":"Automata, Languages and Programming","author":"Ken-ichi Kawarabayashi","year":"2011","unstructured":"Kawarabayashi, K., Klein, P.N., Sommer, C.: Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs. In: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4\u20138, 2011, Proceedings, Part I, pp. 135\u2013146 (2011)"},{"key":"612_CR26","unstructured":"Kawarabayashi, K., Reed, B.A.: A separator theorem in minor-closed classes. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23\u201326, 2010, Las Vegas, Nevada, USA, pp. 153\u2013162 (2010)"},{"issue":"1","key":"612_CR27","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jagm.1998.0929","volume":"28","author":"S Kutten","year":"1998","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. J. Algorithms 28(1), 40\u201366 (1998)","journal-title":"J. Algorithms"},{"key":"612_CR28","unstructured":"Lenzen, C., Levi, R.: A centralized local algorithm for the sparse spanning graph problem. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9\u201313, 2018, Prague, Czech Republic, pp. 87:1\u201387:14 (2018)"},{"key":"612_CR29","unstructured":"Levi, R., Medina, M.: A (centralized) local guide. Bull. EATCS 122, (2017)"},{"issue":"2","key":"612_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/rsa.20652","volume":"50","author":"R Levi","year":"2017","unstructured":"Levi, R., Moshkovitz, G., Ron, D., Rubinfeld, R., Shapira, A.: Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2), 183\u2013200 (2017)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"612_CR31","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2629508","volume":"11","author":"R Levi","year":"2015","unstructured":"Levi, R., Ron, D.: A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Trans. Algorithms 11(3), 24:1\u201324:13 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"612_CR32","unstructured":"Levi, R., Ron, D., Rubinfeld, R.: Local algorithms for sparse spanning graphs. In: Proceedings of the Eighteenth International Workshop on Randomization and Computation (RANDOM), pp. 826\u2013842 (2014)"},{"key":"612_CR33","unstructured":"Levi, R., Ron, D., Rubinfeld, R.: A local algorithm for constructing spanners in minor-free graphs. In: Proceedings of the Twentieth International Workshop on Randomization and Computation (RANDOM), pp. 38:1\u201338:15 (2016)"},{"key":"612_CR34","first-page":"1","volume":"77","author":"R Levi","year":"2016","unstructured":"Levi, R., Rubinfeld, R., Yodpinyanee, A.: Local computation algorithms for graphs of non-constant degrees. Algorithmica 77, 1\u201324 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"612_CR35","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":"612_CR36","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W Mader","year":"1968","unstructured":"Mader, W.: Homomorphies\u00e4tze f\u00fcr graphen. Mathematische Annalen 178, 154\u2013168 (1968)","journal-title":"Mathematische Annalen"},{"key":"612_CR37","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-31594-7_55","volume-title":"Automata, Languages, and Programming","author":"Yishay Mansour","year":"2012","unstructured":"Mansour, Y., Rubinstein, A., Vardi, S., Xie, N.: Converting online algorithms to local computation algorithms. In: Automata, Languages and Programming: Thirty-Ninth International Colloquium (ICALP), pp. 653\u2013664 (2012)"},{"key":"612_CR38","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-40328-6_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Yishay Mansour","year":"2013","unstructured":"Mansour, Y., Vardi, S.: A local computation approximation scheme to maximum matching. In: Proceedings of the Sixteenth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 260\u2013273 (2013)"},{"issue":"2","key":"612_CR39","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/1497290.1497298","volume":"5","author":"S Marko","year":"2009","unstructured":"Marko, S., Ron, D.: Distance approximation in bounded-degree and general sparse graphs. ACM Trans. Algorithms 5(2), 475\u2013486 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"612_CR40","unstructured":"Mayer, A., Naor, S., Stockmeyer, L.: Local computations on static and dynamic graphs. In: Proceedings of the 3rd Israel Symposium on Theory and Computing Systems (ISTCS) (1995)"},{"issue":"6","key":"612_CR41","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."},{"issue":"1","key":"612_CR42","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"s1\u201339","author":"Crispin St JA Nash-Williams","year":"1964","unstructured":"Nash-Williams, Crispin St J.A.: Decomposition of finite graphs into forests. J. London Math. Soc. s1\u201339(1), 12 (1964)","journal-title":"J. London Math. Soc."},{"key":"612_CR43","doi-asserted-by":"crossref","unstructured":"Nguyen, H.N., Onak, K.: Constant-time approximation algorithms via local improvements. In: Proceedings of the Forty-Ninth Annual Symposium on Foundations of Computer Science (FOCS), pp. 327\u2013336 (2008)","DOI":"10.1109\/FOCS.2008.81"},{"key":"612_CR44","doi-asserted-by":"crossref","unstructured":"Orecchia, L., Zhu, Z.A.: Flow-based algorithms for local graph clustering. CoRR, \narXiv:1307.2855\n\n, (2013)","DOI":"10.1137\/1.9781611973402.94"},{"issue":"1\u20133","key":"612_CR45","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.tcs.2007.04.040","volume":"381","author":"M Parnas","year":"2007","unstructured":"Parnas, M., Ron, D.: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381(1\u20133), 183\u2013196 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"612_CR46","unstructured":"Parter, M., Rubinfeld, R., Vakilian, A., Yodpinyanee, A.: Local computation algorithms for spanners. In: 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10\u201312, 2019, San Diego, California, USA, pp. 58:1\u201358:21 (2019)"},{"issue":"5","key":"612_CR47","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1137\/S0097539700369740","volume":"30","author":"D Peleg","year":"2000","unstructured":"Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput. 30(5), 1427\u20131442 (2000)","journal-title":"SIAM J. Comput."},{"key":"612_CR48","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theory 13, 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"612_CR49","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/0218015","volume":"18","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 229\u2013243 (1989)","journal-title":"SIAM J. Comput."},{"key":"612_CR50","first-page":"1","volume":"5","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed computing. SIAM Monogr. Discrete Math. Appl. 5, 1 (2000)","journal-title":"SIAM Monogr. Discrete Math. Appl."},{"issue":"3","key":"612_CR51","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-009-0091-7","volume":"22","author":"S Pettie","year":"2010","unstructured":"Pettie, S.: Distributed algorithms for ultrasparse spanners and linear size skeletons. Distrib. Comput. 22(3), 147\u2013166 (2010)","journal-title":"Distrib. Comput."},{"key":"612_CR52","unstructured":"Ram, L.S., Vicari, E.: Distributed small connected spanning subgraph: Breaking the diameter bound. Technical report, Z\u00fcrich (2011)"},{"key":"612_CR53","unstructured":"Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: Proceedings of The Second Symposium on Innovations in Computer Science (ICS), pp. 223\u2013238 (2011)"},{"issue":"7","key":"612_CR54","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1137\/080728561","volume":"39","author":"ME Saks","year":"2010","unstructured":"Saks, M.E., Seshadhri, C.: Local monotonicity reconstruction. SIAM J. Comput. 39(7), 2897\u20132926 (2010)","journal-title":"SIAM J. Comput."},{"key":"612_CR55","doi-asserted-by":"crossref","unstructured":"Sarlos, T., Benczur, A., Csalogany, K., Fogaras, D., Racz, B.: To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In: Proceedings of the 15th International Conference on WorldWide Web, pp. 297\u2013306 (2006)","DOI":"10.1145\/1135777.1135823"},{"key":"612_CR56","doi-asserted-by":"crossref","unstructured":"Spielman, D., Teng, S.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing (STOC), pp. 81\u201390 (2004)","DOI":"10.1145\/1007352.1007372"},{"issue":"2","key":"612_CR57","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.P.: Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62(2), 236\u2013266 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"612_CR58","doi-asserted-by":"crossref","unstructured":"Yoshida, Y., Yamamoto, M., Ito, H.: An improved constant-time approximation algorithm for maximum matchings. In: Proceedings of the Forty-First Annual ACM Symposium on the Theory of Computing (STOC), pp. 225\u2013234 (2009)","DOI":"10.1145\/1536414.1536447"},{"key":"612_CR59","unstructured":"Zhu, Z.A., Lattanzi, S., Mirrokni, V.: A local algorithm for finding well-connected clusters. In: Proceedings of the Thirtieth International Conference on Machine Learning (ICML) (2013)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00612-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00612-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00612-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T23:08:50Z","timestamp":1596323330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00612-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,3]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00612-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,8,3]]},"assertion":[{"value":"27 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}