{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:10:20Z","timestamp":1757311820200,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030780852"},{"type":"electronic","value":"9783030780869"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-78086-9_3","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:45:53Z","timestamp":1625100353000},"page":"38-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Privacy-Preserving Coupling of\u00a0Vertically-Partitioned Databases and\u00a0Subsequent Training with Gradient Descent"],"prefix":"10.1007","author":[{"given":"Thijs","family":"Veugen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Kamphorst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasja","family":"van de L\u2019Isle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie Beth","family":"van Egmond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Akavia, A., Shaul, H., Weiss, M., Yakhini, Z.: Linear-regression on packed encrypted data in the two-server model. In: Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC 2019, pp. 21\u201332. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3338469.3358942","DOI":"10.1145\/3338469.3358942"},{"key":"3_CR2","unstructured":"Blom, F., Bouman, N., Schoenmakers, B., Vreede, N.: Efficient Secure Ridge Regression from Randomized Gaussian Elimination. IACR Cryptology ePrint Archive (2019)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TDSC.2016.2587623","volume":"15","author":"D Bogdanov","year":"2018","unstructured":"Bogdanov, D., Kamm, L., Laur, S., Sokk, V.: Rmind: a tool for cryptographically secure statistical analysis. IEEE Trans. Dependable Secure Comput. 15(3), 481\u2013495 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"3_CR4","unstructured":"Buddhavarapu, P., Knox, A., Mohassel, P., Sengupta, S., Taubeneck, E., Vlaskin, V.: Private matching for compute. Cryptology ePrint Archive, Report 2020\/599 (2020). https:\/\/eprint.iacr.org\/2020\/599"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 1223\u20131237. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Chen, Y.R., Rezapour, A., Tzeng, W.G.: Privacy-preserving ridge regression on distributed data. Inf. Sci. 451\u2013452, 34\u201349 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.03.061. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025518302500","DOI":"10.1016\/j.ins.2018.03.061"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"de Cock, M., Dowsley, R., Nascimento, A.C., Newman, S.C.: Fast, privacy preserving linear regression over distributed datasets based on pre-distributed data. In: Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, pp. 3\u201314. ACM (2015)","DOI":"10.1145\/2808769.2808774"},{"key":"3_CR8","unstructured":"Dankar, F.K., Brien, R., Adams, C., Matwin, S.: Secure multi-party linear regression. In: EDBT\/ICDT Workshops, pp. 406\u2013414. Citeseer (2014)"},{"key":"3_CR9","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. arXiv:math\/0307152, November 2003"},{"key":"3_CR10","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining, vol. 14, pp. 1\u20138. Australian Computer Society, Inc. (2002)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"van Egmond, M.B., et al.: Predicting heart-failure risk using privacy-preserving dataset combination and lasso regression. Submitted to BMC Medical Informatics and Decision Making (2021)","DOI":"10.1186\/s12911-021-01582-y"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Gasc\u00f3n, A., et al.: Privacy-preserving distributed linear regression on high-dimensional data. Proc. Privacy Enhancing Technol. 2017(4), 345\u2013364 (2017)","DOI":"10.1515\/popets-2017-0053"},{"key":"3_CR14","unstructured":"Giacomelli, I., Jha, S., Page, C.D., Yoon, K.: Privacy-preserving ridge regression on distributed data. IACR Cryptology ePrint Archive 2017\/707 (2017)"},{"issue":"4","key":"3_CR15","first-page":"669","volume":"27","author":"R Hall","year":"2011","unstructured":"Hall, R., Fienberg, S.E., Nardi, Y.: Secure multiple linear regression based on homomorphic encryption. J. Off. Stat. 27(4), 669 (2011)","journal-title":"J. Off. Stat."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"AE Hoerl","year":"1970","unstructured":"Hoerl, A.E., Kennard, R.W.: Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12(1), 55\u201367 (1970). https:\/\/doi.org\/10.1080\/00401706.1970.10488634","journal-title":"Technometrics"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Hu, S., Wang, Q., Wang, J., Chow, S.S.M., Zou, Q.: Securing fast learning! ridge regression over encrypted big data. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, pp. 19\u201326 (2016). https:\/\/doi.org\/10.1109\/TrustCom.2016.0041","DOI":"10.1109\/TrustCom.2016.0041"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 593\u2013599. ACM (2005)","DOI":"10.1145\/1081870.1081942"},{"issue":"9","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16(9), 1026\u20131037 (2004). https:\/\/doi.org\/10.1109\/TKDE.2004.45","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR20","unstructured":"Karr, A.F., Lin, X., Sanil, A.P., Reiter, J.P.: Regression on distributed databases via secure multi-party computation. In: Proceedings of the 2004 Annual National Conference on Digital Government Research, dg.o 2004, pp. 1\u20132. Digital Government Society of North America (2004). http:\/\/dl.acm.org\/citation.cfm?id=1124191.1124299"},{"issue":"11","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1109\/TKDE.2010.193","volume":"23","author":"K Lin","year":"2011","unstructured":"Lin, K., Chen, M.: On the design and analysis of the privacy-preserving SVM classifier. IEEE Trans. Knowl. Data Eng. 23(11), 1704\u20131717 (2011). https:\/\/doi.org\/10.1109\/TKDE.2010.193","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s10115-004-0148-7","volume":"8","author":"X Lin","year":"2005","unstructured":"Lin, X., Clifton, C., Zhu, M.: Privacy-preserving clustering with distributed EM mixture modeling. Knowl. Inf. Syst. 8(1), 68\u201381 (2005)","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Zhang, Y.: Secureml: a system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 19\u201338 (2017). https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-preserving ridge regression on hundreds of millions of records. In: 2013 IEEE Symposium on Security and Privacy, pp. 334\u2013348. IEEE (2013)","DOI":"10.1109\/SP.2013.30"},{"issue":"Oct","key":"3_CR25","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(Oct), 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Spot-light: lightweight private set intersection from sparse OT extension. Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 122\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_5"},{"key":"3_CR28","unstructured":"Que, J., Jiang, X., Ohno-Machado, L.: A collaborative framework for distributed privacy-preserving support vector machine learning. In: AMIA Annual Symposium Proceedings, vol. 2012, pp. 1350\u20131359. American Medical Informatics Association (2012)"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Sanil, A.P., Karr, A.F., Lin, X., Reiter, J.P.: Privacy preserving regression modelling via distributed computation. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004, pp. 677\u2013682. ACM, New York (2004). https:\/\/doi.org\/10.1145\/1014052.1014139","DOI":"10.1145\/1014052.1014139"},{"issue":"1\u20132","key":"3_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1030-6","journal-title":"Math. Program."},{"key":"3_CR31","unstructured":"Schoenmakers, B.: MPyC - secure multiparty computation in python. https:\/\/github.com\/lschoe\/mpyc"},{"issue":"11","key":"3_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"1","key":"3_CR33","first-page":"25","volume":"10","author":"M Sumana","year":"2018","unstructured":"Sumana, M., Hareesha, K.: Modelling a secure support vector machine classifier for private data. Int. J. Inf. Comput. Secur. 10(1), 25\u201340 (2018)","journal-title":"Int. J. Inf. Comput. Secur."},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s13042-014-0245-1","volume":"6","author":"L Sun","year":"2015","unstructured":"Sun, L., Mu, W.S., Qi, B., Zhou, Z.J.: A new privacy-preserving proximal support vector machine for classification of vertically partitioned data. Int. J. Mach. Learn. Cybern. 6(1), 109\u2013118 (2015). https:\/\/doi.org\/10.1007\/s13042-014-0245-1","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"J Suykens","year":"1999","unstructured":"Suykens, J., Vandewalle, J.: Least squares support vector machine classifiers. Neural Process. Lett. 9(3), 293\u2013300 (1999). https:\/\/doi.org\/10.1023\/A:1018628609742","journal-title":"Neural Process. Lett."},{"issue":"1","key":"3_CR36","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996). https:\/\/doi.org\/10.1111\/j.2517-6161.1996.tb02080.x","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. ACM (2003)","DOI":"10.1145\/956750.956776"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving Naive Bayes classifier for vertically partitioned data. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 522\u2013526. SIAM (2004)","DOI":"10.1137\/1.9781611972740.59"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11535706_11","volume-title":"Data and Applications Security XIX","author":"J Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving decision trees over vertically partitioned data. In: Jajodia, S., Wijesekera, D. (eds.) DBSec 2005. LNCS, vol. 3654, pp. 139\u2013152. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535706_11"},{"issue":"4","key":"3_CR40","doi-asserted-by":"publisher","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. J. Comput. Secur. 13(4), 593\u2013622 (2005)","journal-title":"J. Comput. Secur."},{"issue":"2","key":"3_CR41","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10115-007-0073-7","volume":"14","author":"J Vaidya","year":"2008","unstructured":"Vaidya, J., Yu, H., Jiang, X.: Privacy-preserving SVM classification. Knowl. Inf. Syst. 14(2), 161\u2013178 (2008). https:\/\/doi.org\/10.1007\/s10115-007-0073-7","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Wright, R., Yang, Z.: Privacy-preserving Bayesian network structure computation on distributed heterogeneous data. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 713\u2013718. ACM (2004)","DOI":"10.1145\/1014052.1014145"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Yu, H., Jiang, X., Vaidya, J.: Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data. In: Proceedings of the 2006 ACM Symposium on Applied Computing, SAC 2006, pp. 603\u2013610. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1141277.1141415","DOI":"10.1145\/1141277.1141415"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11731139_74","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Yu","year":"2006","unstructured":"Yu, H., Vaidya, J., Jiang, X.: Privacy-preserving SVM classification on vertically partitioned data. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 647\u2013656. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11731139_74"}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78086-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T06:33:21Z","timestamp":1672641201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78086-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030780852","9783030780869"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78086-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security Cryptography and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~fradmin\/cscml21\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"22","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":"13","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":"46% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 keynote paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}