{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:14:34Z","timestamp":1742973274025,"version":"3.40.3"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_14","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"187-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ReLU Neural Networks of\u00a0Polynomial Size for\u00a0Exact Maximum Flow Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5646-8567","authenticated-orcid":false,"given":"Christoph","family":"Hertrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2953-1115","authenticated-orcid":false,"given":"Leon","family":"Sering","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"14_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, New Jersey, USA (1993)"},{"key":"14_CR2","unstructured":"Ali, M.M., Kamoun, F.: A neural network approach to the maximum flow problem. In: IEEE Global Telecommunications Conference GLOBECOM\u201991: Countdown to the New Millennium. Conference Record, pp. 130\u2013134 (1991)"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural Network Learning: Theoretical Foundations","author":"M Anthony","year":"1999","unstructured":"Anthony, M., Bartlett, P.L.: Neural Network Learning: Theoretical Foundations. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR4","unstructured":"Arora, R., Basu, A., Mianjy, P., Mukherjee, A.: Understanding deep neural networks with rectified linear units. In: International Conference on Learning Representations (2018)"},{"issue":"7","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/0893-6080(96)00130-X","volume":"9","author":"V Beiu","year":"1996","unstructured":"Beiu, V., Taylor, J.G.: On the circuit complexity of sigmoid feedforward neural networks. Neural Netw. 9(7), 1155\u20131171 (1996)","journal-title":"Neural Netw."},{"key":"14_CR6","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940 (2016)"},{"key":"14_CR7","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. arXiv:1811.06128 (2018)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Berner, J., Grohs, P., Kutyniok, G., Petersen, P.: The modern mathematics of deep learning. arXiv:2105.04026 (2021)","DOI":"10.1017\/9781009025096.002"},{"key":"14_CR9","unstructured":"Bertschinger, D., Hertrich, C., Jungeblut, P., Miltzow, T., Weber, S.: Training fully connected neural networks is $$\\exists \\mathbb{R} $$-complete. arXiv:2204.01368 (2022)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. arXiv:2203.00671 (2022)","DOI":"10.1109\/FOCS54457.2022.00064"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303\u2013314 (1989)","journal-title":"Math. Control Signals Syst."},{"key":"14_CR12","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady 11, 1277\u20131280 (1970)","journal-title":"Soviet Math. Doklady"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"3","key":"14_CR14","first-page":"149","volume":"3","author":"S Effati","year":"2008","unstructured":"Effati, S., Ranjbar, M.: Neural network models for solving the maximum flow problem. Appl. Appl. Math. 3(3), 149\u2013162 (2008)","journal-title":"Appl. Appl. Math."},{"key":"14_CR15","unstructured":"Eldan, R., Shamir, O.: The power of depth for feedforward neural networks. In: Conference on Learning Theory, pp. 907\u2013940 (2016)"},{"key":"14_CR16","unstructured":"Emami, P., Ranka, S.: Learning permutations with Sinkhorn policy gradient. arXiv:1805.07010 (2018)"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-014-9231-y","volume":"16","author":"S Fomin","year":"2016","unstructured":"Fomin, S., Grigoriev, D., Koshevoy, G.: Subtraction-free complexity, cluster transformations, and spanning trees. Found. Comput. Math. 16(1), 1\u201331 (2016)","journal-title":"Found. Comput. Math."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Froese, V., Hertrich, C., Niedermeier, R.: The computational complexity of ReLU network training parameterized by data dimensionality. arXiv:2105.08675 (2021)","DOI":"10.1613\/jair.1.13547"},{"key":"14_CR19","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. In: 14th International Conference on Artificial Intelligence and Statistics, pp. 315\u2013323 (2011)"},{"key":"14_CR20","unstructured":"Goel, S., Klivans, A.R., Manurangsi, P., Reichman, D.: Tight hardness results for training depth-2 ReLU networks. In: 12th Innovations in Theoretical Computer Science Conference (ITCS \u201921) (2021)"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM (JACM) 35(4), 921\u2013940 (1988)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"LM Goldschlager","year":"1982","unstructured":"Goldschlager, L.M., Shaw, R.A., Staples, J.: The maximum flow problem is log space complete for P. Theoretical Comput. Sci. 21(1), 105\u2013111 (1982)","journal-title":"Theoretical Comput. Sci."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: P-completeness theory. Oxford University Press, Oxford (1995)","DOI":"10.1093\/oso\/9780195085914.001.0001"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Haase, C.A., Hertrich, C., Loho, G.: Lower bounds on the depth of integral ReLU neural networks via lattice polytopes. In: International Conference on Learning Representations (ICLR) (2023)","DOI":"10.1137\/22M1489332"},{"issue":"10","key":"14_CR25","doi-asserted-by":"publisher","first-page":"992","DOI":"10.3390\/math7100992","volume":"7","author":"B Hanin","year":"2019","unstructured":"Hanin, B.: Universal function approximation by deep neural nets with bounded width and ReLU activations. Mathematics 7(10), 992 (2019)","journal-title":"Mathematics"},{"key":"14_CR26","unstructured":"Hanin, B., Rolnick, D.: Complexity of linear regions in deep networks. In: International Conference on Machine Learning (2019)"},{"key":"14_CR27","unstructured":"Hanin, B., Sellke, M.: Approximating continuous functions by ReLU nets of minimal width. arXiv:1710.11278 (2017)"},{"key":"14_CR28","first-page":"3336","volume":"34","author":"C Hertrich","year":"2021","unstructured":"Hertrich, C., Basu, A., Di Summa, M., Skutella, M.: Towards lower bounds on the depth of ReLU neural networks. Adv. Neural. Inf. Process. Syst. 34, 3336\u20133348 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Hertrich, C., Skutella, M.: Provably good solutions to the knapsack problem via neural networks of bounded size. In: AAAI Conference on Artificial Intelligence (2021)","DOI":"10.1609\/aaai.v35i9.16939"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol. Cybernet. 52(3), 141\u2013152 (1985)","journal-title":"Biol. Cybernet."},{"issue":"2","key":"14_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"issue":"3","key":"14_CR32","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM (JACM) 29(3), 874\u2013897 (1982)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"14_CR33","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00224-014-9574-4","volume":"57","author":"S Jukna","year":"2015","unstructured":"Jukna, S.: Lower bounds for tropical circuits and dynamic programs. Theory Comput. Syst. 57(1), 160\u2013194 (2015)","journal-title":"Theory Comput. Syst."},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2018.10.018","volume":"142","author":"S Jukna","year":"2019","unstructured":"Jukna, S., Seiwert, H.: Greedy can beat pure dynamic programming. Inf. Process. Lett. 142, 90\u201395 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"14_CR35","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1109\/31.1783","volume":"35","author":"MP Kennedy","year":"1988","unstructured":"Kennedy, M.P., Chua, L.O.: Neural networks for nonlinear programming. IEEE Trans. Circuits Syst. 35(5), 554\u2013562 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Khalife, S., Basu, A.: Neural networks with linear threshold activations: structure and algorithms. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 347\u2013360. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_26","DOI":"10.1007\/978-3-031-06901-7_26"},{"key":"14_CR37","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems 30 (2017)"},{"key":"14_CR38","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/3-540-29297-7","DOI":"10.1007\/3-540-29297-7"},{"key":"14_CR40","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, 436\u2013444 (2015)","journal-title":"Nature"},{"key":"14_CR41","unstructured":"Liang, S., Srikant, R.: Why deep neural networks for function approximation? In: International Conference on Learning Representations (2017)"},{"issue":"2","key":"14_CR42","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"14_CR43","unstructured":"Montufar, G.F., Pascanu, R., Cho, K., Bengio, Y.: On the number of linear regions of deep neural networks. In: Advances in Neural Information Processing Systems, vol. 27 (2014)"},{"key":"14_CR44","unstructured":"Mukherjee, A., Basu, A.: Lower bounds over Boolean inputs for deep neural networks with ReLU gates. arXiv:1711.03073 (2017)"},{"issue":"14","key":"14_CR45","doi-asserted-by":"publisher","first-page":"3498","DOI":"10.1016\/j.cam.2012.03.001","volume":"236","author":"A Nazemi","year":"2012","unstructured":"Nazemi, A., Omidi, F.: A capable neural network model for solving the maximum flow problem. J. Comput. Appl. Math. 236(14), 3498\u20133513 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"14_CR46","unstructured":"Nguyen, Q., Mukkamala, M.C., Hein, M.: Neural networks should be wide enough to learn disconnected decision regions. In: International Conference on Machine Learning (2018)"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Nowak, A., Villar, S., Bandeira, A.S., Bruna, J.: Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks. arXiv:1706.07450 (2017)","DOI":"10.1109\/DSW.2018.8439919"},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in O(nm) time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing (STOC \u201913), pp. 765\u2013774. Association for Computing Machinery (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"14_CR49","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I Parberry","year":"1994","unstructured":"Parberry, I., Garey, M.R., Meyer, A.: Circuit Complexity and Neural Networks. MIT Press, Cambridge (1994)"},{"key":"14_CR50","unstructured":"Pascanu, R., Montufar, G., Bengio, Y.: On the number of inference regions of deep feed forward networks with piece-wise linear activations. In: International Conference on Learning Representations (2014)"},{"key":"14_CR51","unstructured":"Raghu, M., Poole, B., Kleinberg, J., Ganguli, S., Dickstein, J.S.: On the expressive power of deep neural networks. In: International Conference on Machine Learning (2017)"},{"issue":"6","key":"14_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127497","volume":"64","author":"T Rothvo\u00df","year":"2017","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. J. ACM (JACM) 64(6), 1\u201319 (2017)","journal-title":"J. ACM (JACM)"},{"key":"14_CR53","unstructured":"Safran, I., Shamir, O.: Depth-width tradeoffs in approximating natural functions with neural networks. In: International Conference on Machine Learning (2017)"},{"key":"14_CR54","unstructured":"Serra, T., Tjandraatmadja, C., Ramalingam, S.: Bounding and counting linear regions of deep neural networks. In: International Conference on Machine Learning (2018)"},{"issue":"6","key":"14_CR55","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/S0893-6080(05)80093-0","volume":"5","author":"JS Shawe-Taylor","year":"1992","unstructured":"Shawe-Taylor, J.S., Anthony, M.H., Kern, W.: Classes of feedforward neural networks and their circuit complexity. Neural Netw. 5(6), 971\u2013977 (1992)","journal-title":"Neural Netw."},{"key":"14_CR56","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Now Publishers Inc. (2010)","DOI":"10.1561\/9781601984012"},{"issue":"1","key":"14_CR57","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"14_CR58","unstructured":"Telgarsky, M.: Representation benefits of deep feedforward networks. arXiv:1509.08101 (2015)"},{"key":"14_CR59","unstructured":"Telgarsky, M.: Benefits of depth in neural networks. In: Conference on Learning Theory, pp. 1517\u20131539 (2016)"},{"key":"14_CR60","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"14_CR61","doi-asserted-by":"publisher","DOI":"10.1017\/9781316888568","volume-title":"Network Flow Algorithms","author":"DP Williamson","year":"2019","unstructured":"Williamson, D.P.: Network Flow Algorithms. Cambridge University Press, Cambridge (2019)"},{"key":"14_CR62","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.neunet.2017.07.002","volume":"94","author":"D Yarotsky","year":"2017","unstructured":"Yarotsky, D.: Error bounds for approximations with deep ReLU networks. Neural Netw. 94, 103\u2013114 (2017)","journal-title":"Neural Netw."}],"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-031-32726-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T14:04:43Z","timestamp":1702476283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","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":"Madison, WI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","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":"119","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":"28% - 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","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)"}}]}}