{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T05:04:34Z","timestamp":1769317474430,"version":"3.49.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229688","type":"print"},{"value":"9783031229695","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22969-5_23","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"677-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Log-$$\\mathcal {S}$$-unit Lattices Using Explicit Stickelberger Generators to\u00a0Solve Approx Ideal-SVP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3410-3134","authenticated-orcid":false,"given":"Olivier","family":"Bernard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8318-4922","authenticated-orcid":false,"given":"Andrea","family":"Lesavourey","sequence":"additional","affiliation":[]},{"given":"Tuong-Huy","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0617-9606","authenticated-orcid":false,"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"issue":"191","key":"23_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"\u00c9 Bach","year":"1990","unstructured":"Bach, \u00c9.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355\u2013380 (1990)","journal-title":"Math. Comput."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbol. Comput. 24(3\u20134), 235\u2013265 (1997). Computational Algebra and Number Theory (London, 1993)","DOI":"10.1006\/jsco.1996.0125"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Belabas, K., Diaz, F., Diaz, E.: Friedman: small generators of the ideal class group. Math. Comput. 77(262), 1185\u20131197 (2008)","DOI":"10.1090\/S0025-5718-07-02003-0"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-56880-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"K de Boer","year":"2020","unstructured":"de Boer, K., Ducas, L., Pellet-Mary, A., Wesolowski, B.: Random self-reducibility of ideal-SVP via Arakelov random walks. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 243\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_9"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-56620-7_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J-F Biasse","year":"2017","unstructured":"Biasse, J.-F., Espitau, T., Fouque, P.-A., G\u00e9lin, A., Kirchner, P.: Computing generator in cyclotomic integer rings. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 60\u201388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_3"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Biasse, J., Fieker, C.: Subexponential class group and unit group computation in large degree number fields. LMS J. Comput. Math. 17(A), 385\u2013403 (2014)","DOI":"10.1112\/S1461157014000345"},{"key":"23_CR8","unstructured":"Biasse, J., Fieker, C., Hofmann, T., Page, A.: Norm relations and computational problems in number fields. arXiv:2002.12332v3 [math.NT] (2021)"},{"key":"23_CR9","unstructured":"Bernard, O., Ku\u010dera, R., A short basis of the Stickelberger ideal of a cyclotomic field. arXiv:2109.13329 [math.NT] (2021)"},{"key":"23_CR10","unstructured":"Bernstein, D.J., Lange, T.: Non-randomness of s-unit lattices. Cryptology ePrint Archive, Report 2021\/1428 (2021)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Bernard, O., Lesavourey, A., Nguyen, T., Roux-Langlois, A.: Log-$$\\cal{S} $$-unit lattices using explicit Stickelberger generators to solve Approx Ideal-SVP (full version). Cryptology ePrint Archive, Report 2021\/1384 (2021)","DOI":"10.1007\/978-3-031-22969-5_23"},{"key":"23_CR12","first-page":"149","volume":"41","author":"J Buhler","year":"2004","unstructured":"Buhler, J., Pomerance, C., Robertson, L.: Heuristics for class numbers of prime-power real cyclotomic fields. Fields Inst. Commun. 41, 149\u2013157 (2004)","journal-title":"Fields Inst. Commun."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-64834-3_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"O Bernard","year":"2020","unstructured":"Bernard, O., Roux-Langlois, A.: Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 349\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_12"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: SODA, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-56620-7_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Cramer","year":"2017","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Short stickelberger class relations and application to ideal-SVP. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 324\u2013348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_12"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Cramer, R., Ducas, L., Wesolowski, B.: Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. J. ACM 68(2) (2021)","DOI":"10.1145\/3431725"},{"key":"23_CR18","unstructured":"Campbell, P., Groves, M., Shepherd, D.: Soliloquy: a cautionary tale (2014). http:\/\/docbox.etsi.org\/Workshop\/2014\/201410_CRYPTO\/S07_Systems_and_Attacks\/S07_Groves_Annex.pdf"},{"key":"23_CR19","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e8te du chiffrement compl\u00e8tement homomorphe. Ph.D. thesis, Paris 7 (2013)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-26948-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"L Ducas","year":"2019","unstructured":"Ducas, L., Plan\u00e7on, M., Wesolowski, B.: On the shortness of vectors to be found by the ideal-SVP quantum algorithm. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 322\u2013351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_12"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A.Y., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: STOC, pp. 293\u2013302. ACM (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"23_CR23","unstructured":"FpLLL development team: FpLLL, a lattice reduction library (2016). https:\/\/github.com\/fplll\/fplll"},{"issue":"1","key":"23_CR24","first-page":"13","volume":"71","author":"R Gold","year":"1989","unstructured":"Gold, R., Kim, J.: Bases for cyclotomic units. Compos. Math. 71(1), 13\u201327 (1989)","journal-title":"Compos. Math."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"23_CR26","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 4th edn. Oxford University Press, Oxford (1938)"},{"issue":"1","key":"23_CR27","first-page":"7","volume":"22","author":"R Ku\u010dera","year":"1986","unstructured":"Ku\u010dera, R.: On a certain subideal of the Stickelberger ideal of a cyclotomic field. Archivum Mathematicum 22(1), 7\u201319 (1986)","journal-title":"Archivum Mathematicum"},{"issue":"3","key":"23_CR28","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0022-314X(92)90003-8","volume":"40","author":"R Ku\u010dera","year":"1992","unstructured":"Ku\u010dera, R.: On bases of the Stickelberger ideal and of the group of circular units of a cyclotomic field. J. Number Theory 40(3), 284\u2013316 (1992)","journal-title":"J. Number Theory"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-69453-5_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"T Laarhoven","year":"2017","unstructured":"Laarhoven, T.: Sieving for closest lattice vectors (with preprocessing). In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 523\u2013542. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_28"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems. Kluwer International Series in Engineering and Computer Science, vol. 671. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0897-7","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"23_CR33","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1112\/S1461157014000382","volume":"17","author":"JC Miller","year":"2014","unstructured":"Miller, J.C.: Class numbers of real cyclotomic fields of composite conductor. LMS J. Comput. Math. 17, 404\u2013417 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"23_CR34","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07001-7","volume-title":"Elementary and Analytic Theory of Algebraic Numbers","author":"W Narkiewicz","year":"2004","unstructured":"Narkiewicz, W.: Elementary and Analytic Theory of Algebraic Numbers. Springer Monographs in Mathematics, 3rd edn. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07001-7","edition":"3"},{"key":"23_CR35","doi-asserted-by":"publisher","unstructured":"Neukirch, J.: Algebraic Number Theory. Grundlehren des mathematischen Wissenschaften, vol. 322. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/978-3-319-07545-7","DOI":"10.1007\/978-3-319-07545-7"},{"key":"23_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-030-17656-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Pellet-Mary","year":"2019","unstructured":"Pellet-Mary, A., Hanrot, G., Stehl\u00e9, D.: Approx-SVP in ideal lattices with pre-processing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 685\u2013716. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_24"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Pohst, M., Zassenhaus, H.: Algorithmic Algebraic Number Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1989)","DOI":"10.1017\/CBO9780511661952"},{"key":"23_CR38","unstructured":"Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.0), (2020). https:\/\/www.sagemath.org"},{"key":"23_CR39","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"242","key":"23_CR40","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1090\/S0025-5718-02-01432-1","volume":"72","author":"R Schoof","year":"2003","unstructured":"Schoof, R.: Class numbers of real cyclotomic fields of prime conductor. Math. Comput. 72(242), 913\u2013937 (2003)","journal-title":"Math. Comput."},{"key":"23_CR41","series-title":"Universitext","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-185-5","volume-title":"Catalan\u2019s Conjecture","author":"R Schoof","year":"2008","unstructured":"Schoof, R.: Catalan\u2019s Conjecture. Universitext, Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-84800-185-5"},{"key":"23_CR42","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"23_CR43","doi-asserted-by":"publisher","first-page":"107","DOI":"10.2307\/1970932","volume":"108","author":"W Sinnott","year":"1978","unstructured":"Sinnott, W.: On the Stickelberger ideal and the circular units of a cyclotomic field. Ann. Math. 108(1), 107\u2013134 (1978)","journal-title":"Ann. Math."},{"key":"23_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01389158","volume":"62","author":"W Sinnott","year":"1980","unstructured":"Sinnott, W.: On the Stickelberger ideal and the circular units of an abelian field. Invent. Math. 62, 181\u2013234 (1980)","journal-title":"Invent. Math."},{"key":"23_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields. Graduate Texts in Mathematics, 2 edn, vol. 83. Springer, New York (1997)","DOI":"10.1007\/978-1-4612-1934-7"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Generating subgroups of ray class groups with small prime ideals. In: ANTS-XIII. The Open Book Series, vol. 2, pp. 461\u2013478, Mathematical Sciences Publisher (2018)","DOI":"10.2140\/obs.2019.2.461"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22969-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:07Z","timestamp":1769216587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22969-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229688","9783031229695"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22969-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"364","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":"98","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":"27% - 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":"10","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"}]}}