{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:28:52Z","timestamp":1778128132830,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486173","type":"print"},{"value":"9783031486180","type":"electronic"}],"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-48618-0_14","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T17:02:02Z","timestamp":1701018122000},"page":"406-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Near-Optimal Private Information Retrieval with\u00a0Preprocessing"],"prefix":"10.1007","author":[{"given":"Arthur","family":"Lazzaretti","sequence":"first","affiliation":[]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 962\u2013979 (2018). https:\/\/doi.org\/10.1109\/SP.2018.00062. ISSN: 2375-1207","DOI":"10.1109\/SP.2018.00062"},{"key":"14_CR2","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: Proceedings of the 12th USENIX conference on Operating Systems Design and Implementation, pp. 551\u2013569. OSDI2016, USENIX Association, USA (2016)"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Backes, M., Kate, A., Maffei, M., Pecina, K.: ObliviAd: provably secure and practical online behavioral advertising. In: 2012 IEEE Symposium on Security and Privacy, pp. 257\u2013271 (2012). https:\/\/doi.org\/10.1109\/SP.2012.25. ISSN: 2375-1207","DOI":"10.1109\/SP.2012.25"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/3-540-48224-5_74","volume-title":"Automata, Languages and Programming","author":"A Beimel","year":"2001","unstructured":"Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: a unified construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 912\u2013926. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_74"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44598-6_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 55\u201373. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_4"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bell, J.H., Bonawitz, K.A., Gasc\u00f3n, A., Lepoint, T., Raykova, M.: Secure single-server aggregation with (poly)logarithmic overhead. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1253\u20131269. CCS 2020, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3417885","DOI":"10.1145\/3372297.3417885"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-56620-7_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Kim, S., Montgomery, H.: Private puncturable PRFs from standard lattice assumptions. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 415\u2013445. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_15"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70500-2_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2017","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and more) from LWE. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 264\u2013302. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_10"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-56620-7_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Chen, Y.: Constraint-hiding constrained PRFs for NC$$^1$$ from LWE. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 446\u2013476. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_16"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval, p. 41. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492461. https:\/\/www.computer.org\/csdl\/proceedings-article\/focs\/1995\/71830041\/12OmNzYNNfi. ISSN: 0272-5428","DOI":"10.1109\/SFCS.1995.492461"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 304\u2013313. STOC 1997, Association for Computing Machinery, New York, NY, USA (1997). https:\/\/doi.org\/10.1145\/258533.258609","DOI":"10.1145\/258533.258609"},{"key":"14_CR13","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords (1998). https:\/\/eprint.iacr.org\/1998\/003. Report Number: 003"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","DOI":"10.1145\/293347.293350"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with sublinear amortized time. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13276. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-45721-1_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Corrigan-Gibbs","year":"2020","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 44\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49099-0_6","volume-title":"Theory of Cryptography","author":"S Devadas","year":"2016","unstructured":"Devadas, S., van Dijk, M., Fletcher, C.W., Ren, L., Shi, E., Wichs, D.: Onion ORAM: a constant bandwidth blowup oblivious ram. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 145\u2013174. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_6"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Universal service-providers for private information retrieval. J. Cryptol. 14(1), 37\u201374 (2001)","DOI":"10.1007\/s001450010008"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"G Di Crescenzo","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 122\u2013138. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_10"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-11203-9_22","volume-title":"Computer Security - ESORICS 2014","author":"C Dong","year":"2014","unstructured":"Dong, C., Chen, L.: A fast single server private information retrieval protocol with low communication cost. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 380\u2013399. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_22"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Gopi, S.: 2-server PIR with subpolynomial communication. J. ACM 63(4), 1\u201315 (2016)","DOI":"10.1145\/2968443"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Efremenko, K.: 3-query locally decodable codes of subexponential length. SIAM J. Comput. 41(6), 1694\u20131703 (2012)","DOI":"10.1137\/090772721"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-53015-3_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Garg","year":"2016","unstructured":"Garg, S., Mohassel, P., Papamanthou, C.: TWORAM: efficient oblivious ram in two rounds with applications to searchable encryption. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 563\u2013592. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_20"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM symposium on Symposium on Theory of Computing - STOC 2009, p. 169. ACM Press, Bethesda, MD, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_65"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (Extended Abstract). In: FOCS (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715949","DOI":"10.1109\/SFCS.1984.715949"},{"key":"14_CR28","unstructured":"Gupta, T., Crooks, N., Mulhern, W., Setty, S., Alvisi, L., Walfish, M.: Scalable and private media consumption with Popcorn. In: Proceedings of the 13th USENIX Conference on Networked Systems Design and Implementation, pp. 91\u2013107. NSDI2016, USENIX Association, USA (2016)"},{"key":"14_CR29","unstructured":"Kazama, K., Kamatsuka, A., Yoshida, T., Matsushima, T.: A note on a relationship between smooth locally decodable codes and private information retrieval. In: 2020 International Symposium on Information Theory and Its Applications (ISITA), pp. 259\u2013263 (2020). ISSN: 2689\u20135854"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Leonardos, N., Lipmaa, H., Pavlyk, K., Tang, Q.: Optimal rate private information retrieval from homomorphic encryption. Proceed. Privacy Enhan. Technol. 2015(2), 222\u2013243 (2015)","DOI":"10.1515\/popets-2015-0016"},{"key":"14_CR31","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private blocklist lookups with checklist. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 875\u2013892. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/kogan"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373. IEEE Comput. Soc, Miami Beach, FL, USA (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646125. https:\/\/ieeexplore.ieee.org\/document\/646125\/","DOI":"10.1109\/SFCS.1997.646125"},{"key":"14_CR33","unstructured":"Lazzaretti, A., Papamanthou, C.: Near-optimal private information retrieval with preprocessing (2022). https:\/\/eprint.iacr.org\/2022\/830. Publication info: Preprint"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314\u2013328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11556992_23"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Pavlyk, K.: A simpler rate-optimal CPIR protocol. In: Financial Cryptography and Data Security 2017 (2017). https:\/\/eprint.iacr.org\/2017\/722","DOI":"10.1007\/978-3-319-70972-7_35"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Mughees, M.H., Chen, H., Ren, L.: OnionPIR: response efficient single-server PIR. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2292\u20132306. CCS 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3460120.3485381","DOI":"10.1145\/3460120.3485381"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-030-84259-8_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Shi","year":"2021","unstructured":"Shi, E., Aqeel, W., Chandrasekaran, B., Maggs, B.: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 641\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_22"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Singanamalla, S., et al.: Oblivious DNS over HTTPS (ODoH): a practical privacy enhancement to DNS. In: Proceedings on Privacy Enhancing Technologies 2021(4), 575\u2013592 (2021)","DOI":"10.2478\/popets-2021-0085"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1), 1\u201316 (2008)","DOI":"10.1145\/1326554.1326555"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Yekhanin, S.: Locally decodable codes and private information retrieval schemes. Information Security and Cryptography, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14358-8","DOI":"10.1007\/978-3-642-14358-8"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Zhou, M., Lin, W.K., Tselekounis, Y., Shi, E.: Optimal single-server private information retrieval. ePrint IACR (2022)","DOI":"10.1007\/978-3-031-30545-0_14"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48618-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:43Z","timestamp":1764118963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48618-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486173","9783031486180"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48618-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","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":"68","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":"40% - 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":"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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}