{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:33:37Z","timestamp":1770222817188,"version":"3.49.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030372279","type":"print"},{"value":"9783030372286","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-37228-6_14","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T05:00:05Z","timestamp":1576472405000},"page":"278-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Topology-Aware Hashing for Effective Control Flow Graph Similarity Analysis"],"prefix":"10.1007","author":[{"given":"Yuping","family":"Li","sequence":"first","affiliation":[]},{"given":"Jiyong","family":"Jang","sequence":"additional","affiliation":[]},{"given":"Xinming","family":"Ou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., Smola, A.J.: Distributed large-scale natural graph factorization. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 37\u201348. ACM (2013)","DOI":"10.1145\/2488388.2488393"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Alazab, M., Venkataraman, S., Watters, P.: Towards understanding malware behaviour by the extraction of API calls. In: 2010 Second Cybercrime and Trustworthy Computing Workshop (CTC), pp. 52\u201359. IEEE (2010)","DOI":"10.1109\/CTC.2010.8"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bourquin, M., King, A., Robbins, E.: BinSlayer: accurate comparison of binary executables. In: Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop, Rome, Italy, p. 4. ACM (2013)","DOI":"10.1145\/2430553.2430557"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Canfora, G., De\u00a0Lorenzo, A., Medvet, E., Mercaldo, F., Visaggio, C.A.: Effectiveness of Opcode ngrams for detection of multi family android malware. In: 2015 10th International Conference on Availability, Reliability and Security (ARES), Toulouse, France, pp.\u00a0333\u2013340. IEEE, IEEE Computer Society (2015)","DOI":"10.1109\/ARES.2015.57"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: Deep neural networks for learning graph representations. In: AAAI, pp.\u00a01145\u20131152 (2016)","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cesare, S., Xiang, Y.: Malware variant detection using similarity search over sets of control flow graphs. In: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, pp.\u00a0181\u2013189. IEEE, IEEE Computer Society (2011)","DOI":"10.1109\/TrustCom.2011.26"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chan, P.P., Collberg, C.: A method to evaluate CFG comparison algorithms. In: 2014 14th International Conference on Quality Software (QSIC), Washington, DC, USA, pp.\u00a095\u2013104. IEEE, IEEE Computer Society (2014)","DOI":"10.1109\/QSIC.2014.28"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388. ACM (2002)","DOI":"10.1145\/509907.509965"},{"key":"14_CR9","unstructured":"Virustotal (2018). https:\/\/www.virustotal.com"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262. ACM (2004)","DOI":"10.1145\/997817.997857"},{"key":"14_CR11","first-page":"1","volume":"5","author":"T Dullien","year":"2005","unstructured":"Dullien, T., Rolles, R.: Graph-based comparison of executable objects (English version). SSTIC 5, 1\u20133 (2005)","journal-title":"SSTIC"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Eschweiler, S., Yakdan, K., Gerhards-Padilla, E.: discovRE: efficient cross-architecture identification of bugs in binary code. In: Proceedings of the 2016 Network and Distributed System Security (NDSS) Symposium, San Diego, CA, USA. The Internet Society (2016)","DOI":"10.14722\/ndss.2016.23185"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Feng, Q., Zhou, R., Xu, C., Cheng, Y., Testa, B., Yin, H.: Scalable graph-based bug search for firmware images. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, pp. 480\u2013491. ACM (2016)","DOI":"10.1145\/2976749.2978370"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1021\/ci00019a008","volume":"34","author":"J Galvez","year":"1994","unstructured":"Galvez, J., Garcia, R., Salabert, M., Soler, R.: Charge indexes. New topological descriptors. J. Chem. Inf. Comput. Sci. 34(3), 520\u2013525 (1994)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-88625-9_16","volume-title":"Information and Communications Security","author":"D Gao","year":"2008","unstructured":"Gao, D., Reiter, M.K., Song, D.: BinHunt: automatically finding semantic differences in binary programs. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 238\u2013255. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88625-9_16"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. ACM SIGKDD Explor. Newsl. 5(1), 49\u201358 (2003)","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1145\/376284.375689","volume":"30","author":"A Gionis","year":"2001","unstructured":"Gionis, A., Gunopulos, D., Koudas, N.: Efficient and tumble similar set retrieval. ACM SIGMOD Rec. 30(2), 247\u2013258 (2001)","journal-title":"ACM SIGMOD Rec."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowl. Based Syst. 151, 78\u201394 (2018)","journal-title":"Knowl. Based Syst."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-87403-4_6","volume-title":"Recent Advances in Intrusion Detection","author":"F Guo","year":"2008","unstructured":"Guo, F., Ferrie, P., Chiueh, T.: A study of the packer problem and its solutions. In: Lippmann, R., Kirda, E., Trachtenberg, A. (eds.) RAID 2008. LNCS, vol. 5230, pp. 98\u2013115. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87403-4_6"},{"issue":"22","key":"14_CR20","doi-asserted-by":"publisher","first-page":"3256","DOI":"10.1039\/b409865j","volume":"2","author":"J Hert","year":"2004","unstructured":"Hert, J., et al.: Comparison of topological descriptors for similarity-based virtual screening using multiple bioactive reference structures. Org. Biomol. Chem. 2(22), 3256\u20133266 (2004)","journal-title":"Org. Biomol. Chem."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Hu, X., Chiueh, T.-C., Shin, K.G.: Large-scale malware indexing using function-call graphs. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, Chicago, Illinois, USA, pp. 611\u2013620. ACM (2009)","DOI":"10.1145\/1653662.1653736"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Hu, X., Shin, K.G.: DUET: integration of dynamic and static analyses for malware clustering with cluster ensembles. In: Proceedings of the 29th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, pp. 79\u201388. ACM (2013)","DOI":"10.1145\/2523649.2523677"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Jang, J., Brumley, D., Venkataraman, S.: BitShred: feature hashing malware for scalable triage and semantic analysis. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, Chicago, Illinois, USA, pp. 309\u2013320. ACM (2011)","DOI":"10.1145\/2046707.2046742"},{"key":"14_CR24","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"14_CR25","unstructured":"Kondor, R., Pan, H.: The multiscale Laplacian graph kernel. In: Advances in Neural Information Processing Systems, pp.\u00a02990\u20132998 (2016)"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","volume":"3","author":"J Kornblum","year":"2006","unstructured":"Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing. Digit. Investig. 3, 91\u201397 (2006)","journal-title":"Digit. Investig."},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11663812_11","volume-title":"Recent Advances in Intrusion Detection","author":"C Kruegel","year":"2006","unstructured":"Kruegel, C., Kirda, E., Mutz, D., Robertson, W., Vigna, G.: Polymorphic worm detection using structural information of executables. In: Valdes, A., Zamboni, D. (eds.) RAID 2005. LNCS, vol. 3858, pp. 207\u2013226. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11663812_11"},{"issue":"1\u20132","key":"14_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. (NRL) 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"14_CR29","unstructured":"Li, Y., et al.: Experimental study of fuzzy hashing in malware clustering analysis. In: 8th Workshop on Cyber Security Experimentation and Test, CSET 2015, vol. 5, p. 52. USENIX Association (2015)"},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Exp. 12(1), 23\u201334 (1982)","journal-title":"Softw. Pract. Exp."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-37682-5_8","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"J Ming","year":"2013","unstructured":"Ming, J., Pan, M., Gao, D.: iBinHunt: binary hunting with inter-procedural control flow. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 92\u2013109. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_8"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-89900-6_21","volume-title":"Intelligence and Security Informatics","author":"R Moskovitch","year":"2008","unstructured":"Moskovitch, R., et al.: Unknown malcode detection using OPCODE representation. In: Ortiz-Arroyo, D., Larsen, H.L., Zeng, D.D., Hicks, D., Wagner, G. (eds.) EuroIsI 2008. LNCS, vol. 5376, pp. 204\u2013215. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89900-6_21"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Myles, G., Collberg, C.: K-gram based software birthmarks. In: Proceedings of the 2005 ACM Symposium on Applied Computing, Santa Fe, New Mexico, USA, pp. 314\u2013318. ACM (2005)","DOI":"10.1145\/1066677.1066753"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1105\u20131114. ACM (2016)","DOI":"10.1145\/2939672.2939751"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-41284-4_8","volume-title":"Research in Attacks, Intrusions, and Defenses","author":"MZ Rafique","year":"2013","unstructured":"Rafique, M.Z., Caballero, J.: FIRMA: malware clustering and network signature generation with mixed network behaviors. In: Stolfo, S.J., Stavrou, A., Wright, C.V. (eds.) RAID 2013. LNCS, vol. 8145, pp. 144\u2013163. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41284-4_8"},{"key":"14_CR36","first-page":"23","volume":"9","author":"K Rieck","year":"2008","unstructured":"Rieck, K., Laskov, P.: Linear-time computation of similarity measures for sequential data. J. Mach. Learn. Res. 9, 23\u201348 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"14_CR37","doi-asserted-by":"publisher","first-page":"639","DOI":"10.3233\/JCS-2010-0410","volume":"19","author":"K Rieck","year":"2011","unstructured":"Rieck, K., Trinius, P., Willems, C., Holz, T.: Automatic analysis of malware behavior using machine learning. J. Comput. Secur. 19(4), 639\u2013668 (2011)","journal-title":"J. Comput. Secur."},{"key":"14_CR38","unstructured":"Roberts, J.: VirusShare.com (2015). http:\/\/virusshare.com\/"},{"issue":"1","key":"14_CR39","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.istr.2009.03.003","volume":"14","author":"A Shabtai","year":"2009","unstructured":"Shabtai, A., Moskovitch, R., Elovici, Y., Glezer, C.: Detection of malicious code by applying machine learning classifiers on static features: a state-of-the-art survey. Inf. Secur. Tech. Rep. 14(1), 16\u201329 (2009)","journal-title":"Inf. Secur. Tech. Rep."},{"key":"14_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, New York (2004)"},{"key":"14_CR41","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/11691372_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Sokolsky","year":"2006","unstructured":"Sokolsky, O., Kannan, S., Lee, I.: Simulation-based graph similarity. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 426\u2013440. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_28"},{"key":"14_CR43","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"14_CR44","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.infsof.2012.12.005","volume":"55","author":"M Vujo\u0161evi\u0107-Jani\u010di\u0107","year":"2013","unstructured":"Vujo\u0161evi\u0107-Jani\u010di\u0107, M., Nikoli\u0107, M., To\u0161i\u0107, D., Kuncak, V.: Software verification and graph similarity for automated evaluation of students\u2019 assignments. Inf. Softw. Technol. 55(6), 1004\u20131016 (2013)","journal-title":"Inf. Softw. Technol."},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225\u20131234. ACM (2016)","DOI":"10.1145\/2939672.2939753"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Xu, X., Liu, C., Feng, Q., Yin, H., Song, L., Song, D.: Neural network-based graph embedding for cross-platform binary code similarity detection. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 363\u2013376. ACM (2017)","DOI":"10.1145\/3133956.3134018"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37228-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T11:08:26Z","timestamp":1665227306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37228-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030372279","9783030372286"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37228-6_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orlando, VA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/securecomm.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}