{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:00Z","timestamp":1750220520819,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"Autumn","license":[{"start":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T00:00:00Z","timestamp":1606176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGWEB Newsl."],"published-print":{"date-parts":[[2020,11,24]]},"abstract":"<jats:p>\n            The ACM A.M. Turing Award is commonly acknowledged as the highest distinction in the realm of computer science. Since 1960s, it has been awarded to computer scientists who made outstanding contributions. The significance of this award is far-reaching to the laureates as well as their research teams. However, unlike the Nobel Prize that has been extensively investigated, little research has been done to explore this most important award. To this end, we propose the Turing Number (\n            <jats:italic>TN<\/jats:italic>\n            ) index to measure how far a specific scholar is to this award. Inspired by previous works on Erdos Number and Bacon Number, this index is defined as the shortest path between a given scholar to any Turing Award Laureate. Experimental results suggest that\n            <jats:italic>TN<\/jats:italic>\n            can reflect the closeness of collaboration between scholars and Turing Award Laureates. With the correlation analysis between\n            <jats:italic>TN<\/jats:italic>\n            and metrics from the bibliometric-level and network-level, we demonstrate that\n            <jats:italic>TN<\/jats:italic>\n            has the potential of reflecting a scholar's academic influence and reputation.\n          <\/jats:p>","DOI":"10.1145\/3427478.3427483","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T19:56:25Z","timestamp":1606420585000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Turing number"],"prefix":"10.1145","volume":"2020","author":[{"given":"Feng","family":"Xia","sequence":"first","affiliation":[{"name":"Dalian University of Technology, China and Federation University Australia, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaying","family":"Liu","sequence":"additional","affiliation":[{"name":"Dalian University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Ren","sequence":"additional","affiliation":[{"name":"Dalian University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Macau, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangjie","family":"Kong","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3007709"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si A.-L. and Albert R. 1999. Emergence of scaling in random networks. Science 286 5439 509--512.  Barab\u00e1si A.-L. and Albert R. 1999. Emergence of scaling in random networks. Science 286 5439 509--512.","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/3122790","article-title":"Turing laureates celebrate award's 50 th anniversary","volume":"60","author":"Fisher L. M.","year":"2017","unstructured":"Fisher , L. M. 2017 . Turing laureates celebrate award's 50 th anniversary . Communications of the ACM 60 , 9, 20 -- 23 . Fisher, L. M. 2017. Turing laureates celebrate award's 50 th anniversary. Communications of the ACM 60, 9, 20--23.","journal-title":"Communications of the ACM"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.278701"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033604"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2950445"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Kong X. Zhang J. Zhang D. Bu Y. Ding Y. and Xia F. 2020. The gene of scientific success. ACM Transactions on Knowledge Discovery from Data (TKDD) 14 4 1--19.  Kong X. Zhang J. Zhang D. Bu Y. Ding Y. and Xia F. 2020. The gene of scientific success. ACM Transactions on Knowledge Discovery from Data (TKDD) 14 4 1--19.","DOI":"10.1145\/3385530"},{"volume-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 2153--2156","author":"Liu J.","key":"e_1_2_1_9_1","unstructured":"Liu , J. , Ren , J. , Zheng , W. , Chi , L. , Lee , I. , and Xia , F . 2020. Web of scholars: A scholar knowledge graph . In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 2153--2156 . Liu, J., Ren, J., Zheng, W., Chi, L., Lee, I., and Xia, F. 2020. Web of scholars: A scholar knowledge graph. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 2153--2156."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2946825"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Phillips N. 2017. A close look at china's rise. Nature 545 7655 S39.  Phillips N. 2017. A close look at china's rise. Nature 545 7655 S39.","DOI":"10.1038\/545S39a"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958649"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1108\/00220411111145007"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-016-2059-2"},{"key":"e_1_2_1_17_1","volume-title":"-L","author":"Sinatra R.","year":"2016","unstructured":"Sinatra , R. , Wang , D. , Deville , P. , Song , C. , and Barab\u00e1si , A . -L . 2016 . Quantifying the evolution of individual scientific impact. Science 354, 6312, aaf5239. Sinatra, R., Wang, D., Deville, P., Song, C., and Barab\u00e1si, A.-L. 2016. Quantifying the evolution of individual scientific impact. Science 354, 6312, aaf5239."},{"volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 990--998","author":"Tang J.","key":"e_1_2_1_18_1","unstructured":"Tang , J. , Zhang , J. , Yao , L. , Li , J. , Zhang , L. , and Su , Z . 2008. Arnetminer: extraction and mining of academic social networks . In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 990--998 . Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., and Su, Z. 2008. Arnetminer: extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 990--998."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Watts D. J. and Strogatz S. H. 1998. Collective dynamics of `small-world' networks. Nature 393 6684 440--442.  Watts D. J. and Strogatz S. H. 1998. Collective dynamics of `small-world' networks. Nature 393 6684 440--442.","DOI":"10.1038\/30918"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Zhang J. Wang W. Xia F. Lin Y.-R. and Tong H. 2020. Data-driven computational social science: A survey. Big Data Research 100145.  Zhang J. Wang W. Xia F. Lin Y.-R. and Tong H. 2020. Data-driven computational social science: A survey. Big Data Research 100145.","DOI":"10.1016\/j.bdr.2020.100145"}],"container-title":["ACM SIGWEB Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427478.3427483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427478.3427483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:40Z","timestamp":1750195480000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427478.3427483"}},"subtitle":["how far are you to A. M. Turing award?"],"short-title":[],"issued":{"date-parts":[[2020,11,24]]},"references-count":20,"journal-issue":{"issue":"Autumn","published-print":{"date-parts":[[2020,11,24]]}},"alternative-id":["10.1145\/3427478.3427483"],"URL":"https:\/\/doi.org\/10.1145\/3427478.3427483","relation":{},"ISSN":["1931-1745","1931-1435"],"issn-type":[{"type":"print","value":"1931-1745"},{"type":"electronic","value":"1931-1435"}],"subject":[],"published":{"date-parts":[[2020,11,24]]},"assertion":[{"value":"2020-11-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}