{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:50:02Z","timestamp":1768920602497,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030983642","type":"print"},{"value":"9783030983659","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98365-9_6","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T07:03:04Z","timestamp":1647068584000},"page":"95-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Performance Bounds for\u00a0QC-MDPC Codes Decoders"],"prefix":"10.1007","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Barenghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerardo","family":"Pelosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"key":"6_CR1","unstructured":"Alagic, G., et al.: Status report on the second round of the NIST post-quantum cryptography standardization process. https:\/\/csrc.nist.gov\/publications\/ detail\/nistir\/8309\/final"},{"key":"6_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece: conservative code-based cryptography. https:\/\/classic.mceliece.org\/"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-030-56877-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Apon","year":"2020","unstructured":"Apon, D., Perlner, R., Robinson, A., Santini, P.: Cryptanalysis of LEDAcrypt. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 389\u2013418. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_14"},{"key":"6_CR4","unstructured":"Aragon, N., et al.: BIKE: bit flipping key encapsulation. https:\/\/bikesuite.org"},{"issue":"10","key":"6_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3390\/a12100209","volume":"12","author":"M Baldi","year":"2019","unstructured":"Baldi, M., et al.: A finite regime analysis of information set decoding algorithms. Algorithms 12(10), 209 (2019)","journal-title":"Algorithms"},{"key":"6_CR6","series-title":"Springer Briefs in Electrical and Computer Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02556-8","volume-title":"QC-LDPC Code-Based Cryptography","author":"M Baldi","year":"2014","unstructured":"Baldi, M.: QC-LDPC Code-Based Cryptography. Springer Briefs in Electrical and Computer Engineering, Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-02556-8"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, M., et al.: A failure rate model of bit-flipping decoders for QC-LDPC and QC-MDPC code-based cryptosystems. In: Proceedings of 17th International Joint Conference on e-Business and Telecommunications (ICETE), Secrypt 2020, 17th International Conference on Security and Cryptography, Paris, France, 8\u201310 July 2020, pp. 238\u2013249 (2020)","DOI":"10.5220\/0009891702380249"},{"key":"6_CR8","unstructured":"Baldi, M., et al.: LEDAcrypt: Low-dEnsity parity-check coDe-bAsed cryptographic systems. https:\/\/www.ledacrypt.org\/"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1049\/iet-ifs.2018.5207","volume":"13","author":"M Baldi","year":"2019","unstructured":"Baldi, M., et al.: Security of generalised Reed-Solomon code-based cryptosystems. IET Inf. Secur. 13(4), 404\u2013410 (2019)","journal-title":"IET Inf. Secur."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding Random Binary Linear Codes in 2$$^{n\/20}$$: How 1+1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-79063-3_2","volume-title":"Post-Quantum Cryptography","author":"L Both","year":"2018","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Canto-Torres, R., Tillich, J.: Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor. In: Proceedings IEEE International Symposium on Information Theory (ISIT 2019), Paris, France, 7\u201312 July 2019, pp. 1927\u20131931 (2019)","DOI":"10.1109\/ISIT.2019.8849628"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., et al.: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Designs Codes Crypt. 73(2), 641\u2013666 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9967-z","journal-title":"Designs Codes Crypt."},{"key":"6_CR15","unstructured":"Das, S.: A brief note on estimates of binomial coefficients (2016). http:\/\/page.mi.fu-berlin.de\/shagnik\/notes\/binomials.pdf"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s13389-018-00200-4","volume":"9","author":"N Drucker","year":"2019","unstructured":"Drucker, N., Gueron, S.: A toolbox for software optimization of QC-MDPC code-based cryptosystems. J. Cryptogr. Eng. 9(4), 341\u2013357 (2019). https:\/\/doi.org\/10.1007\/s13389-018-00200-4","journal-title":"J. Cryptogr. Eng."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-44223-1_3","volume-title":"Post-Quantum Cryptography","author":"N Drucker","year":"2020","unstructured":"Drucker, N., Gueron, S., Kostic, D.: QC-MDPC decoders with several shades of gray. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 35\u201350. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_3"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-79063-3_3","volume-title":"Post-Quantum Cryptography","author":"E Eaton","year":"2018","unstructured":"Eaton, E., Lequesne, M., Parent, A., Sendrier, N.: QC-MDPC: a timing attack and\u00a0a\u00a0CCA2 KEM. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 47\u201376. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_3"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"key":"6_CR20","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T Press, Cambridge (1963)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-53887-6_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"Q Guo","year":"2016","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 789\u2013815. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_29"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-70500-2_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2017","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3934\/amc.2020053","volume":"15","author":"K Khathuria","year":"2021","unstructured":"Khathuria, K., Rosenthal, J., Weger, V.: Encryption scheme based on expanded Reed-Solomon codes. Adv. Math. Commun. 15(2), 207\u2013218 (2021)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10623-015-0099-x","volume":"80","author":"C L\u00f6ndahl","year":"2015","unstructured":"L\u00f6ndahl, C., Johansson, T., Koochak Shooshtari, M., Ahmadian-Attari, M., Aref, M.R.: Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension. Designs Codes Crypt. 80(2), 359\u2013377 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0099-x","journal-title":"Designs Codes Crypt."},{"key":"6_CR25","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Progress Report, pp. 114\u2013116 (1978)"},{"key":"6_CR26","unstructured":"National Institute of Standards and Technology. NIST Post-Quantum Standardization Process (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"6_CR27","unstructured":"Ouzan, S., Be\u2019ery, Y.: Moderate-density parity-check codes (2009). https:\/\/arxiv.org\/abs\/0911.3262"},{"issue":"4","key":"6_CR28","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1109\/18.335935","volume":"40","author":"G Poltyrev","year":"1994","unstructured":"Poltyrev, G.: Bounds on the decoding error probability of binary linear codes via their spectra. IEEE Trans. Inf. Theory 40(4), 1284\u20131292 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT 2013). Istanbul, Turkey, 7\u201312 July 2013, pp. 2069\u20132073 (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-25922-8_7","volume-title":"Code-Based Cryptography","author":"P Santini","year":"2019","unstructured":"Santini, P., Battaglioni, M., Chiaraluce, F., Baldi, M.: Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes. In: Baldi, M., Persichetti, E., Santini, P. (eds.) CBC 2019. LNCS, vol. 11666, pp. 115\u2013136. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25922-8_7"},{"issue":"8","key":"6_CR31","doi-asserted-by":"publisher","first-page":"4648","DOI":"10.1109\/TCOMM.2020.2987898","volume":"68","author":"P Santini","year":"2020","unstructured":"Santini, P., et al.: Analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography. IEEE Trans. Commun. 68(8), 4648\u20134660 (2020)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Santini, P., et al.: Hard-decision iterative decoding of LDPC codes with bounded error rate. In: Proceedings of IEEE International Conference on Communications (ICC 2019), Shanghai, China, 20\u201324 May 2019 (2019)","DOI":"10.1109\/ICC.2019.8761536"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-44223-1_2","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2020","unstructured":"Sendrier, N., Vasseur, V.: About low DFR for QC-MDPC decoding. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 20\u201334. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_2"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-25510-7_22","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2019","unstructured":"Sendrier, N., Vasseur, V.: On the decoding failure rate of QC-MDPC bit-flipping decoders. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 404\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_22"},{"key":"6_CR36","unstructured":"Sendrier, N., Vasseur, V.: On the existence of weak keys for QC-MDPC decoding. Cryptology ePrint Archive, Report 2020\/1232 (2020). https:\/\/eprint.iacr.org\/ 2020\/1232"},{"issue":"4","key":"6_CR37","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discret. Math. Appl. 2(4), 439\u2013444 (1992)","journal-title":"Discret. Math. Appl."},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Tillich, J.-P.: The decoding failure probability of MDPC codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT 2018), Vail, CO, USA, 17\u201322 June 2018, pp. 941\u2013945 (2018)","DOI":"10.1109\/ISIT.2018.8437843"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto Torres","year":"2016","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"issue":"6","key":"6_CR40","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR41","unstructured":"Vasseur, V.: Post-quantum cryptography: study on the decoding of QC-MDPC codes. Ph.D. thesis (2021)"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98365-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T22:22:16Z","timestamp":1674944536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98365-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983642","9783030983659"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98365-9_6","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":"13 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbcrypto.dii.univpm.it\/home","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":"14","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":"6","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":"43% - 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":"1","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":"The workshop was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}