{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:42:03Z","timestamp":1743057723944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_41","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"508-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["De-evolution of Preferential Attachment Trees"],"prefix":"10.1007","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Lotker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"issue":"5439","key":"41_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/270991","volume":"22","author":"SP Borgatti","year":"1992","unstructured":"Borgatti, S.P., Everett, M.G.: Notions of position in social network analysis. Sociol. Methodol. 22, 1\u201335 (1992)","journal-title":"Sociol. Methodol."},{"key":"41_CR3","unstructured":"Bubeck, S., Devroye, L., Lugosi, G.: Finding Adam in random growing trees. arXiv preprint arXiv:1411.3317 (2014)"},{"issue":"1","key":"41_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1137\/0210015","volume":"10","author":"CJ Colbourn","year":"1981","unstructured":"Colbourn, C.J., Booth, K.S.: Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM J. Comput. 10(1), 203\u2013225 (1981)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"41_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0378-8733(85)90013-9","volume":"7","author":"MG Everett","year":"1985","unstructured":"Everett, M.G.: Role similarity and complexity in social networks. Soc. Netw. 7(4), 353\u2013359 (1985)","journal-title":"Soc. Netw."},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0378-8733(88)90011-1","volume":"10","author":"MG Everett","year":"1988","unstructured":"Everett, M.G., Borgatti, S.: Calculating role similarities: an algorithm that helps determine the orbits of a graph. Soc. Netw. 10(1), 77\u201391 (1988)","journal-title":"Soc. Netw."},{"key":"41_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"issue":"5","key":"41_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1002\/asi.4630270505","volume":"27","author":"DDS Price","year":"1976","unstructured":"Price, D.D.S.: A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27(5), 292\u2013306 (1976)","journal-title":"J. Am. Soc. Inf. Sci."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Gionis, A., Prakash, B.A., Vreeken, J.: Reconstructing an epidemic over time. In: KDD 2016, August 13\u201317, San Francisco, CA, USA (2016)","DOI":"10.1145\/2939672.2939865"},{"issue":"8","key":"41_CR10","doi-asserted-by":"publisher","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","volume":"57","author":"D Shah","year":"2011","unstructured":"Shah, D., Zaman, T.: Rumors in a network: who\u2019s the culprit? IEEE Trans. Inf. Theory 57(8), 5163\u20135181 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"41_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0378-8733(88)90013-5","volume":"10","author":"C Winship","year":"1988","unstructured":"Winship, C.: Thoughts about roles and relations: an old document revisited. Soc. Netw. 10(3), 209\u2013231 (1988)","journal-title":"Soc. Netw."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:45:02Z","timestamp":1609800302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_41","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}