{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:44:25Z","timestamp":1773384265187,"version":"3.50.1"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030179526","type":"print"},{"value":"9783030179533","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-17953-3_3","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:17:39Z","timestamp":1556752659000},"page":"27-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Strong Mixed-Integer Programming Formulations for Trained Neural Networks"],"prefix":"10.1007","author":[{"given":"Ross","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Joey","family":"Huchette","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Tjandraatmadja","sequence":"additional","affiliation":[]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"3_CR1","unstructured":"Amos, B., Xu, L., Kolter, J.Z.: Input convex neural networks. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 146\u2013155. PMLR, International Convention Centre, Sydney, Australia, 06\u201311 August 2017"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, R., Huchette, J., Tjandraatmadja, C., Vielma, J.P.: Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018). https:\/\/arxiv.org\/abs\/1811.01988","DOI":"10.1007\/978-3-030-17953-3_3"},{"issue":"6","key":"3_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MSP.2017.2743240","volume":"34","author":"K Arulkumaran","year":"2017","unstructured":"Arulkumaran, K., Deisenroth, M.P., Brundage, M., Bharath, A.A.: Deep reinforcement learning: a brief survey. IEEE Signal Process. Mag. 34(6), 26\u201338 (2017)","journal-title":"IEEE Signal Process. Mag."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170, 141\u2013176 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algorithmic Discret. Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algorithmic Discret. Methods"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89, 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-23786-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A Bartolini","year":"2011","unstructured":"Bartolini, A., Lombardi, M., Milano, M., Benini, L.: Neuron constraints to model complex real-world problems. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 115\u2013129. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_11"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bartolini, A., Lombardi, M., Milano, M., Benini, L.: Optimization and controlled systems: a case study on thermal aware workload dispatching. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pp. 427\u2013433 (2012)","DOI":"10.1609\/aaai.v26i1.8138"},{"key":"3_CR9","unstructured":"Bastani, O., Ioannou, Y., Lampropoulos, L., Vytiniotis, D., Nori, A.V., Criminisi, A.: Measuring neural net robustness with constraints. In: Advances in Neural Information Processing Systems, pp. 2613\u20132621 (2016)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-016-9847-8","volume":"65","author":"P Belotti","year":"2016","unstructured":"Belotti, P., et al.: On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3), 545\u2013566 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"3_CR11","unstructured":"Bertsimas, D., Kallus, N.: From predictive to prescriptive analytics. Management Science (2018). https:\/\/arxiv.org\/abs\/1402.5481"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Biggs, M., Hariss, R.: Optimizing objective functions determined from random forests (2017). https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=2986630","DOI":"10.2139\/ssrn.2986630"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"3_CR14","unstructured":"Bunel, R., Turkaslan, I., Torr, P.H., Kohli, P., Kumar, M.P.: A unified view of piecewise linear neural network verification. In: Advances in Neural Information Processing Systems (2018)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 39\u201357 (2017)","DOI":"10.1109\/SP.2017.49"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-68167-2_18","volume-title":"Automated Technology for Verification and Analysis","author":"C-H Cheng","year":"2017","unstructured":"Cheng, C.-H., N\u00fchrenberg, G., Ruess, H.: Maximum resilience of artificial neural networks. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 251\u2013268. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_18"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Deng, Y., Liu, J., Sen, S.: Coalescing data and decision sciences for analytics. In: Recent Advances in Optimization and Modeling of Contemporary Problems. INFORMS (2018)","DOI":"10.1287\/educ.2018.0185"},{"key":"3_CR18","unstructured":"Donti, P., Amos, B., Kolter, J.Z.: Task-based end-to-end model learning in stochastic optimization. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems, vol. 30, pp. 5484\u20135494. Curran Associates, Inc. (2017)"},{"key":"3_CR19","unstructured":"Dulac-Arnold, G., et al.: Deep reinforcement learning in large discrete action spaces (2015). https:\/\/arxiv.org\/abs\/1512.07679"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-77935-5_9","volume-title":"NASA Formal Methods","author":"S Dutta","year":"2018","unstructured":"Dutta, S., Jha, S., Sankaranarayanan, S., Tiwari, A.: Output range analysis for deep feedforward neural networks. In: Dutle, A., Mu\u00f1oz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 121\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77935-5_9"},{"key":"3_CR21","unstructured":"Dvijotham, K., et al.:: Training verified learners with learned verifiers (2018). https:\/\/arxiv.org\/abs\/1805.10265"},{"key":"3_CR22","unstructured":"Dvijotham, K., Stanforth, R., Gowal, S., Mann, T., Kohli, P.: A dual approach to scalable verification of deep networks. In: Thirty-Fourth Conference Annual Conference on Uncertainty in Artificial Intelligence (2018)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-68167-2_19","volume-title":"Automated Technology for Verification and Analysis","author":"R Ehlers","year":"2017","unstructured":"Ehlers, R.: Formal verification of piece-wise linear feed-forward neural networks. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 269\u2013286. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_19"},{"key":"3_CR24","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart \"Predict, then Optimize\" (2017). https:\/\/arxiv.org\/abs\/1710.08005"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s10601-018-9285-6","volume":"23","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Jo, J.: Deep neural networks and mixed integer linear optimization. Constraints 23, 296\u2013309 (2018)","journal-title":"Constraints"},{"key":"3_CR26","unstructured":"Gatys, L.A., Ecker, A.S., Bethge, M.: A neural algorithm of artistic style (2015). https:\/\/arxiv.org\/abs\/1508.06576"},{"key":"3_CR27","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning, vol. 1. MIT Press, Cambridge (2016)"},{"key":"3_CR28","unstructured":"den Hertog, D., Postek, K.: Bridging the gap between predictive and prescriptive analytics - new optimization methodology needed (2016). http:\/\/www.optimization-online.org\/DB_HTML\/2016\/12\/5779.html"},{"issue":"2","key":"3_CR29","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Comput. Optim. Appl. 52(2), 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"3_CR30","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: A note on linear on\/off constraints (2014). http:\/\/www.optimization-online.org\/DB_FILE\/2014\/04\/4309.pdf"},{"key":"3_CR31","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2011","unstructured":"Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, Hoboken (2011)"},{"key":"3_CR32","unstructured":"Huchette, J.: Advanced mixed-integer programming formulations: methodology, computation, and application. Ph.D. thesis, Massachusetts Institute of Technology (June 2018)"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"key":"3_CR34","unstructured":"Khalil, E.B., Gupta, A., Dilkina, B.: Combinatorial attacks on binarized neural networks. In: International Conference on Learning Representations (2019)"},{"issue":"7553","key":"3_CR35","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86, 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"4","key":"3_CR37","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10601-015-9234-6","volume":"21","author":"M Lombardi","year":"2016","unstructured":"Lombardi, M., Gualandi, S.: A lagrangian propagator for artificial neural networks in constraint programming. Constraints 21(4), 435\u2013462 (2016)","journal-title":"Constraints"},{"key":"3_CR38","unstructured":"Lomuscio, A., Maganti, L.: An approach to reachability analysis for feed-forward ReLU neural networks (2017). https:\/\/arxiv.org\/abs\/1706.07351"},{"key":"3_CR39","unstructured":"Mi\u0161i\u0107, V.V.: Optimization of tree ensembles (2017). https:\/\/arxiv.org\/abs\/1705.10883"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Mladenov, M., Boutilier, C., Schuurmans, D., Elidan, G., Meshi, O., Lu, T.: Approximate linear programming for logistic Markov decision processes. In: Proceedings of the Twenty-sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 2486\u20132493, Melbourne, Australia (2017)","DOI":"10.24963\/ijcai.2017\/346"},{"key":"3_CR41","unstructured":"Mordvintsev, A., Olah, C., Tyka, M.: Inceptionism: going deeper into neural networks (2015). https:\/\/ai.googleblog.com\/2015\/06\/inceptionism-going-deeper-into-neural.html"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Olah, C., Mordvintsev, A., Schubert, L.: Feature Visualization. Distill (2017). https:\/\/distill.pub\/2017\/feature-visualization","DOI":"10.23915\/distill.00007"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Jha, S., Fredrikson, M., Celik, Z.B., Swami, A.: The limitations of deep learning in adversarial settings. In: IEEE European Symposium on Security and Privacy, pp. 372\u2013387, March 2016","DOI":"10.1109\/EuroSP.2016.36"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Say, B., Wu, G., Zhou, Y.Q., Sanner, S.: Nonlinear hybrid planning with deep net learned transition models and mixed-integer linear programming. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 750\u2013756 (2017)","DOI":"10.24963\/ijcai.2017\/104"},{"issue":"3","key":"3_CR45","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s10957-018-1396-0","volume":"180","author":"AM Schweidtmann","year":"2019","unstructured":"Schweidtmann, A.M., Mitsos, A.: Global deterministic optimization with artificial neural networks embedded. J. Optim. Theory Appl. 180(3), 925\u2013948 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"3_CR46","unstructured":"Serra, T., Ramalingam, S.: Empirical bounds on linear regions of deep rectifier networks (2018). https:\/\/arxiv.org\/abs\/1810.03370"},{"key":"3_CR47","unstructured":"Serra, T., Tjandraatmadja, C., Ramalingam, S.: Bounding and counting linear regions of deep neural networks. In: Thirty-Fifth International Conference on Machine Learning (2018)"},{"key":"3_CR48","unstructured":"Szegedy, C., et al.: Intriguing properties of neural networks. In: International Conference on Learning Representations (2014)"},{"key":"3_CR49","unstructured":"Tjeng, V., Xiao, K., Tedrake, R.: Verifying neural networks with mixed integer programming. In: International Conference on Learning Representations (2019)"},{"issue":"1","key":"3_CR50","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. (2018)","DOI":"10.1007\/s10107-018-1258-4"},{"issue":"1\u20132","key":"3_CR52","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1\u20132), 49\u201372 (2011)","journal-title":"Math. Program."},{"key":"3_CR53","unstructured":"Wong, E., Kolter, J.Z.: Provable defenses against adversarial examples via the convex outer adversarial polytope. In: International Conference on Machine Learning (2018)"},{"key":"3_CR54","unstructured":"Wong, E., Schmidt, F., Metzen, J.H., Kolter, J.Z.: Scaling provable adversarial defenses. In: 32nd Conference on Neural Information Processing Systems (2018)"},{"key":"3_CR55","unstructured":"Wu, G., Say, B., Sanner, S.: Scalable planning with Tensorflow for hybrid nonlinear domains. In: Advances in Neural Information Processing Systems, pp. 6276\u20136286 (2017)"},{"key":"3_CR56","unstructured":"Xiao, K.Y., Tjeng, V., Shafiullah, N.M., Madry, A.: Training for faster adversarial robustness verification via inducing ReLU stability. In: International Conference on Learning Representations (2019)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:41:05Z","timestamp":1709815265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","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":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","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":"113","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":"33","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":"0","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":"29% - 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":"2.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}