{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:30Z","timestamp":1740108270833,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:00:00Z","timestamp":1717804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["CONICYT-PCHA\/Doctorado Nacional\/2016-21161085"],"award-info":[{"award-number":["CONICYT-PCHA\/Doctorado Nacional\/2016-21161085"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Center for Artificial Intelligence CENIA","award":["FB210017, Basal ANID"],"award-info":[{"award-number":["FB210017, Basal ANID"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00607-024-01303-z","type":"journal-article","created":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T21:01:22Z","timestamp":1717880482000},"page":"2675-2705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quickcent: a fast and frugal heuristic for harmonic centrality estimation on scale-free networks"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2991-4263","authenticated-orcid":false,"given":"Francisco","family":"Plana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Abeliuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,8]]},"reference":[{"issue":"4157","key":"1303_CR1","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1126\/science.185.4157.1124","volume":"185","author":"A Tversky","year":"1974","unstructured":"Tversky A, Kahneman D (1974) Judgment under uncertainty: heuristics and biases: biases in judgments reveal some heuristics of thinking under uncertainty. Science 185(4157):1124\u20131131","journal-title":"Science"},{"key":"1303_CR2","volume-title":"Simple heuristics that make us smart","author":"Gigerenzer, G., Todd, P.M., Group, A.R.","year":"1999","unstructured":"Gigerenzer, G., Todd, P.M., Group, A.R. (1999) Simple heuristics that make us smart. Oxford UP, New York"},{"issue":"4","key":"1303_CR3","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1037\/a0020418","volume":"117","author":"KV Katsikopoulos","year":"2010","unstructured":"Katsikopoulos KV, Schooler LJ, Hertwig R (2010) The robust beauty of ordinary information. Psychol Rev 117(4):1259","journal-title":"Psychol Rev"},{"issue":"1","key":"1303_CR4","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1177\/0272989X08326091","volume":"29","author":"LG Backlund","year":"2009","unstructured":"Backlund LG, Bring J, Sk\u00e5n\u00e9r Y, Strender L-E, Montgomery H (2009) Improving fast and frugal modeling in relation to regression analysis: test of 3 models for medical decision making. Med Decis Making 29(1):140\u2013148","journal-title":"Med Decis Making"},{"issue":"3","key":"1303_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.ijforecast.2007.05.006","volume":"23","author":"B Scheibehenne","year":"2007","unstructured":"Scheibehenne B, Br\u00f6der A (2007) Predicting wimbledon 2005 tennis results by mere player name recognition. Int J Forecast 23(3):415\u2013426","journal-title":"Int J Forecast"},{"issue":"1","key":"1303_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10940-004-1785-4","volume":"21","author":"B Snook","year":"2005","unstructured":"Snook B, Zito M, Bennell C, Taylor PJ (2005) On the complexity and accuracy of geographic profiling strategies. J Quant Criminol 21(1):1\u201326","journal-title":"J Quant Criminol"},{"key":"1303_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"issue":"3","key":"1303_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.032812","volume":"90","author":"GF De Arruda","year":"2014","unstructured":"De Arruda GF, Barbieri AL, Rodriguez PM, Rodrigues FA, Moreno Y, da Fontoura Costa L (2014) Role of centrality for the identification of influential spreaders in complex networks. Phys Rev E 90(3):032812","journal-title":"Phys Rev E"},{"issue":"1","key":"1303_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s13278-022-01012-5","volume":"13","author":"BR Sziklai","year":"2022","unstructured":"Sziklai BR, Lengyel B (2022) Finding early adopters of innovation in social networks. Soc Netw Anal Min 13(1):4","journal-title":"Soc Netw Anal Min"},{"issue":"8","key":"1303_CR10","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.clinph.2013.11.036","volume":"125","author":"GF de Arruda","year":"2014","unstructured":"de Arruda GF, da Fontoura Costa L, Schubert D, Rodrigues FA (2014) Structure and dynamics of functional networks in child-onset schizophrenia. Clin Neurophysiol 125(8):1589\u20131595","journal-title":"Clin Neurophysiol"},{"issue":"3\u20134","key":"1303_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"Marchiori M, Latora V (2000) Harmony in the small-world. Physica A 285(3\u20134):539\u2013546","journal-title":"Physica A"},{"issue":"3\u20134","key":"1303_CR12","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi P, Vigna S (2014) Axioms for centrality. Internet Math 10(3\u20134):222\u2013262","journal-title":"Internet Math"},{"key":"1303_CR13","unstructured":"Pettie S, Ramachandran V (2002) Computing shortest paths with comparisons and additions. In: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, pp 267\u2013276"},{"key":"1303_CR14","doi-asserted-by":"crossref","unstructured":"Pettie S (2002) On the comparison-addition complexity of all-pairs shortest paths. In: International symposium on algorithms and computation. Springer, pp 32\u201343","DOI":"10.1007\/3-540-36136-7_4"},{"key":"1303_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1613\/jair.3509","volume":"43","author":"LR Planken","year":"2012","unstructured":"Planken LR, de Weerdt MM, van der Krogt RP (2012) Computing all-pairs shortest paths by leveraging low treewidth. J Artif Intell Res 43:353\u2013388","journal-title":"J Artif Intell Res"},{"key":"1303_CR16","doi-asserted-by":"crossref","unstructured":"Hertwig R, Hoffrage U, Martignon L (1999) Quick estimation: letting the environment do the work. In: Simple heuristics that make us smart. Oxford University Press, pp 209\u2013234","DOI":"10.1037\/e683302011-118"},{"issue":"5","key":"1303_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) Power laws, pareto distributions and zipf\u2019s law. Contemp Phys 46(5):323\u2013351","journal-title":"Contemp Phys"},{"key":"1303_CR18","doi-asserted-by":"crossref","unstructured":"Plana F, P\u00e9rez J (2018) Quickcent: a fast and frugal heuristic for centrality estimation on networks. In: 2018 IEEE\/WIC\/ACM international conference on web intelligence (WI). IEEE, pp 238\u2013245","DOI":"10.1109\/WI.2018.00-84"},{"key":"1303_CR19","doi-asserted-by":"crossref","unstructured":"Saxena A, Gera R, Iyengar S (2017) Fast estimation of closeness centrality ranking. In: Proceedings of the 2017 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 80\u201385","DOI":"10.1145\/3110025.3110064"},{"issue":"1","key":"1303_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13278-018-0545-7","volume":"9","author":"A Saxena","year":"2019","unstructured":"Saxena A, Gera R, Iyengar S (2019) A heuristic approach to estimate nodes\u2019 closeness rank using the properties of real world networks. Soc Netw Anal Min 9(1):3","journal-title":"Soc Netw Anal Min"},{"key":"1303_CR21","unstructured":"Saxena A, Malik V, Iyengar S (2015) Rank me thou shalln\u2019t compare me. arXiv:1511.09050"},{"key":"1303_CR22","doi-asserted-by":"crossref","unstructured":"Saxena A, Malik V, Iyengar S (2015) Estimating the degree centrality ranking of a node. arXiv:1511.05732","DOI":"10.1109\/COMSNETS.2016.7440022"},{"key":"1303_CR23","doi-asserted-by":"crossref","unstructured":"Rattigan MJ, Maier M, Jensen D (2006) Using structure indices for efficient approximation of network properties. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 357\u2013366","DOI":"10.1145\/1150402.1150443"},{"key":"1303_CR24","doi-asserted-by":"crossref","unstructured":"Pfeffer J, Carley KM (2012) k-centralities: local approximations of global measures based on shortest paths. In: Proceedings of the 21st international conference on world wide web, pp 1043\u20131050","DOI":"10.1145\/2187980.2188239"},{"key":"1303_CR25","unstructured":"Eppstein D, Wang, J (2001) Fast approximation of centrality. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 228\u2013229"},{"issue":"07","key":"1303_CR26","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes U, Pich C (2007) Centrality estimation in large networks. Int J Bifurc Chaos 17(07):2303\u20132318","journal-title":"Int J Bifurc Chaos"},{"key":"1303_CR27","doi-asserted-by":"crossref","unstructured":"Chan SY, Leung IX, Li\u00f2 P (2009) Fast centrality approximation in modular networks. In: Proceedings of the 1st ACM international workshop on complex networks meet information & knowledge management. ACM, pp 31\u201338","DOI":"10.1145\/1651274.1651282"},{"key":"1303_CR28","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Computing classic closeness centrality, at scale. In: Proceedings of the second ACM conference on online social networks, pp 37\u201350","DOI":"10.1145\/2660460.2660465"},{"key":"1303_CR29","unstructured":"Chechik S, Cohen E, Kaplan H (2015) Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees. arXiv:1503.08528"},{"issue":"5439","key":"1303_CR30","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"4","key":"1303_CR31","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1209\/epl\/i2003-00166-9","volume":"61","author":"H Jeong","year":"2003","unstructured":"Jeong H, N\u00e9da Z, Barab\u00e1si A-L (2003) Measuring preferential attachment in evolving networks. EPL (Europhys Lett) 61(4):567","journal-title":"EPL (Europhys Lett)"},{"issue":"5","key":"1303_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.056104","volume":"67","author":"A V\u00e1zquez","year":"2003","unstructured":"V\u00e1zquez A (2003) Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. Phys Rev E 67(5):056104","journal-title":"Phys Rev E"},{"issue":"2","key":"1303_CR33","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00607-021-00960-8","volume":"104","author":"S Kumar","year":"2022","unstructured":"Kumar S, Lohia D, Pratap D, Krishna A, Panda B (2022) Mder: modified degree with exclusion ratio algorithm for influence maximisation in social networks. Computing 104(2):359\u2013382","journal-title":"Computing"},{"key":"1303_CR34","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"101","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101:1711\u20131733","journal-title":"Computing"},{"issue":"3","key":"1303_CR35","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1017\/S1930297500002412","volume":"3","author":"A Br\u00f6der","year":"2008","unstructured":"Br\u00f6der A, Newell B (2008) Challenging some common beliefs: empirical work within the adaptive toolbox metaphor. Judgm Decis Mak 3(3):205","journal-title":"Judgm Decis Mak"},{"issue":"1","key":"1303_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-08746-5","volume":"10","author":"AD Broido","year":"2019","unstructured":"Broido AD, Clauset A (2019) Scale-free networks are rare. Nat Commun 10(1):1\u201310","journal-title":"Nat Commun"},{"key":"1303_CR37","unstructured":"Barab\u00e1si A-L (2018) Love is all you need: Clauset\u2019s fruitless search for scale-free networks. Blog post available at https:\/\/www. barabasilab.com\/post\/love-is-all-you-need 20"},{"issue":"21","key":"1303_CR38","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1103\/PhysRevLett.85.4629","volume":"85","author":"PL Krapivsky","year":"2000","unstructured":"Krapivsky PL, Redner S, Leyvraz F (2000) Connectivity of growing random networks. Phys Rev Lett 85(21):4629","journal-title":"Phys Rev Lett"},{"issue":"4","key":"1303_CR39","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703","journal-title":"SIAM Rev"},{"issue":"1","key":"1303_CR40","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1177\/0022002706296157","volume":"51","author":"A Clauset","year":"2007","unstructured":"Clauset A, Young M, Gleditsch KS (2007) On the frequency of severe terrorist events. J Conflict Resolut 51(1):58\u201387","journal-title":"J Conflict Resolut"},{"issue":"2","key":"1303_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v064.i02","volume":"64","author":"CS Gillespie","year":"2015","unstructured":"Gillespie CS (2015) Fitting heavy tailed distributions: the poweRlaw package. J Stat Softw 64(2):1\u201316","journal-title":"J Stat Softw"},{"issue":"1","key":"1303_CR42","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1137\/19M1260463","volume":"2","author":"H Drees","year":"2020","unstructured":"Drees H, Jan\u00dfen A, Resnick SI, Wang T (2020) On a minimum distance procedure for threshold selection in tail analysis. SIAM J Math Data Sci 2(1):75\u2013102","journal-title":"SIAM J Math Data Sci"},{"issue":"3","key":"1303_CR43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.1.033034","volume":"1","author":"I Voitalov","year":"2019","unstructured":"Voitalov I, van der Hoorn P, van der Hofstad R, Krioukov D (2019) Scale-free networks well done. Phys Rev Res 1(3):033034","journal-title":"Phys Rev Res"},{"key":"1303_CR44","doi-asserted-by":"publisher","unstructured":"Hosseini R (2010) Quantiles equivariance. https:\/\/doi.org\/10.48550\/arXiv.1004.0533","DOI":"10.48550\/arXiv.1004.0533"},{"issue":"1","key":"1303_CR45","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1037\/0096-3445.137.1.73","volume":"137","author":"B von Helversen","year":"2008","unstructured":"von Helversen B, Rieskamp J (2008) The mapping model: a cognitive theory of quantitative estimation. J Exp Psychol Gen 137(1):73","journal-title":"J Exp Psychol Gen"},{"key":"1303_CR46","doi-asserted-by":"publisher","unstructured":"Plana F (2024) Quickcent paper data and code figshare. https:\/\/doi.org\/10.6084\/m9.figshare.25055234","DOI":"10.6084\/m9.figshare.25055234"},{"key":"1303_CR47","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning, 1st edn. Springer, New York","edition":"1"},{"key":"1303_CR48","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2020). R Foundation for Statistical Computing. https:\/\/www.R-project.org\/"},{"key":"1303_CR49","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi G, Nepusz T (2006) The igraph software. Complex Syst 1695:1\u20139","journal-title":"Complex Syst"},{"key":"1303_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98141-3","volume-title":"Ggplot2: elegant graphics for data analysis","author":"H Wickham","year":"2009","unstructured":"Wickham H (2009) Ggplot2: elegant graphics for data analysis. Springer, New York"},{"key":"1303_CR51","unstructured":"Quinlan JR, et al. (1992) Learning with continuous classes. In: 5th Australian joint conference on artificial intelligence, vol 92. Singapore, pp 343\u2013348"},{"key":"1303_CR52","volume-title":"Data mining: practical machine learning tools and techniques","author":"IH Witten","year":"2005","unstructured":"Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco","edition":"2"},{"key":"1303_CR53","volume-title":"Parallel distributed processing","author":"DE Rumelhart","year":"1988","unstructured":"Rumelhart DE, McClelland JL, Group PR et al (1988) Parallel distributed processing, vol 1. MIT Press, Cambridge"},{"issue":"2","key":"1303_CR54","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00180-008-0119-7","volume":"24","author":"K Hornik","year":"2009","unstructured":"Hornik K, Buchta C, Zeileis A (2009) Open-source machine learning: R meets Weka. Comput Stat 24(2):225\u2013232. https:\/\/doi.org\/10.1007\/s00180-008-0119-7","journal-title":"Comput Stat"},{"issue":"8","key":"1303_CR55","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1016\/j.jbusres.2015.01.061","volume":"68","author":"H Brighton","year":"2015","unstructured":"Brighton H, Gigerenzer G (2015) The bias bias. J Bus Res 68(8):1772\u20131784","journal-title":"J Bus Res"},{"key":"1303_CR56","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge","edition":"2"},{"issue":"5569","key":"1303_CR57","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1126\/science.1065103","volume":"296","author":"S Maslov","year":"2002","unstructured":"Maslov S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296(5569):910\u2013913","journal-title":"Science"},{"key":"1303_CR58","doi-asserted-by":"crossref","unstructured":"Li L, Alderson D, Willinger W, Doyle J (2004) A first-principles approach to understanding the internet\u2019s router-level topology. In: ACM SIGCOMM computer communication review, vol 34. ACM, pp 3\u201314","DOI":"10.1145\/1030194.1015470"},{"key":"1303_CR59","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.physa.2015.03.074","volume":"433","author":"L Zhang","year":"2015","unstructured":"Zhang L, Small M, Judd K (2015) Exactly scale-free scale-free networks. Physica A 433:182\u2013197","journal-title":"Physica A"},{"key":"1303_CR60","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs, i. Publicationes Mathematicae (Debrecen) 6:290\u2013297","journal-title":"Publicationes Mathematicae (Debrecen)"},{"issue":"1","key":"1303_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(81)90253-3","volume":"33","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s B (1981) Degree sequences of random graphs. Discret Math 33(1):1\u201319","journal-title":"Discret Math"},{"issue":"1","key":"1303_CR62","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/rsa.3240010106","volume":"1","author":"RM Karp","year":"1990","unstructured":"Karp RM (1990) The transitive closure of a random digraph. Random Struct Algorithms 1(1):73\u201393","journal-title":"Random Struct Algorithms"},{"key":"1303_CR63","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"1303_CR64","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd international workshop on link discovery, pp 36\u201343","DOI":"10.1145\/1134271.1134277"},{"key":"1303_CR65","doi-asserted-by":"crossref","unstructured":"\u0160ubelj L, Bajec M (2012) Software systems through complex networks science: review, analysis and applications. In: Proceedings of the first international workshop on software mining, pp 9\u201316","DOI":"10.1145\/2384416.2384418"},{"issue":"2\u20133","key":"1303_CR66","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2007.10129293","volume":"4","author":"N Litvak","year":"2007","unstructured":"Litvak N, Scheinhardt WR, Volkovich Y (2007) In-degree and pagerank: why do they follow similar power laws? Internet Math 4(2\u20133):175\u2013198","journal-title":"Internet Math"},{"issue":"3","key":"1303_CR67","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1257\/aer.97.3.890","volume":"97","author":"MO Jackson","year":"2007","unstructured":"Jackson MO, Rogers BW (2007) Meeting strangers and friends of friends: how random are social networks? Am Econ Rev 97(3):890\u2013915","journal-title":"Am Econ Rev"},{"issue":"3","key":"1303_CR68","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov D, Papadopoulos F, Kitsak M, Vahdat A, Bogun\u00e1 M (2010) Hyperbolic geometry of complex networks. Phys Rev E 82(3):036106","journal-title":"Phys Rev E"},{"issue":"4","key":"1303_CR69","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.046141","volume":"71","author":"T Zhou","year":"2005","unstructured":"Zhou T, Yan G, Wang B-H (2005) Maximal planar networks with large clustering coefficient and power-law degree distribution. Phys Rev E 71(4):046141","journal-title":"Phys Rev E"},{"issue":"23","key":"1303_CR70","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.238701","volume":"88","author":"JP Doye","year":"2002","unstructured":"Doye JP (2002) Network topology of a potential energy landscape: a static scale-free network. Phys Rev Lett 88(23):238701","journal-title":"Phys Rev Lett"},{"issue":"December","key":"1303_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2555235.2555237","volume":"2013","author":"DH Wolpert","year":"2013","unstructured":"Wolpert DH (2013) Ubiquity symposium: evolutionary computation and the processes of life: what the no free lunch theorems really mean: how to improve search algorithms. Ubiquity 2013(December):1\u201315","journal-title":"Ubiquity"},{"issue":"6","key":"1303_CR72","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1109\/18.720541","volume":"44","author":"RM Gray","year":"1998","unstructured":"Gray RM, Neuhoff DL (1998) Quantization. IEEE Trans Inf Theory 44(6):2325\u20132383","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01303-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-024-01303-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01303-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T14:19:58Z","timestamp":1721312398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-024-01303-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,8]]},"references-count":72,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1303"],"URL":"https:\/\/doi.org\/10.1007\/s00607-024-01303-z","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2024,6,8]]},"assertion":[{"value":"14 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}