{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:43:38Z","timestamp":1773348218937,"version":"3.50.1"},"publisher-location":"Cham","reference-count":68,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377082","type":"print"},{"value":"9783031377099","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":197,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a high-level language and then compiled to a low-level representation on which the ZKP operates. Thus,<jats:italic>a bug in a ZKP compiler can compromise the statement that the ZK proof is supposed to establish.<\/jats:italic>This paper takes a step towards ZKP compiler correctness by partially verifying a<jats:italic>field-blasting<\/jats:italic>compiler pass, a pass that translates Boolean and bit-vector logic into equivalent operations in a finite field. First, we define correctness for field-blasters and ZKP compilers more generally. Next, we describe the specific field-blaster using a set of encoding rules and define verification conditions for individual rules. Finally, we connect the rules and the correctness definition by showing that if our verification conditions hold, the field-blaster is correct. We have implemented our approach in the CirC ZKP compiler and have proved bounded versions of the corresponding verification conditions. We show that our partially verified field-blaster does not hurt the performance of the compiler or its output; we also report on four bugs uncovered during verification.<\/jats:p>","DOI":"10.1007\/978-3-031-37709-9_8","type":"book-chapter","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:01:21Z","timestamp":1689501681000},"page":"154-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Bounded Verification for\u00a0Finite-Field-Blasting"],"prefix":"10.1007","author":[{"given":"Alex","family":"Ozdemir","sequence":"first","affiliation":[]},{"given":"Riad S.","family":"Wahby","sequence":"additional","affiliation":[]},{"given":"Fraser","family":"Brown","sequence":"additional","affiliation":[]},{"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"8_CR1","unstructured":"LLVM language reference manual. https:\/\/llvm.org\/docs\/LangRef.html"},{"key":"8_CR2","unstructured":"Monero technical specs. https:\/\/monerodocs.org\/technical-specs\/ (2022)"},{"key":"8_CR3","unstructured":"Airscript. https:\/\/github.com\/0xPolygonMiden\/air-script"},{"key":"8_CR4","unstructured":"Angel, S., Blumberg, A.J., Ioannidis, E., Woods, J.: Efficient representation of numerical optimization problems for SNARKs. In: USENIX Security (2022)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bell\u00e9s-Mu\u00f1oz, M., Isabel, M., Mu\u00f1oz-Tapia, J.L., Rubio, A., Baylina, J.: Circom: a circuit description language for building zero-knowledge applications. IEEE Transactions on Dependable and Secure Computing (2022)","DOI":"10.1109\/TDSC.2022.3232813"},{"key":"8_CR6","unstructured":"Bellman. https:\/\/github.com\/zkcrypto\/bellman"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive theorem proving and program development: Coq\u2019Art: the calculus of inductive constructions. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: STOC (1988)","DOI":"10.1145\/62212.62222"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Brown, F., Renner, J., N\u00f6tzli, A., Lerner, S., Shacham, H., Stefan, D.: Towards a verified range analysis for JavaScript JITs. In: PLDI (2020)","DOI":"10.1145\/3395642"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Gennaro, R., Goldfeder, S., Nizzardo, L.: Zero-knowledge contingent payments revisited: attacks and payments for services. In: CCS (2017)","DOI":"10.1145\/3133956.3134060"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Chen, E., Zhu, J., Ozdemir, A., Wahby, R.S., Brown, F., Zheng, W.: Silph: a framework for scalable and accurate generation of hybrid MPC protocols (2023)","DOI":"10.1109\/SP46215.2023.10179397"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"8_CR14","unstructured":"Chin, C., Wu, H., Chu, R., Coglio, A., McCarthy, E., Smith, E.: Leo: a programming language for formally verified, zero-knowledge applications (2021). https:\/\/ia.cr\/2021\/651"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Cowan, M., Dangwal, D., Alaghi, A., Trippel, C., Lee, V.T., Reagen, B.: Porcupine: a synthesizing compiler for vectorized homomorphic encryption. In: PLDI (2021)","DOI":"10.1145\/3453483.3454050"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Eberhardt, J., Tai, S.: ZoKrates\u2013scalable privacy-preserving off-chain computations. In: IEEE Blockchain (2018)","DOI":"10.1109\/Cybermatics_2018.2018.00199"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Enderton, H.B.: A mathematical introduction to logic. Elsevier (2001)","DOI":"10.1016\/B978-0-08-049646-7.50005-9"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Fournet, C., Keller, C., Laporte, V.: A certified compiler for verifiable computing. In: CSF (2016)","DOI":"10.1109\/CSF.2016.26"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Fox, A., Myreen, M.O., Tan, Y.K., Kumar, R.: Verified compilation of CakeML to multiple machine-code targets. In: CPP (2017)","DOI":"10.1145\/3018610.3018621"},{"key":"8_CR20","unstructured":"Frankle, J., Park, S., Shaar, D., Goldwasser, S., Weitzner, D.: Practical accountability of secret processes. In: USENIX Security (2018)"},{"key":"8_CR21","unstructured":"Goldberg, L., Papini, S., Riabzev, M.: Cairo - a Turing-complete STARK-friendly CPU architecture (2021). https:\/\/ia.cr\/2021\/0163"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: STOC (1985)","DOI":"10.1145\/22145.22178"},{"key":"8_CR23","unstructured":"Grubbs, P., Arun, A., Zhang, Y., Bonneau, J., Walfish, M.: Zero-knowledge middleboxes. In: USENIX Security (2022)"},{"key":"8_CR24","unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox, N.: Zcash protocol specification. https:\/\/raw.githubusercontent.com\/zcash\/zips\/master\/protocol\/protocol.pdf (2016)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Jiang, K., Chait-Roth, D., DeStefano, Z., Walfish, M., Wies, T.: Less is more: refinement proofs for probabilistic proofs. IEEE S &P (2023)","DOI":"10.1109\/SP46215.2023.10179393"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Kamara, S., Moataz, T., Park, A., Qin, L.: A decentralized and encrypted national gun registry. In: IEEE S &P (2021)","DOI":"10.1109\/SP40001.2021.00072"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-aided reasoning: ACL2 case studies, vol. 4. Springer, NY (2013). https:\/\/doi.org\/10.1007\/978-1-4757-3188-0","DOI":"10.1007\/978-1-4757-3188-0"},{"key":"8_CR28","unstructured":"Kosba, A., Papadopoulos, D., Papamanthou, C., Song, D.: MIRAGE: succinct arguments for randomized algorithms with applications to universal zk-SNARKs. In: USENIX Security (2020)"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Kosba, A., Papamanthou, C., Shi, E.: xJsnark: A framework for efficient verifiable computation. In: IEEE S &P (2018)","DOI":"10.1109\/SP.2018.00018"},{"key":"8_CR30","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge (2022). https:\/\/ia.cr\/2022\/009"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: A verified implementation of ML. In: POPL (2014)","DOI":"10.1145\/2535838.2535841"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Kundu, S., Tatlock, Z., Lerner, S.: Proving optimizations correct using parameterized program equivalence. In: PLDI (2009)","DOI":"10.1145\/1542476.1542513"},{"key":"8_CR33","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO (2004)"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Lerner, S., Millstein, T., Chambers, C.: Automatically proving the correctness of compiler optimizations. In: PLDI (2003)","DOI":"10.1145\/781131.781156"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Lerner, S., Millstein, T., Rice, E., Chambers, C.: Automated soundness proofs for dataflow analyses and transformations via local rules. In: POPL (2005)","DOI":"10.1145\/1040305.1040335"},{"issue":"7","key":"8_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009)","journal-title":"Commun. ACM"},{"issue":"4","key":"8_CR37","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10817-009-9155-4","volume":"43","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: A formally verified compiler back-end. J. Autom. Reason. 43(4), 363\u2013446 (2009)","journal-title":"J. Autom. Reason."},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Lopes, N.P., Lee, J., Hur, C.K., Liu, Z., Regehr, J.: Alive2: bounded translation validation for LLVM. In: PLDI (2021)","DOI":"10.1145\/3453483.3454030"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Lopes, N.P., Menendez, D., Nagarakatte, S., Regehr, J.: Provably correct peephole optimizations with Alive. In: PLDI (2015)","DOI":"10.1145\/2737924.2737965"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Mullen, E., Zuniga, D., Tatlock, Z., Grossman, D.: Verified peephole optimizations for CompCert. In: PLDI (2016)","DOI":"10.1145\/2908080.2908109"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Translation validation for an optimizing compiler. In: PLDI (2000)","DOI":"10.1145\/349299.349314"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Niemetz, A., Preiner, M., Reynolds, A., Zohar, Y., Barrett, C., Tinelli, C.: Towards bit-width-independent proofs in SMT solvers. In: CADE (2019)","DOI":"10.1007\/978-3-030-29436-6_22"},{"issue":"7","key":"8_CR43","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s10817-021-09598-9","volume":"65","author":"A Niemetz","year":"2021","unstructured":"Niemetz, A., Preiner, M., Reynolds, A., Zohar, Y., Barrett, C., Tinelli, C.: Towards satisfiability modulo parametric bit-vectors. J. Autom. Reason. 65(7), 1001\u20131025 (2021)","journal-title":"J. Autom. Reason."},{"key":"8_CR44","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C.: Isabelle\/HOL: a proof assistant for higher-order logic. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9","DOI":"10.1007\/3-540-45949-9"},{"key":"8_CR45","unstructured":"Noir. https:\/\/noir-lang.github.io\/book\/index.html"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Ozdemir, A., Brown, F., Wahby, R.S.: CirC: Compiler infrastructure for proof systems, software verification, and more. In: IEEE S &P (2022)","DOI":"10.1109\/SP46214.2022.9833782"},{"key":"8_CR47","unstructured":"Ozdemir, A., Kremer, G., Tinelli, C., Barrett, C.: Satisfiability modulo finite fields. In: submission (2022). https:\/\/ia.cr\/2023\/091"},{"key":"8_CR48","unstructured":"Ozdemir, A., Wahby, R., Whitehat, B., Boneh, D.: Scaling verifiable computation using efficient set accumulators. In: USENIX Security (2020)"},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"Ozdemir, A., Wahby, R.S., Brown, F., Barrett, C.: Bounded verification for finite-field-blasting. Cryptology ePrint Archive (2023) (Full version)","DOI":"10.1007\/978-3-031-37709-9_8"},{"issue":"2","key":"8_CR50","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2856449","volume":"59","author":"B Parno","year":"2016","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016)","journal-title":"Commun. ACM"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Siegel, M., Singerman, E.: Translation validation. In: TACAS (1998)","DOI":"10.1007\/BFb0054170"},{"key":"8_CR52","unstructured":"Ranise, S., Tinelli, C., Barrett, C.: SMT fixed size bit-vectors theory. https:\/\/smtlib.cs.uiowa.edu\/theories-FixedSizeBitVectors.shtml (2017)"},{"key":"8_CR53","unstructured":"Sasson, E.B., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: decentralized anonymous payments from Bitcoin. In: IEEE S &P (2014)"},{"key":"8_CR54","doi-asserted-by":"crossref","unstructured":"Setty, S., Braun, B., Vu, V., Blumberg, A.J., Parno, B., Walfish, M.: Resolving the conflict between generality and plausibility in verified computation. In: EuroSys (2013)","DOI":"10.1145\/2465351.2465359"},{"key":"8_CR55","unstructured":"Snarky. https:\/\/github.com\/o1-labs\/snarky"},{"key":"8_CR56","doi-asserted-by":"crossref","unstructured":"Stewart, G., Beringer, L., Cuellar, S., Appel, A.W.: Compositional CompCert. In: POPL (2015)","DOI":"10.1145\/2676726.2676985"},{"key":"8_CR57","doi-asserted-by":"crossref","unstructured":"Tan, Y.K., Myreen, M.O., Kumar, R., Fox, A., Owens, S., Norrish, M.: The verified CakeML compiler backend. J. Funct. Programm. 29, E2 (2019)","DOI":"10.1017\/S0956796818000229"},{"key":"8_CR58","doi-asserted-by":"crossref","unstructured":"Tao, R., et al.: Giallar: push-button verification for the Qiskit quantum compiler. In: PLDI (2022)","DOI":"10.1145\/3519939.3523431"},{"key":"8_CR59","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, Arguments, and Zero-Knowledge. Manuscript (2022)","DOI":"10.1561\/9781638281252"},{"key":"8_CR60","doi-asserted-by":"publisher","unstructured":"The Qiskit authors and maintainers: Qiskit: an open-source framework for quantum computing (2021). https:\/\/doi.org\/10.5281\/zenodo.2573505. The Qiskit maintainers request that the full list of Qiskit contributors be included in any citation. Regretfully, we cannot comply, as the list is two pages long","DOI":"10.5281\/zenodo.2573505"},{"key":"8_CR61","unstructured":"Tinelli, C.: SMT core theory. https:\/\/smtlib.cs.uiowa.edu\/theories-Core.shtml (2015)"},{"key":"8_CR62","doi-asserted-by":"crossref","unstructured":"Viand, A., Jattke, P., Hithnawi, A.: SoK: fully homomorphic encryption compilers. In: IEEE S &P (2021)","DOI":"10.1109\/SP40001.2021.00068"},{"key":"8_CR63","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Setty, S., Howald, M., Ren, Z., Blumberg, A.J., Walfish, M.: Efficient RAM and control flow in verifiable outsourced computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23097"},{"issue":"2","key":"8_CR64","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"M Walfish","year":"2015","unstructured":"Walfish, M., Blumberg, A.J.: Verifying computations without reexecuting them. Commun. ACM 58(2), 74\u201384 (2015)","journal-title":"Commun. ACM"},{"key":"8_CR65","unstructured":"Wang, F.: Ecne: automated verification of ZK circuits (2022). https:\/\/0xparc.org\/blog\/ecne"},{"key":"8_CR66","unstructured":"Zinc. https:\/\/zinc.matterlabs.dev\/"},{"key":"8_CR67","doi-asserted-by":"crossref","unstructured":"Zohar, Y., et al.: Bit-precise reasoning via Int-blasting. In: CADE (2022)","DOI":"10.1007\/978-3-030-94583-1_24"},{"key":"8_CR68","unstructured":"ZoKrates. https:\/\/zokrates.github.io\/"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37709-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:02:13Z","timestamp":1702789333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37709-9_8"}},"subtitle":["In a Compiler for Zero Knowledge Proofs"],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377082","9783031377099"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37709-9_8","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":"17 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.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":"261","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":"67","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":"11","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)"}}]}}