{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T21:02:57Z","timestamp":1705093377127},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T00:00:00Z","timestamp":1589068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T00:00:00Z","timestamp":1589068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s11227-020-03291-1","type":"journal-article","created":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T09:02:17Z","timestamp":1589101337000},"page":"1177-1213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ramanujan graphs and the spectral gap of supercomputing topologies"],"prefix":"10.1007","volume":"77","author":[{"given":"Sinan G.","family":"Aksoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Bruillard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen J.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Raugas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,10]]},"reference":[{"key":"3291_CR1","unstructured":"Xpander project page. https:\/\/husant.github.io\/Xpander\/"},{"key":"3291_CR2","doi-asserted-by":"crossref","unstructured":"Bob Metcalfe eats his words (1997) Internet Computing Online 1","DOI":"10.1109\/MIC.1997.601070"},{"key":"3291_CR3","unstructured":"Slingshot: The interconnect for the exascale era. Technical Report, Cray Inc., February (2019)"},{"key":"3291_CR4","doi-asserted-by":"publisher","first-page":"428","DOI":"10.13001\/1081-3810.3675","volume":"34","author":"A Abiad","year":"2018","unstructured":"Abiad A, Brimkov B, Martinez-Rivera X, Suil O, Zhang J (2018) Spectral bounds for the connectivity of regular graphs with given order. Electron J Linear Algebra 34:428\u2013443","journal-title":"Electron J Linear Algebra"},{"key":"3291_CR5","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TC.1987.1676983","volume":"C\u201336","author":"SB Akers","year":"1987","unstructured":"Akers SB, Krishnamurthy B (1987) On group graphs and their fault tolerance. IEEE Trans Comput C\u201336:885\u2013888","journal-title":"IEEE Trans Comput"},{"key":"3291_CR6","doi-asserted-by":"crossref","unstructured":"Alon N (1984) Eigenvalues and expanders. Combinatorica 6 (1986) 83\u201396. Theory of computing (Singer Island, Fla., 1984)","DOI":"10.1007\/BF02579166"},{"key":"3291_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N Alon","year":"1994","unstructured":"Alon N, Chung FRK, Graham RL (1994) Routing permutations on graphs via matchings. SIAM J Discrete Math 7:513\u2013530","journal-title":"SIAM J Discrete Math"},{"key":"3291_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N Alon","year":"1985","unstructured":"Alon N, Milman V (1985) $$\\lambda _1$$, isoperimetric inequalities for graphs, and superconcentrators. J Comb Theory Ser B 38:73\u201388","journal-title":"J Comb Theory Ser B"},{"key":"3291_CR9","unstructured":"Alon N, Spencer JH (2000) The probabilistic method. Wiley-Interscience series in discrete mathematics and optimization. Wiley-Interscience (John Wiley & Sons), New York, second\u00a0ed. With an appendix on the life and work of Paul Erd\u0151s"},{"key":"3291_CR10","unstructured":"Alverson B, Froese E, Kaplay L, Roweth D Cray$$^{\\textregistered }$$ XC$$^{{\\rm TM}}$$ series network"},{"key":"3291_CR11","doi-asserted-by":"crossref","unstructured":"Besta M, Hoefler T (2014) Slim fly: a cost effective low-diameter network topology. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press, pp 348\u2013359","DOI":"10.1109\/SC.2014.34"},{"key":"3291_CR12","doi-asserted-by":"crossref","unstructured":"Bhatele A, Jain N, Livnat Y, Pascucci V, Bremer P (2016) Analyzing network health and congestion in dragonfly-based supercomputers. In 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23\u201327, pp 93\u2013102","DOI":"10.1109\/IPDPS.2016.123"},{"key":"3291_CR13","volume-title":"Algebraic graph theory, Cambridge mathematical library","author":"N Biggs","year":"1993","unstructured":"Biggs N (1993) Algebraic graph theory, Cambridge mathematical library, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"key":"3291_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00493-006-0029-7","volume":"26","author":"Y Bilu","year":"2006","unstructured":"Bilu Y, Linial N (2006) Lifts, discrepancy and nearly optimal spectral gap. Combinatorica 26:495\u2013519","journal-title":"Combinatorica"},{"key":"3291_CR15","doi-asserted-by":"crossref","unstructured":"Brewer EA, Chong FT, Leighton T (1994) Scalable expanders. In: Proceedings of the Twenty-Sixth Annual ACM symposium on Theory of computing\u2014STOC \u201994. ACM Press","DOI":"10.1145\/195058.195120"},{"key":"3291_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer AE, Haemers WH (2012) Spectra of graphs. Universitext, Springer, New York"},{"key":"3291_CR17","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/115","volume-title":"The mutually beneficial relationship of graphs and matrices","author":"RA Brualdi","year":"2011","unstructured":"Brualdi RA (2011) The mutually beneficial relationship of graphs and matrices, vol 115. American Mathematical Society, Providence"},{"key":"3291_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.24033\/asens.1426","volume":"15","author":"P Buser","year":"1982","unstructured":"Buser P (1982) A note on the isoperimetric constant. Annales scientifiques de \u00c9cole normale sup\u00e9rieure 15:213\u2013230","journal-title":"Annales scientifiques de \u00c9cole normale sup\u00e9rieure"},{"key":"3291_CR19","first-page":"3","volume":"23","author":"F Chung","year":"2016","unstructured":"Chung F (2016) A generalized Alon-Boppana bound and weak Ramanujan graphs. Electron J Comb 23:3\u20134","journal-title":"Electron J Comb"},{"key":"3291_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1090\/S0894-0347-1989-0965008-X","volume":"2","author":"FRK Chung","year":"1989","unstructured":"Chung FRK (1989) Diameters and eigenvalues. J Am Math Soc 2:187\u2013187","journal-title":"J Am Math Soc"},{"key":"3291_CR21","doi-asserted-by":"crossref","unstructured":"Chung FRK (1997) Spectral graph theory, vol.\u00a092 of CBMS Regional Conference Series in Mathematics, Published for the Conference Board of the Mathematical Sciences, Washington, DC","DOI":"10.1090\/cbms\/092"},{"key":"3291_CR22","first-page":"635","volume":"342","author":"SM Cioab\u0103","year":"2006","unstructured":"Cioab\u0103 SM (2006) Closed walks and eigenvalues of abelian Cayley graphs. CR Math 342:635\u2013638","journal-title":"CR Math"},{"key":"3291_CR23","doi-asserted-by":"crossref","unstructured":"Cohen MB (2016) Ramanujan graphs in polynomial time. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE","DOI":"10.1109\/FOCS.2016.37"},{"key":"3291_CR24","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czechoslovak Math J 23:298\u2013305","journal-title":"Czechoslovak Math J"},{"key":"3291_CR25","doi-asserted-by":"crossref","unstructured":"Friedman J (2003) A proof of Alon\u2019s second eigenvalue conjecture. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing\u2014STOC \u201903. ACM Press","DOI":"10.1145\/780542.780646"},{"key":"3291_CR26","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1137\/S0097539700366103","volume":"30","author":"AM Frieze","year":"2001","unstructured":"Frieze AM (2001) Edge-disjoint paths in expander graphs. SIAM J Comput 30:1790\u20131801","journal-title":"SIAM J Comput"},{"key":"3291_CR27","doi-asserted-by":"crossref","unstructured":"Gioiosa R, Tumeo A, Yin J, Warfel T, Haglin D, Betelu S (2017) Exploring data vortex systems for irregular applications. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE","DOI":"10.1109\/IPDPS.2017.121"},{"key":"3291_CR28","doi-asserted-by":"crossref","unstructured":"Gioiosa R, Warfel T, Yin J, Tumeo A, Haglin D (2016) Exploring data vortex network architectures. In: 2016 IEEE 24th Annual Symposium on High-Performance Interconnects (HOTI). IEEE","DOI":"10.1109\/HOTI.2016.025"},{"key":"3291_CR29","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/885651.781046","volume":"31","author":"C Gkantsidis","year":"2003","unstructured":"Gkantsidis C, Mihail M, Saberi A (2003) Conductance and congestion in power law graphs. SIGMETRICS Perform Eval Rev 31:148\u2013159","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"3291_CR30","doi-asserted-by":"crossref","unstructured":"Godsil C, Royle G (2001) Algebraic graph theory, vol 207. Graduate Texts in Mathematics. Springer, New York","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"3291_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TPDS.2007.48","volume":"18","author":"C Hawkins","year":"2007","unstructured":"Hawkins C, Small BA, Wills DS, Bergman K (2007) The data vortex, an all optical path multicomputer interconnection network. IEEE Trans Parallel Distrib Syst 18:409\u2013420","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3291_CR32","doi-asserted-by":"crossref","unstructured":"Heydemann M-C (1997) Cayley graphs and interconnection networks. In: Graph Symmetry. Springer, Netherlands, pp 167\u2013224","DOI":"10.1007\/978-94-015-8937-6_5"},{"key":"3291_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jctb.2004.06.001","volume":"93","author":"S Hoory","year":"2005","unstructured":"Hoory S (2005) A lower bound on the spectral radius of the universal cover of a graph. J Combin Theory Ser B 93:33\u201343","journal-title":"J Combin Theory Ser B"},{"key":"3291_CR34","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/JSAC-OCN.2007.021505","volume":"25","author":"I Iliadis","year":"2007","unstructured":"Iliadis I, Chrysos N, Minkenberg C (2007) Performance evaluation of the data vortex photonic switch. IEEE J Sel Areas Commun 25:20\u201335","journal-title":"IEEE J Sel Areas Commun"},{"key":"3291_CR35","doi-asserted-by":"crossref","unstructured":"Jung-hyun S, Hyeongok L, Moon-suk J (2008) Optimal routing and Hamiltonian cycle in Petersen-torus networks, Busan, South Korea, November 2008. IEEE","DOI":"10.1109\/ICCIT.2008.53"},{"key":"3291_CR36","unstructured":"Kar S, Moura JM (2006) Ramanujan topologies for decision making in sensor networks. In: 44th Allerton Conference on Communication, Control, and Computing, Citeseer"},{"key":"3291_CR37","doi-asserted-by":"crossref","unstructured":"Kim J, Dally WJ, Scott S, Abts D (2008) Technology-driven, highly-scalable dragonfly topology. In: 2008 International Symposium on Computer Architecture. IEEE","DOI":"10.1109\/ISCA.2008.19"},{"key":"3291_CR38","unstructured":"Kleinberg J, Rubinfeld R (1996) Short paths in expander graphs. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996). IEEE Computer Society Press, Los Alamitos, CA 1996:86\u201395"},{"key":"3291_CR39","first-page":"557","volume":"309","author":"GF Lawler","year":"1988","unstructured":"Lawler GF, Sokal AD (1988) Bounds on the $$L^2$$ spectrum for Markov chains and Markov processes: a generalization of Cheeger\u2019s inequality. Trans Am Math Soc 309:557\u2013580","journal-title":"Trans Am Math Soc"},{"key":"3291_CR40","volume-title":"Introduction to parallel algorithms and architectures: arrays$$\\cdot $$ trees$$\\cdot $$ hypercubes","author":"FT Leighton","year":"2014","unstructured":"Leighton FT (2014) Introduction to parallel algorithms and architectures: arrays$$\\cdot $$ trees$$\\cdot $$ hypercubes. Elsevier, Amsterdam"},{"key":"3291_CR41","unstructured":"Lenzen C, Wattenhofer R (2016) Clex: yet another supercomputer architecture? arXiv:1607.00298v1"},{"key":"3291_CR42","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky A, Phillips R, Sarnak P (1988) Ramanujan graphs. Combinatorica 8:261\u2013277","journal-title":"Combinatorica"},{"key":"3291_CR43","doi-asserted-by":"crossref","unstructured":"Marcus A, Spielman DA, Srivastava N (2013) Interlacing families I: bipartite ramanujan graphs of all degrees. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE","DOI":"10.1109\/FOCS.2013.63"},{"key":"3291_CR44","doi-asserted-by":"crossref","unstructured":"Marcus AW, Spielman DA, Srivastava N (2015) Interlacing families IV: bipartite Ramanujan graphs of all sizes. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. IEEE","DOI":"10.1109\/FOCS.2015.87"},{"key":"3291_CR45","first-page":"51","volume":"24","author":"GA Margulis","year":"1988","unstructured":"Margulis GA (1988) Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii 24:51\u201360","journal-title":"Problemy peredachi informatsii"},{"key":"3291_CR46","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jctb.1998.1828","volume":"74","author":"BD McKay","year":"1998","unstructured":"McKay BD, Miller M, \u0160ir\u00e1\u0148 J (1998) A note on large graphs of diameter two and given maximum degree. J Comb Theory Ser B 74:110\u2013118","journal-title":"J Comb Theory Ser B"},{"key":"3291_CR47","first-page":"DS14","volume":"1000","author":"M Miller","year":"2005","unstructured":"Miller M, Sir\u00e1n J (2005) Moore graphs and beyond: a survey of the degree\/diameter problem. Eectron J Comb 1000:DS14","journal-title":"Eectron J Comb"},{"key":"3291_CR48","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01789463","volume":"7","author":"B Mohar","year":"1991","unstructured":"Mohar B (1991) Eigenvalues, diameter, and mean distance in graphs. Graphs Comb 7:53\u201364","journal-title":"Graphs Comb"},{"key":"3291_CR49","first-page":"12","volume":"2","author":"B Mohar","year":"1991","unstructured":"Mohar B, Alavi Y, Chartrand G, Oellermann O (1991) The laplacian spectrum of graphs. Graph Theory Comb Appl 2:12","journal-title":"Graph Theory Comb Appl"},{"key":"3291_CR50","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M Morgenstern","year":"1994","unstructured":"Morgenstern M (1994) Existence and explicit constructions of $$q+1$$ regular ramanujan graphs for every prime power $$q$$. J Comb Theory Ser B 62:44\u201362","journal-title":"J Comb Theory Ser B"},{"key":"3291_CR51","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A Nilli","year":"1991","unstructured":"Nilli A (1991) On the second eigenvalue of a graph. Discrete Math 91:207\u2013210","journal-title":"Discrete Math"},{"key":"3291_CR52","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1364\/AO.30.000917","volume":"30","author":"R Paturi","year":"1991","unstructured":"Paturi R, Lu D-T, Ford JE, Esener SC, Lee SH (1991) Parallel algorithms based on expander graphs for optical computing. Appl Opt 30:917","journal-title":"Appl Opt"},{"key":"3291_CR53","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/jmc-2017-0051","volume":"12","author":"EC Pinto","year":"2018","unstructured":"Pinto EC, Petit C (2018) Better path-finding algorithms in LPS Ramanujan graphs. J Math Cryptol 12:191\u2013202","journal-title":"J Math Cryptol"},{"key":"3291_CR54","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"FP Preparata","year":"1981","unstructured":"Preparata FP, Vuillemin J (1981) The cube-connected cycles: a versatile network for parallel computation. Commun ACM 24:300\u2013309","journal-title":"Commun ACM"},{"key":"3291_CR55","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10723-014-9317-4","volume":"13","author":"F Prieto-Castrillo","year":"2014","unstructured":"Prieto-Castrillo F, Astillero A, Bot\u00f3n-Fern\u00e1ndez M (2014) A stochastic process approach to model distributed computing on complex networks. J Grid Comput 13:215\u2013232","journal-title":"J Grid Comput"},{"key":"3291_CR56","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF03342022","volume":"29","author":"C Riess","year":"2012","unstructured":"Riess C, Strehl V, Wanka R (2012) The spectral relation between the cube-connected cycles and the shuffle-exchange network. PARS Parallel Algorithmen Rechnerstrukturen und -Systemsoftware 29:15\u201326","journal-title":"PARS Parallel Algorithmen Rechnerstrukturen und -Systemsoftware"},{"key":"3291_CR57","unstructured":"Sardari NT Complexity of strong approximation on the sphere. arXiv:1703.02709"},{"key":"3291_CR58","doi-asserted-by":"publisher","first-page":"3066","DOI":"10.1109\/JLT.2005.856242","volume":"23","author":"A Shacham","year":"2005","unstructured":"Shacham A, Small B, Liboiron-Ladouceur O, Bergman K (2005) A fully implemented 12 $$\\times $$ 12 data vortex optical packet switching interconnection network. J Lightwave Technol 23:3066\u20133075","journal-title":"J Lightwave Technol"},{"key":"3291_CR59","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair A, Jerrum M (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Inf Comput 82:93\u2013133","journal-title":"Inf Comput"},{"key":"3291_CR60","unstructured":"Singla A, Hong C-Y, Popa L, Godfrey PB (2012) Jellyfish: networking data centers randomly. In: Presented as part of the 9th $$\\{$$USENIX$$\\}$$ Symposium on Networked Systems Design and Implementation ($$\\{$$NSDI$$\\}$$ 12), pp 225\u2013238"},{"key":"3291_CR61","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"RM Tanner","year":"1984","unstructured":"Tanner RM (1984) Explicit concentrators from generalized N-gons. SIAM J Algebraic Discrete Methods 5:287\u2013293","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"3291_CR62","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/147508.147517","volume":"39","author":"E Upfal","year":"1992","unstructured":"Upfal E (1992) An o(log n) deterministic packet-routing scheme. J ACM 39:55\u201370","journal-title":"J ACM"},{"key":"3291_CR63","doi-asserted-by":"crossref","unstructured":"Valadarsky A, Shahaf G, Dinitz M, Schapira M (2016) Xpander: towards optimal-performance datacenters. In: Proceedings of the 12th International on Conference on emerging Networking Experiments and Technologies\u2014CoNEXT \u201916. ACM Press","DOI":"10.1145\/2999572.2999580"},{"key":"3291_CR64","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"key":"3291_CR65","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB et al (1996) Introduction to graph theory, vol 2. Prentice Hall, Upper Saddle River"},{"key":"3291_CR66","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/JLT.2002.800330","volume":"20","author":"Q Yang","year":"2002","unstructured":"Yang Q, Bergman K (2002) Performances of the data vortex switch architecture under nonuniform and bursty traffic. J Lightwave Technol 20:1242\u20131247","journal-title":"J Lightwave Technol"},{"key":"3291_CR67","unstructured":"Young SJ Weighted spectrum of the universal cover and an Alon-Boppana result for the normalized Laplacian. Preprint"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03291-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03291-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03291-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T23:25:22Z","timestamp":1620602722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03291-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,10]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["3291"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03291-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,10]]},"assertion":[{"value":"10 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}