{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:17Z","timestamp":1740099617419,"version":"3.37.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030369866"},{"type":"electronic","value":"9783030369873"}],"license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36987-3_2","type":"book-chapter","created":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:34:36Z","timestamp":1577838876000},"page":"21-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Distributed and Trusted Web of\u00a0Formal Proofs"],"prefix":"10.1007","author":[{"given":"Dale","family":"Miller","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2007.02.002","volume":"172","author":"M Abadi","year":"2007","unstructured":"Abadi, M.: Access control in a core calculus of dependency. Electr. Notes Theor. Comput. Sci 172, 5\u201331 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-70525-3_9","volume-title":"Deontic Logic in Computer Science","author":"M Abadi","year":"2008","unstructured":"Abadi, M.: Variations in access control logic. In: van der Meyden, R., van der Torre, L. (eds.) DEON 2008. LNCS (LNAI), vol. 5076, pp. 96\u2013109. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70525-3_9"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/inco.2002.3086","volume":"174","author":"M Abadi","year":"2002","unstructured":"Abadi, M., Fournet, C., Gonthier, G.: Secure implementation of channel abstractions. Inf. Comput. 174(1), 37\u201383 (2002)","journal-title":"Inf. Comput."},{"key":"2_CR4","volume-title":"Infinitesimal: How a Dangerous Mathematical Theory Shaped the Modern World","author":"A Alexander","year":"2014","unstructured":"Alexander, A.: Infinitesimal: How a Dangerous Mathematical Theory Shaped the Modern World. Oneworld Publications, London (2014)"},{"key":"2_CR5","unstructured":"Andrews, P.B.: Accept diversity, August 1994. \nhttp:\/\/mizar.org\/qed\/mail-archive\/volume-2\/0199.html"},{"key":"2_CR6","unstructured":"Anonymous: The QED manifesto. In: Bundy, A. (ed.) 12th International Conference on Automated Deduction, LNAI, vol. 814, pp. 238\u2013251. Springer, Nancy, France, June 1994"},{"key":"2_CR7","unstructured":"Appel, A.W.: Foundational proof-carrying code. In: 16th Symposium on Logic in Computer Science, pp. 247\u2013258 (2001)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Appel, A.W., Felten, E.W.: Proof-carrying authentication. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 52\u201362. ACM (1999)","DOI":"10.1145\/319709.319718"},{"key":"2_CR9","unstructured":"Armknecht, F., et al.: A guide to fully homomorphic encryption. Cryptology ePrint Archive, Report 2015\/1192 (2015). \nhttps:\/\/eprint.iacr.org\/2015\/1192"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.4204\/EPTCS.186.8","volume":"186","author":"Ali Assaf","year":"2015","unstructured":"Assaf, A., Burel, G.: Translating HOL to Dedukti. In: Kaliszyk, C., Paskevich, A. (eds.) Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving, PxTP 2015, EPTCS, Berlin, Germany, 2\u20133 August 2015, vol. 186, pp. 74\u201388 (2015). \nhttp:\/\/dx.doi.org\/10.4204\/EPTCS.186","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR11","unstructured":"Assaf, A., et al.: Expressing theories in the $$\\lambda $$$${\\Pi }$$-calculus modulo theory and in the Dedukti system. In: TYPES: Types for Proofs and Programs. Novi Sad, Serbia (2016)"},{"key":"2_CR12","unstructured":"Bauer, L.: Access control for the web Via. Ph.D. thesis, Princeton University, 30 September 2003. \nhttp:\/\/www.ece.cmu.edu\/lbauer\/papers\/thesis.pdf"},{"key":"2_CR13","unstructured":"Benet, J.: IPFS-content addressed, versioned, P2P file system (2014)"},{"key":"2_CR14","unstructured":"Berners-Lee, T.: Semantic Web road map. Technical report, W3C Design Issues (1998). \nhttp:\/\/www.w3.org\/DesignIssues\/Semantic.html"},{"key":"2_CR15","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer, Heidelberg (2004). \nhttp:\/\/www.labri.fr\/publications\/l3a\/2004\/BC04"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-63046-5_16","volume-title":"Automated Deduction \u2013 CADE 26","author":"R Blanco","year":"2017","unstructured":"Blanco, R., Chihani, Z., Miller, D.: Translating between implicit and explicit versions of proof. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 255\u2013273. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63046-5_16"},{"key":"2_CR17","first-page":"589","volume-title":"To H.B.Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"NG Bruijn de","year":"1980","unstructured":"de Bruijn, N.G.: A survey of the project AUTOMATH. In: Seldin, J.P., Hindley, R. (eds.) To H.B.Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pp. 589\u2013606. Academic Press, New York (1980)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1017\/CBO9780511569807.004","volume-title":"Logical Frameworks","author":"NG Bruijn de","year":"1991","unstructured":"de Bruijn, N.G.: A plea for weaker frameworks. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 40\u201367. Cambridge University Press, Cambridge (1991)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Carbone, M., Nielsen, M., Sassone, V.: A formal model for trust in dynamic networks. In: SEFM, p. 54. IEEE Computer Society (2003)","DOI":"10.1109\/SEFM.2003.1236207"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-02614-0_21","volume-title":"Intelligent Computer Mathematics","author":"J Carette","year":"2009","unstructured":"Carette, J., Farmer, W.M.: A review of mathematical knowledge management. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) CICM 2009. LNCS (LNAI), vol. 5625, pp. 233\u2013246. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02614-0_21"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10817-016-9380-6","volume":"59","author":"Z Chihani","year":"2017","unstructured":"Chihani, Z., Miller, D., Renaud, F.: A semantic framework for proof evidence. J. Autom. Reasoning 59(3), 287\u2013330 (2017). \nhttps:\/\/doi.org\/10.1007\/s10817-016-9380-6","journal-title":"J. Autom. Reasoning"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Comon, H., Koutsos, A.: Formal computational unlinkability proofs of RFID protocols. In: 2017 IEEE 30th Conference on Computer Security Foundations Symposium (CSF), pp. 100\u2013114. IEEE (2017)","DOI":"10.1109\/CSF.2017.9"},{"key":"2_CR23","unstructured":"Certification problem format (2015). \nhttp:\/\/cl-informatik.uibk.ac.at\/software\/cpf\/"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Garg, D., Pfenning, F.: A proof-carrying file system. In: 2010 IEEE Symposium on Security and Privacy, pp. 349\u2013364. IEEE (2010)","DOI":"10.1109\/SP.2010.28"},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. J. ACM 40(1), 143\u2013184 (1993)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR26","first-page":"1","volume":"9","author":"J Harrison","year":"2016","unstructured":"Harrison, J., Urban, J., Wiedijk, F.: Preface: twenty years of the QED manifesto. J. Formaliz. Reasoning 9(1), 1\u20132 (2016)","journal-title":"J. Formaliz. Reasoning"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s10817-018-9475-3","volume":"63","author":"Q Heath","year":"2019","unstructured":"Heath, Q., Miller, D.: A proof theory for model checking. J. Autom. Reasoning 63(4), 857\u2013885 (2019). \nhttps:\/\/doi.org\/10.1007\/s10817-018-9475-3","journal-title":"J. Autom. Reasoning"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-319-21401-6_40","volume-title":"Automated Deduction \u2013 CADE-25","author":"MJH Heule","year":"2015","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Expressing symmetry breaking in DRAT proofs. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 591\u2013606. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21401-6_40"},{"key":"2_CR29","volume-title":"Knowledge and Belief: An Introduction into the Logic of the Two Notions","author":"J Hintikka","year":"1962","unstructured":"Hintikka, J.: Knowledge and Belief: An Introduction into the Logic of the Two Notions. Cornell University Press, Ithaca (1962)"},{"issue":"1","key":"2_CR30","first-page":"201","volume":"9","author":"M Kohlhase","year":"2016","unstructured":"Kohlhase, M., Rabe, F.: QED reloaded: towards a pluralistic formal library of mathematical knowledge. J. Formaliz. Reasoning 9(1), 201\u2013234 (2016)","journal-title":"J. Formaliz. Reasoning"},{"key":"2_CR31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4529.001.0001","volume-title":"Mechanizing Proof","author":"D MacKenzie","year":"2001","unstructured":"MacKenzie, D.: Mechanizing Proof. MIT Press, Cambridge (2001)"},{"key":"2_CR32","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). \nhttps:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-25379-9_6","volume-title":"Certified Programs and Proofs","author":"D Miller","year":"2011","unstructured":"Miller, D.: A proposal for broad spectrum proof certificates. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 54\u201369. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25379-9_6"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00165-016-0393-z","volume":"29","author":"D Miller","year":"2017","unstructured":"Miller, D.: Proof checking and logic programming. Formal Aspects Comput. 29(3), 383\u2013399 (2017). \nhttps:\/\/doi.org\/10.1007\/s00165-016-0393-z","journal-title":"Formal Aspects Comput."},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: Conference Record of the 24th Symposium on Principles of Programming Languages, vol. 97, pp. 106\u2013119. ACM Press, Paris, France (1997)","DOI":"10.1145\/263699.263712"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Necula, G.C., Rahul, S.P.: Oracle-based checking of untrusted software. In: Hankin, C., Schmidt, D. (eds.) 28th ACM Symposium on Principles of Programming Languages, pp. 142\u2013154 (2001)","DOI":"10.1145\/373243.360216"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/B978-044450813-3\/50019-9","volume-title":"Handbook of Automated Reasoning","author":"F Pfenning","year":"2001","unstructured":"Pfenning, F.: Logical frameworks. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, pp. 1063\u20131147. Elsevier and MIT Press, Cambridge (2001)"},{"key":"2_CR38","volume-title":"Twenty Five Years of Constructive Type Theory","author":"R Pollack","year":"1998","unstructured":"Pollack, R.: How to believe a machine-checked proof. In: Sambin, G., Smith, J. (eds.) Twenty Five Years of Constructive Type Theory. Oxford University Press, Oxford (1998)"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Primiero, G., Raimondi, F.: A typed natural deduction calculus to reason about secure trust. In: Miri, A., Hengartner, U., Huang, N.F., J\u00f8sang, A., Garc\u00eda-Alfaro, J. (eds.) Twelfth Annual International Conference on Privacy, pp. 379\u2013382. Security and Trust, Toronto, ON, Canada, 23\u201324 July (2014)","DOI":"10.1109\/PST.2014.6890963"},{"issue":"6","key":"2_CR40","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1093\/logcom\/exu079","volume":"27","author":"F Rabe","year":"2017","unstructured":"Rabe, F.: How to identify, translate and combine logics? J. Logic Comput. 27(6), 1753\u20131798 (2017)","journal-title":"J. Logic Comput."},{"issue":"1","key":"2_CR41","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/1952982.1952990","volume":"14","author":"FB Schneider","year":"2011","unstructured":"Schneider, F.B., Walsh, K., Sirer, E.G.: Nexus authorization logic (NAL): design rationale and applications. ACM Trans. Inf. Syst. Secur. 14(1), 8:1\u20138:28 (2011). \nhttps:\/\/doi.org\/10.1145\/1952982.1952990","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"8","key":"2_CR42","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/3105423","volume":"60","author":"E Shein","year":"2017","unstructured":"Shein, E.: Hacker-proof coding. Commun. ACM 60(8), 12\u201314 (2017). \nhttps:\/\/doi.org\/10.1145\/3105423","journal-title":"Commun. ACM"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4204\/EPTCS.167.8","volume":"167","author":"Christian Sternagel","year":"2014","unstructured":"Sternagel, C., Thiemann, R.: The certification problem format. In: Proceedings UITP 2014, pp. 61\u201372 (2014). \nhttps:\/\/doi.org\/10.4204\/EPTCS.167.8","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR44","unstructured":"Stodden, V., Bailey, D.H., Borwein, J., LeVeque, R.J., Rider, W., Stein, W.: Setting the default to reproducible: reproducibility in computational and experimental mathematics, February 2013. \nhttp:\/\/www.davidhbailey.com\/dhbpapers\/icerm-report.pdf"},{"key":"2_CR45","unstructured":"Voevodsky, V.: Univalent foundations. Talk given at the Institute for Advanced Study, March 2014. \nhttp:\/\/www.math.ias.edu\/vladimir\/sites\/math.ias.edu.vladimir\/files\/2014_IAS.pdf"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-09284-3_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"N Wetzler","year":"2014","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 422\u2013429. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09284-3_31"},{"issue":"23","key":"2_CR47","first-page":"121","volume":"10","author":"F Wiedijk","year":"2007","unstructured":"Wiedijk, F.: The QED manifesto revisited. Stud. Logic Gramm. Rhetor. 10(23), 121\u2013133 (2007)","journal-title":"Stud. Logic Gramm. Rhetor."},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Wu, D., Appel, A.W., Stump, A.: Foundational proof checkers with small witnesses. In: Miller, D. (ed.) Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declaritive Programming, PPDP 2003, pp. 264\u2013274. ACM, New York, NY, USA (2003)","DOI":"10.1145\/888251.888276"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36987-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:35:15Z","timestamp":1577838915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36987-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"ISBN":["9783030369866","9783030369873"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36987-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"9 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icdcit.ac.in\/","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":"110","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":"20","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":"3","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":"18% - 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":"9","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":"In addition, there are 6 invited papers.","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)"}}]}}