{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:33:49Z","timestamp":1772490829666,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"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-83508-8_3","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling with Testing on Multiple Identical Parallel Machines"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Eckl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459\u2013473 (1999). https:\/\/doi.org\/10.1137\/S0097539797324874","journal-title":"SIAM J. Comput."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Albers, S.: On randomized online scheduling. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 134\u2013143. STOC 2002, Association for Computing Machinery, New York, NY, USA (2002). https:\/\/doi.org\/10.1145\/509907.509930","DOI":"10.1145\/509907.509930"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-80879-2_9","volume-title":"Approximation and Online Algorithms","author":"S Albers","year":"2021","unstructured":"Albers, S., Eckl, A.: Explorable uncertainty in scheduling with non-uniform testing times. In: Kaklamanis, C., Levin, A. (eds.) WAOA 2020. LNCS, vol. 12806, pp. 127\u2013142. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80879-2_9"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Albers, S., Eckl, A.: Scheduling with testing on multiple identical parallel machines (2021). arXiv: https:\/\/arxiv.org\/abs\/2105.02052","DOI":"10.1007\/978-3-030-83508-8_3"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theoret. Comput. Sci. 443, 1\u20139 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.031","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/s00453-016-0172-5","volume":"78","author":"S Albers","year":"2017","unstructured":"Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules. Algorithmica 78(2), 492\u2013520 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0172-5","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y Azar","year":"2001","unstructured":"Azar, Y., Regev, O.: On-line bin-stretching. Theoret. Comput. Sci. 268(1), 17\u201341 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00258-9","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 51\u201358. STOC 1992, Association for Computing Machinery, New York, NY, USA (1992). https:\/\/doi.org\/10.1145\/129712.129718","DOI":"10.1145\/129712.129718"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y Bartal","year":"1994","unstructured":"Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett. 50(3), 113\u2013116 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)00026-3","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-004-1180-4","volume":"38","author":"R Bruce","year":"2005","unstructured":"Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theoret. Comput. Sci. 38(4), 411\u2013423 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1180-4","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: A lower bound for randomized on-line scheduling algorithms. Inf. Process. Lett. 51(5), 219\u2013222 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)00110-3","journal-title":"Inf. Process. Lett."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0049417","volume-title":"Algorithms ESA 1994","author":"B Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on line scheduling. In: van Leeuwen, J. (ed.) Algorithms ESA 1994. LNCS, vol. 855, pp. 300\u2013306. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0049417"},{"key":"3_CR13","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.4230\/LIPIcs.ITCS.2018.30","volume-title":"9th Innovations in Theoretical Computer Science Conference (ITCS 2018)","author":"C Durr","year":"2018","unstructured":"Durr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: Scheduling with explorable uncertainty. In: Karlin, A.R. (ed.) 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 94, pp. 30:1\u201330:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.30"},{"issue":"12","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1007\/s00453-020-00742-2","volume":"82","author":"C D\u00fcrr","year":"2020","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: An adversarial model for scheduling with testing. Algorithmica 82(12), 3630\u20133675 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00742-2","journal-title":"Algorithmica"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Englert, M., \u00d6zmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612 (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.46","DOI":"10.1109\/FOCS.2008.46"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10951-018-0567-z","volume":"21","author":"L Epstein","year":"2018","unstructured":"Epstein, L.: A survey on makespan minimization in semi-online environments. J. Sched. 21(3), 269\u2013284 (2018). https:\/\/doi.org\/10.1007\/s10951-018-0567-z","journal-title":"J. Sched."},{"issue":"116","key":"3_CR17","first-page":"1","volume":"2","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. EATCS 2(116), 1\u201319 (2015)","journal-title":"Bull. EATCS"},{"key":"3_CR18","series-title":"Leibniz International Proceedings in Informatics","doi-asserted-by":"publisher","first-page":"277","DOI":"10.4230\/LIPIcs.STACS.2008.1358","volume-title":"25th International Symposium on Theoretical Aspects of Computer Science","author":"T Erlebach","year":"2008","unstructured":"Erlebach, T., Hoffmann, M., Krizanc, D., Mihal\u2019\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Albers, S., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol. 1, pp. 277\u2013288. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2008.1358"},{"issue":"2","key":"3_CR19","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., Turan, G.: On the performance of on-line algorithms for partition problems. Acta Cybern. 9(2), 107\u2013119 (1989)","journal-title":"Acta Cybern."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.005","volume":"62","author":"T Feder","year":"2007","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62(1), 1\u201318 (2007). https:\/\/doi.org\/10.1016\/j.jalgor.2004.07.005","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S0097539701395668","volume":"32","author":"T Feder","year":"2003","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. SIAM J. Comput. 32(2), 538\u2013547 (2003). https:\/\/doi.org\/10.1137\/S0097539701395668","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR22","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3(6), 343\u2013353 (2000)","journal-title":"J. Sched."},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst-case ratio than Graham\u2019s list scheduling. SIAM J. Comput. 22(2), 349\u2013355 (1993). https:\/\/doi.org\/10.1137\/0222026","journal-title":"SIAM J. Comput."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2014.09.010","volume":"55","author":"M Goerigk","year":"2015","unstructured":"Goerigk, M., Gupta, M., Ide, J., Sch\u00f6bel, A., Sen, S.: The robust knapsack problem with queries. Comput. Oper. Res. 55, 12\u201322 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.09.010","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Techn. J. 45(9), 1563\u20131581 (1966). https:\/\/doi.org\/10.1002\/j.1538-7305.1966.tb01709.x","journal-title":"Bell Syst. Techn. J."},{"issue":"2","key":"3_CR26","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969). https:\/\/doi.org\/10.1137\/0117039","journal-title":"SIAM J. Appl. Math."},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. In: Chakraborty, S., Kumar, A. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), vol. 13, pp. 325\u2013338. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2011). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2011.325","DOI":"10.4230\/LIPIcs.FSTTCS.2011.325"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987). https:\/\/doi.org\/10.1145\/7531.7535","journal-title":"J. ACM"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Kahan, S.: A model for data in motion. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 265\u2013277. STOC 1991, ACM, New York, NY, USA (1991). https:\/\/doi.org\/10.1145\/103418.103449","DOI":"10.1145\/103418.103449"},{"issue":"4","key":"3_CR30","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000). https:\/\/doi.org\/10.1145\/347476.347479","journal-title":"J. ACM"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20(2), 400\u2013430 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0019","journal-title":"J. Algorithms"},{"issue":"6","key":"3_CR32","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10951-015-0430-4","volume":"18","author":"H Kellerer","year":"2015","unstructured":"Kellerer, H., Kotov, V., Gabay, M.: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18(6), 623\u2013630 (2015). https:\/\/doi.org\/10.1007\/s10951-015-0430-4","journal-title":"J. Sched."},{"issue":"5","key":"3_CR33","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5), 235\u2013242 (1997). https:\/\/doi.org\/10.1016\/S0167-6377(98)00005-4","journal-title":"Oper. Res. Lett."},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 171\u2013182. PODS 2001, Association for Computing Machinery, New York, NY, USA (2001). https:\/\/doi.org\/10.1145\/375551.375577","DOI":"10.1145\/375551.375577"},{"issue":"4","key":"3_CR35","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1088375","volume":"46","author":"N Megow","year":"2017","unstructured":"Megow, N., Mei\u00dfner, J., Skutella, M.: Randomization helps computing a minimum spanning tree under uncertainty. SIAM J. Comput. 46(4), 1217\u20131240 (2017). https:\/\/doi.org\/10.1137\/16M1088375","journal-title":"SIAM J. Comput."},{"key":"3_CR36","unstructured":"Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: 26th International Conference on Very Large Data Bases (VLDB 2000), pp. 144\u2013155. VLDB 2000, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)"},{"key":"3_CR37","unstructured":"Rudin III, J.F.: Improved bounds for the on-line scheduling problem. Ph.D. Thesis (2001)"},{"issue":"1","key":"3_CR38","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J Sgall","year":"1997","unstructured":"Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inf. Process. Lett. 63(1), 51\u201355 (1997). https:\/\/doi.org\/10.1016\/S0020-0190(97)00093-8","journal-title":"Inf. Process. Lett."},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Singla, S.: The price of information in combinatorial optimization. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 2523\u20132532. SODA \u201918, Society for Industrial and Applied Mathematics, USA (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.161","DOI":"10.1137\/1.9781611975031.161"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"641","DOI":"10.2307\/1910412","volume":"47","author":"ML Weitzman","year":"1979","unstructured":"Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641\u2013654 (1979). https:\/\/doi.org\/10.2307\/1910412","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:02Z","timestamp":1645183502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}