{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:33:59Z","timestamp":1743032039537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031493607"},{"type":"electronic","value":"9783031493614"}],"license":[{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49361-4_13","type":"book-chapter","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T05:02:31Z","timestamp":1702443751000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fitting Data on\u00a0a\u00a0Grain of\u00a0Rice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1202-0805","authenticated-orcid":false,"given":"Chris","family":"Schwiegelshohn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,14]]},"reference":[{"key":"13_CR1","first-page":"1","volume":"52","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. Comb. Computat. Geom. 52, 1\u201330 (2005)","journal-title":"Comb. Computat. Geom."},{"unstructured":"Baker, D., Braverman, V., Huang, L., Jiang, S.H.C., Krauthgamer, R., Wu, X.: Coresets for clustering in graphs of bounded treewidth (2020)","key":"13_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bandyapadhyay, S., Fomin, F.V., Simonov, K.: On coresets for fair clustering in metric and Euclidean spaces and their applications. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, 12\u201316 July 2021, Glasgow, Scotland (Virtual Conference). LIPIcs, vol. 198, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.23","key":"13_CR3","DOI":"10.4230\/LIPIcs.ICALP.2021.23"},{"doi-asserted-by":"publisher","unstructured":"Batson, J.D., Spielman, D.A., Srivastava, N., Teng, S.: Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8), 87\u201394 (2013). https:\/\/doi.org\/10.1145\/2492007.2492029","key":"13_CR4","DOI":"10.1145\/2492007.2492029"},{"doi-asserted-by":"publisher","unstructured":"Becchetti, L., Bury, M., Cohen-Addad, V., Grandoni, F., Schwiegelshohn, C.: Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1039\u20131050 (2019). https:\/\/doi.org\/10.1145\/3313276.3316318","key":"13_CR5","DOI":"10.1145\/3313276.3316318"},{"doi-asserted-by":"publisher","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal coresets for least-squares regression. IEEE Trans. Inf. Theor. 59(10), 6880\u20136892 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2272457","key":"13_CR6","DOI":"10.1109\/TIT.2013.2272457"},{"doi-asserted-by":"publisher","unstructured":"Braverman, V., et al.: The power of uniform sampling for coresets. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, 31 October\u20133 November 2022, pp. 462\u2013473. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00051","key":"13_CR7","DOI":"10.1109\/FOCS54457.2022.00051"},{"doi-asserted-by":"publisher","unstructured":"Braverman, V., Jiang, S.H., Krauthgamer, R., Wu, X.: Coresets for clustering in excluded-minor graphs and beyond. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10\u201313 January 2021, pp. 2679\u20132696. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.159","key":"13_CR8","DOI":"10.1137\/1.9781611976465.159"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for k-median and k-means clustering in metric and Euclidean spaces and their applications. SIAM J. Comput. 39(3), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Elder, S., Musco, C., Musco, C., Persu, M.: Dimensionality reduction for k-means clustering and low rank approximation. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 163\u2013172 (2015)","key":"13_CR10","DOI":"10.1145\/2746539.2746569"},{"doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., Larsen, K.G., Saulpic, D., Schwiegelshohn, C.: Towards optimal lower bounds for k-median and k-means coresets. In: Leonardi, S., Gupta, A. (eds.) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, Rome, Italy, 20\u201324 June 2022, pp. 1038\u20131051. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3519946","key":"13_CR11","DOI":"10.1145\/3519935.3519946"},{"unstructured":"Cohen-Addad, V., Larsen, K.G., Saulpic, D., Schwiegelshohn, C., Sheikh-Omar, O.A.: Improved coresets for Euclidean k-means. In: NeurIPS (2022). http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/120c9ab5c58ba0fa9dd3a22ace1de245-Abstract-Conference.html","key":"13_CR12"},{"doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., Li, J.: On the fixed-parameter tractability of capacitated clustering. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, 9\u201312 July 2019, Patras, Greece, pp. 41:1\u201341:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.41","key":"13_CR13","DOI":"10.4230\/LIPIcs.ICALP.2019.41"},{"unstructured":"Cohen-Addad, V., Saulpic, D., Schwiegelshohn, C.: Improved coresets and sublinear algorithms for power means in Euclidean spaces. In: NeurIPS (2021)","key":"13_CR14"},{"doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., Saulpic, D., Schwiegelshohn, C.: A new coreset framework for clustering. In: Khuller, S., Williams, V.V. (eds.) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, Virtual Event, Italy, 21\u201325 June 2021, pp. 169\u2013182. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451022","key":"13_CR15","DOI":"10.1145\/3406325.3451022"},{"doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., Saulpic, D., Schwiegelshohn, C.: A new coreset framework for clustering. In: Khuller, S., Williams, V.V. (eds.) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, Virtual Event, Italy, 21\u201325 June 2021. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451022","key":"13_CR16","DOI":"10.1145\/3406325.3451022"},{"doi-asserted-by":"publisher","unstructured":"Feldman, D.: Core-sets: an updated survey. WIREs Data Mining Knowl. Discov. 10(1) (2020). https:\/\/doi.org\/10.1002\/widm.1335","key":"13_CR17","DOI":"10.1002\/widm.1335"},{"unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 569\u2013578 (2011)","key":"13_CR18"},{"doi-asserted-by":"publisher","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: constant-size coresets for k-means, PCA, and projective clustering. SIAM J. Comput. 49(3), 601\u2013657 (2020). https:\/\/doi.org\/10.1137\/18M1209854","key":"13_CR19","DOI":"10.1137\/18M1209854"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00454-006-1271-x","volume":"37","author":"S Har-Peled","year":"2007","unstructured":"Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. Discrete Computat. Geom. 37(1), 3\u201319 (2007)","journal-title":"Discrete Computat. Geom."},{"doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 291\u2013300 (2004)","key":"13_CR21","DOI":"10.1145\/1007352.1007400"},{"unstructured":"Huang, L., Huang, R., Huang, Z., Wu, X.: On coresets for clustering in small dimensional Euclidean spaces. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the International Conference on Machine Learning Research, ICML 2023, 23\u201329 July 2023, Honolulu, Hawaii, USA, vol. 202, pp. 13891\u201313915. PMLR (2023). https:\/\/proceedings.mlr.press\/v202\/huang23h.html","key":"13_CR22"},{"doi-asserted-by":"publisher","unstructured":"Huang, L., Jiang, S.H., Li, J., Wu, X.: Epsilon-coresets for clustering (with outliers) in doubling metrics. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 814\u2013825 (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00082","key":"13_CR23","DOI":"10.1109\/FOCS.2018.00082"},{"unstructured":"Huang, L., Jiang, S.H., Lou, J.: The power of uniform sampling for k-median. CoRR abs\/2302.11339. arXiv arXiv:2302.11339 (2023)","key":"13_CR24"},{"unstructured":"Huang, L., Jiang, S.H., Vishnoi, N.K.: Coresets for clustering with fairness constraints. In: NeurIPS, pp. 7587\u20137598 (2019)","key":"13_CR25"},{"unstructured":"Huang, L., Li, J., Wu, X.: Towards optimal coreset construction for $$(k, z)$$-clustering: breaking the quadratic dependency on $$k$$. CoRR abs\/2211.11923. arXiv arXiv:2211.11923 (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.11923","key":"13_CR26"},{"doi-asserted-by":"publisher","unstructured":"Huang, L., Vishnoi, N.K.: Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22\u201326 June 2020, pp. 1416\u20131429. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384296","key":"13_CR27","DOI":"10.1145\/3357713.3384296"},{"unstructured":"Huggins, J., Campbell, T., Broderick, T.: Coresets for scalable Bayesian logistic regression. In: Advances in Neural Information Processing Systems, pp. 4080\u20134088 (2016)","key":"13_CR28"},{"doi-asserted-by":"publisher","unstructured":"Indyk, P., Mahabadi, S., Gharan, S.O., Rezaei, A.: Composable core-sets for determinant maximization problems via spectral spanners. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5\u20138 January 2020, pp. 1675\u20131694. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.103","key":"13_CR29","DOI":"10.1137\/1.9781611975994.103"},{"doi-asserted-by":"publisher","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Hull, R., Grohe, M. (eds.) Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2014, Snowbird, UT, USA, 22\u201327 June 2014, pp. 100\u2013108. ACM (2014). https:\/\/doi.org\/10.1145\/2594538.2594560","key":"13_CR30","DOI":"10.1145\/2594538.2594560"},{"unstructured":"Jiang, S.H., Krauthgamer, R., Lou, J., Zhang, Y.: Coresets for kernel clustering. CoRR abs\/2110.02898 (2021). https:\/\/arxiv.org\/abs\/2110.02898","key":"13_CR31"},{"unstructured":"Jubran, I., Shayda, E.E.S., Newman, I., Feldman, D.: Coresets for decision trees of signals. CoRR abs\/2110.03195 (2021)","key":"13_CR32"},{"unstructured":"Karnin, Z.S., Liberty, E.: Discrepancy, coresets, and sketches in machine learning. In: Beygelzimer, A., Hsu, D. (eds.) Conference on Learning Theory, COLT 2019, 25\u201328 June 2019, Phoenix, AZ, USA, vol. 99, pp. 1975\u20131993. Proceedings of Machine Learning Research (PMLR) (2019). http:\/\/proceedings.mlr.press\/v99\/karnin19a.html","key":"13_CR33"},{"doi-asserted-by":"crossref","unstructured":"Langberg, M., Schulman, L.J.: Universal $$\\varepsilon $$-approximators for integrals. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17\u201319 January 2010, pp. 598\u2013607 (2010)","key":"13_CR34","DOI":"10.1137\/1.9781611973075.50"},{"doi-asserted-by":"publisher","unstructured":"Mahabadi, S., Makarychev, K., Makarychev, Y., Razenshteyn, I.P.: Nonlinear dimension reduction via outer Bi-Lipschitz extensions. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 1088\u20131101 (2018). https:\/\/doi.org\/10.1145\/3188745.3188828. http:\/\/doi.acm.org\/10.1145\/3188745.3188828","key":"13_CR35","DOI":"10.1145\/3188745.3188828"},{"doi-asserted-by":"publisher","unstructured":"Makarychev, K., Makarychev, Y., Razenshteyn, I.P.: Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1027\u20131038 (2019). https:\/\/doi.org\/10.1145\/3313276.3316350. https:\/\/doi.org\/10.1145\/3313276.3316350","key":"13_CR36","DOI":"10.1145\/3313276.3316350"},{"doi-asserted-by":"publisher","unstructured":"Munteanu, A., Schwiegelshohn, C.: Coresets-methods and history: a theoreticians design pattern for approximation and streaming algorithms. K\u00fcnstliche Intell. 32(1), 37\u201353 (2018). https:\/\/doi.org\/10.1007\/s13218-017-0519-3. https:\/\/doi.org\/10.1007\/s13218-017-0519-3","key":"13_CR37","DOI":"10.1007\/s13218-017-0519-3"},{"unstructured":"Munteanu, A., Schwiegelshohn, C., Sohler, C., Woodruff, D.P.: On coresets for logistic regression. In: Bengio, S., Wallach, H.M., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3\u20138 December 2018, Montr\u00e9al, Canada, pp. 6562\u20136571 (2018)","key":"13_CR38"},{"doi-asserted-by":"publisher","unstructured":"Narayanan, S., Nelson, J.: Optimal terminal dimensionality reduction in Euclidean space. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1064\u20131069. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316307","key":"13_CR39","DOI":"10.1145\/3313276.3316307"},{"doi-asserted-by":"publisher","unstructured":"Phillips, J.M., Tai, W.M.: Near-optimal coresets of kernel density estimates. Discret. Comput. Geom. 63(4), 867\u2013887 (2020). https:\/\/doi.org\/10.1007\/s00454-019-00134-6","key":"13_CR40","DOI":"10.1007\/s00454-019-00134-6"},{"doi-asserted-by":"publisher","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair k-means. In: 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, Revised Selected Papers, Munich, Germany, 12\u201313 September 2019, pp. 232\u2013251 (2019). https:\/\/doi.org\/10.1007\/978-3-030-39479-0_16","key":"13_CR41","DOI":"10.1007\/978-3-030-39479-0_16"},{"doi-asserted-by":"crossref","unstructured":"Sohler, C., Woodruff, D.P.: Strong coresets for k-median and subspace approximation: goodbye dimension. CoRR abs\/1809.02961 (2018). http:\/\/arxiv.org\/abs\/1809.02961","key":"13_CR42","DOI":"10.1109\/FOCS.2018.00081"},{"unstructured":"Tukan, M., Maalouf, A., Feldman, D.: Coresets for near-convex functions. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, Virtual, 6\u201312 December 2020 (2020)","key":"13_CR43"},{"doi-asserted-by":"publisher","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theoret. Comput. Sci. 10(1\u20132), 1\u2013157 (2014). https:\/\/doi.org\/10.1561\/0400000060","key":"13_CR44","DOI":"10.1561\/0400000060"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49361-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T05:03:18Z","timestamp":1702443798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49361-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,14]]},"ISBN":["9783031493607","9783031493614"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49361-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,14]]},"assertion":[{"value":"14 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"5 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/","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":"24","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":"13","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":"54% - 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":"4","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)"}}]}}