{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T20:35:53Z","timestamp":1786826153579,"version":"3.56.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385537","type":"print"},{"value":"9783031385544","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-38554-4_15","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"455-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Revisiting the\u00a0Constant-Sum Winternitz One-Time Signature with\u00a0Applications to\u00a0$$\\text {SPHINCS}^+$$ and\u00a0XMSS"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2294-3523","authenticated-orcid":false,"given":"Kaiyi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6203-413X","authenticated-orcid":false,"given":"Hongrui","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, D.: M\u00e9moire sur les combinaisons r\u00e9guli\u00e8res et leurs applications. In: Annales scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure, vol. 5, pp. 155\u2013198 (1876)","DOI":"10.24033\/asens.136"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-76953-0_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"J-P Aumasson","year":"2018","unstructured":"Aumasson, J.-P., Endignoux, G.: Improving stateless hash-based signatures. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 219\u2013242. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_12"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00009-019-1457-0","volume":"17","author":"H Belbachir","year":"2020","unstructured":"Belbachir, H., Igueroufa, O.: Congruence properties for Bi$$^s$$ nomial coefficients and like extended Ram and Kummer theorems under suitable hypothesis. Mediterr. J. Math. 17(1), 1\u201314 (2020)","journal-title":"Mediterr. J. Math."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-46800-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J., et al.: SPHINCS: practical stateless hash-based signatures. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 368\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$$^+$$ signature framework. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 2129\u20132146. ACM Press (11\u201315 Nov 2019). https:\/\/doi.org\/10.1145\/3319535.3363229","DOI":"10.1145\/3319535.3363229"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-48658-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"D Bleichenbacher","year":"1994","unstructured":"Bleichenbacher, D., Maurer, U.M.: Directed Acyclic Graphs, One-way Functions and Digital Signatures. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 75\u201382. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_9"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0034843","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"D Bleichenbacher","year":"1996","unstructured":"Bleichenbacher, D., Maurer, U.: On the efficiency of one-time digital signatures. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 145\u2013158. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034843"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-60922-9_30","volume-title":"STACS 96","author":"D Bleichenbacher","year":"1996","unstructured":"Bleichenbacher, D., Maurer, U.M.: Optimal tree-based one-time digital signature schemes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 361\u2013374. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_30"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48071-4_1","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"JNE Bos","year":"1993","unstructured":"Bos, J.N.E., Chaum, D.: Provably unforgeable signatures. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 1\u201314. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_1"},{"key":"15_CR10","first-page":"208","volume":"800","author":"DA Cooper","year":"2020","unstructured":"Cooper, D.A., et al.: Recommendation for stateful hash-based signature schemes. NIST Spec. Publ. 800, 208 (2020)","journal-title":"NIST Spec. Publ."},{"key":"15_CR11","unstructured":"Cruz, J.P., Yatani, Y., Kaji, Y.: Constant-sum fingerprinting for Winternitz one-time signature. In: 2016 International Symposium on Information Theory and Its Applications (ISITA), pp. 703\u2013707. IEEE (2016)"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. In: Classic Papers in Combinatorics, pp. 139\u2013144. Springer (2009). https:\/\/doi.org\/10.1007\/978-1-4899-3558-8_1","DOI":"10.1007\/978-1-4899-3558-8_1"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Dods, C., Smart, N.P., Stam, M.: Hash based digital signature schemes. In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol. 3796, pp. 96\u2013115. Springer, Heidelberg (19\u201321 Dec 2005). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_3","DOI":"10.1007\/978-3-540-88702-7_3"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Dworkin, M.: SHA-3 standard: Permutation-based hash and extendable-output functions (Aug 2015). https:\/\/doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"15_CR15","unstructured":"Euler, L.: De evolutione potestatis polynomialis cuiuscunque $$(1 + x + x^2 + x^3+ x^4 + \\text{etc.})^n$$. Nova Acta Academiae Scientiarum Imperialis Petropolitanae, pp. 47\u201357 (1801)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-47721-7_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O.: Two remarks concerning the Goldwasser-Micali-Rivest signature scheme. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 104\u2013110. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_8"},{"key":"15_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"15_CR18","unstructured":"Gueron, S., Mouha, N.: SPHINCS-simpira: Fast stateless hash-based signatures with post-quantum security. Cryptology ePrint Archive, Report 2017\/645 (2017). http:\/\/eprint.iacr.org\/2017\/645"},{"key":"15_CR19","unstructured":"Hash Based Signature: XMSS-i. https:\/\/github.com\/hashbasedsignature\/xmss-i (2022)"},{"key":"15_CR20","unstructured":"Hash Based Signature: CSWOTS. https:\/\/github.com\/hashbasedsignature\/cswots (2023)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36178-2_24","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"A Hevia","year":"2002","unstructured":"Hevia, A., Micciancio, D.: The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 379\u2013396. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_24"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-38553-7_10","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"A H\u00fclsing","year":"2013","unstructured":"H\u00fclsing, A.: W-OTS+ \u2013 shorter signatures for hash-based signature schemes. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 173\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Butin, D., Gazdag, S.L., Rijneveld, J., Mohaisen, A.: XMSS: extended merkle signature scheme. In: RFC 8391. IRTF (2018)","DOI":"10.17487\/RFC8391"},{"key":"15_CR24","unstructured":"H\u00fclsing, A., Kudinov, M.: Recovering the tight security proof of SPHINCS$$^{+}$$. Cryptology ePrint Archive, Paper 2022\/346 (2022). https:\/\/eprint.iacr.org\/2022\/346"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"K\u00f6lbl, S., Lauridsen, M.M., Mendel, F., Rechberger, C.: Haraka v2 - Efficient short-input hashing for post-quantum applications. IACR Trans, Symmetric Cryptology 2016(2), 1\u201329 (2016). https:\/\/doi.org\/10.13154\/tosc.v2016.i2.1-29, http:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/563","DOI":"10.13154\/tosc.v2016.i2.1-29"},{"key":"15_CR26","unstructured":"Kudinov, M., H\u00fclsing, A., Ronen, E., Yogev, E.: SPHINCS+C: Compressing SPHINCS+ with (almost) no cost. Cryptology ePrint Archive, Paper 2022\/778 (2022). https:\/\/eprint.iacr.org\/2022\/778"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4213\/mvk362","volume":"12","author":"MA Kudinov","year":"2021","unstructured":"Kudinov, M.A., Kiktenko, E.O., Fedorov, A.K.: Security analysis of the W-OTS$$^+$$ signature scheme: Updating security bounds. Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] 12(2), 129\u2013145 (2021). https:\/\/doi.org\/10.4213\/mvk362","journal-title":"Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]"},{"key":"15_CR28","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (Oct 1979)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"McGrew, D., Curcio, M., Fluhrer, S.: Leighton-Micali hash-based signatures. In: RFC 8554. IRTF (2019)","DOI":"10.17487\/RFC8554"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"15_CR32","unstructured":"Moody, D.: Parameter selection for the selected algorithms (2022). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/4MBurXr58Rs\/m\/lj4VRfAnFwAJ"},{"key":"15_CR33","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Secure hash standard (2015-08-04 2015). https:\/\/doi.org\/10.6028\/NIST.FIPS.180-4","DOI":"10.6028\/NIST.FIPS.180-4"},{"key":"15_CR34","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13389-021-00264-9","volume":"11","author":"LP Perin","year":"2021","unstructured":"Perin, L.P., Zambonin, G., Cust\u00f3dio, R., Moura, L., Panario, D.: Improved constant-sum encodings for hash-based signatures. J. Cryptogr. Eng. 11, 329\u2013351 (2021)","journal-title":"J. Cryptogr. Eng."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Perlner, R., Kelsey, J., Cooper, D.: Breaking category five SPHINCS+ with SHA-256. Cryptology ePrint Archive, Paper 2022\/1061 (2022). https:\/\/eprint.iacr.org\/2022\/1061","DOI":"10.1007\/978-3-031-17234-2_23"},{"key":"15_CR36","unstructured":"Rabin, M.O.: Digitalized signatures. Foundations of secure computation, pp. 155\u2013168 (1978)"},{"key":"15_CR37","unstructured":"Rijneveld, J., H\u00fclsing, A., Cooper, D., Westerbaan, B.: The XMSS reference code (2022). https:\/\/github.com\/XMSS\/xmss-reference"},{"issue":"1","key":"15_CR38","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein satz \u00fcber untermengen einer endlichen menge. Math. Z. 27(1), 544\u2013548 (1928)","journal-title":"Math. Z."},{"key":"15_CR39","unstructured":"Team, TNP: PQC standardization process: Announcing four candidates to be standardized, plus fourth round candidates. NIST (2022). https:\/\/csrc.nist.gov\/News\/2022\/pqc-candidates-to-be-standardized-and-round-4"},{"key":"15_CR40","unstructured":"The SPHINCS+ Team: The SPHINCS+ reference code, accompanying the submission to NIST\u2019s post-quantum cryptography project (2021). https:\/\/github.com\/sphincs\/sphincsplus"},{"key":"15_CR41","series-title":"International Centre for Mechanical Sciences","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-7091-2786-5_19","volume-title":"Eurocode \u201992","author":"S Vaudenay","year":"1993","unstructured":"Vaudenay, S.: One-time identification with low memory. In: Camion, P., Charpin, P., Harari, S. (eds.) Eurocode \u201992. ICMS, vol. 339, pp. 217\u2013228. Springer, Vienna (1993). https:\/\/doi.org\/10.1007\/978-3-7091-2786-5_19"},{"issue":"1","key":"15_CR42","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s002200050058","volume":"184","author":"SO Warnaar","year":"1997","unstructured":"Warnaar, S.O.: The Andrews-Gordon identities and $$q$$-multinomial coefficients. Commun. Math. Phys. 184(1), 203\u2013232 (1997)","journal-title":"Commun. Math. Phys."},{"key":"15_CR43","unstructured":"Zare, D.: How to express $$(1+x+x^2+\\cdots +x^m)^n$$ as a power series? Mathematics Stack Exchange, https:\/\/math.stackexchange.com\/q\/28861, (version: 2011-11-15)"},{"key":"15_CR44","unstructured":"Zhang, K.: sphincs-a (2023). https:\/\/github.com\/kzoacn\/sphincs-a"},{"key":"15_CR45","unstructured":"Zhang, K., Cui, H., Yu, Y.: SPHINCS-$$\\alpha $$: A compact stateless hash-based signature scheme. Cryptology ePrint Archive, Paper 2022\/059 (2022). https:\/\/eprint.iacr.org\/2022\/059"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38554-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:19Z","timestamp":1753567399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38554-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385537","9783031385544"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38554-4_15","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":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"479","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":"124","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":"26% - 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":"15","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)"}}]}}