{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:08:11Z","timestamp":1790183291415,"version":"4.1.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030532871","type":"print"},{"value":"9783030532888","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"content-version":"vor","delay-in-days":195,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53288-8_13","type":"book-chapter","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T19:03:27Z","timestamp":1594839807000},"page":"251-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems"],"prefix":"10.1007","author":[{"given":"Kartik","family":"Nagar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasita","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suresh","family":"Jagannathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J.M., Stoica, I.: Highly available transactions: virtues and limitations. PVLDB 7(3), 181\u2013192 (2013). \nhttps:\/\/doi.org\/10.14778\/2732232.2732237\n\n. \nhttp:\/\/www.vldb.org\/pvldb\/vol7\/p181-bailis.pdf","DOI":"10.14778\/2732232.2732237"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Bailis, P., Fekete, A., Franklin, M.J., Ghodsi, A., Hellerstein, J.M., Stoica,I.: Coordination avoidance in database systems. PVLDB 8(3), 185\u2013196 (2014). \nhttps:\/\/doi.org\/10.14778\/2735508.2735509\n\n. \nhttp:\/\/www.vldb.org\/pvldb\/vol8\/p185-bailis.pdf","DOI":"10.14778\/2735508.2735509"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bailis, P., Fekete, A., Ghodsi, A., Hellerstein, J.M., Stoica, I.: The potential dangers of causal consistency and an explicit solution. In: ACM Symposium on Cloud Computing, SOCC 2012, San Jose, CA, USA, 14\u201317 October 2012, p. 22 (2012). \nhttps:\/\/doi.org\/10.1145\/2391229.2391251","DOI":"10.1145\/2391229.2391251"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/2447976.2447992","volume":"56","author":"P Bailis","year":"2013","unstructured":"Bailis, P., Ghodsi, A.: Eventual consistency today: limitations, extensions, and beyond. Commun. ACM 56(5), 55\u201363 (2013). \nhttps:\/\/doi.org\/10.1145\/2447976.2447992","journal-title":"Commun. ACM"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Checking robustness against snapshot isolation. In: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, 15\u201318 July 2019, Proceedings, Part II, pp. 286\u2013304 (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-25543-5_17","DOI":"10.1007\/978-3-030-25543-5_17"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Beillahi, S.M., Bouajjani, A., Enea, C.: Robustness against transactional causal consistency. In: 30th International Conference on Concurrency Theory, CONCUR 2019, Amsterdam, The Netherlands, 27\u201330 August 2019, pp. 30:1\u201330:18 (2019). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.30","DOI":"10.4230\/LIPIcs.CONCUR.2019.30"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bernardi, G., Gotsman, A.: Robustness against consistency models with atomic visibility. In: 27th International Conference on Concurrency Theory, CONCUR 2016, Qu\u00e9bec City, Canada, 23\u201326 August 2016, pp. 7:1\u20137:15 (2016). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.7","DOI":"10.4230\/LIPIcs.CONCUR.2016.7"},{"key":"13_CR8","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 626\u2013638. ACM (2017). \nhttp:\/\/dl.acm.org\/citation.cfm?id=3009888"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Bravo, M., Rodrigues, L.E.T., Roy, P.V.: Saturn: a distributed metadata service for causal consistency. In: Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, 23\u201326 April 2017, pp. 111\u2013126 (2017). \nhttps:\/\/doi.org\/10.1145\/3064176.3064210","DOI":"10.1145\/3064176.3064210"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Brutschy, L., Dimitrov, D., M\u00fcller, P., Vechev, M.T.: Static serializability analysis for causal consistency. In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, 18\u201322 June 2018, pp. 90\u2013104 (2018). \nhttps:\/\/doi.org\/10.1145\/3192366.3192415","DOI":"10.1145\/3192366.3192415"},{"issue":"1\u20132","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2500000011","volume":"1","author":"S Burckhardt","year":"2014","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1\u20132), 1\u2013150 (2014). \nhttps:\/\/doi.org\/10.1561\/2500000011","journal-title":"Found. Trends Program. Lang."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 271\u2013284 (2014). \nhttps:\/\/doi.org\/10.1145\/2535838.2535848","DOI":"10.1145\/2535838.2535848"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Cerone, A., Bernardi, G., Gotsman, A.: A framework for transactional consistency models with atomic visibility. In: 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, 1.4 September 2015, pp. 58\u201371 (2015). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.58","DOI":"10.4230\/LIPIcs.CONCUR.2015.58"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Didona, D., Guerraoui, R., Wang, J., Zwaenepoel, W.: Causal consistency and latency optimality: friend or foe? PVLDB 11(11), 1618\u20131632 (2018). \nhttps:\/\/doi.org\/10.14778\/3236187.3236210\n\n. \nhttp:\/\/www.vldb.org\/pvldb\/vol11\/p1618-didona.pdf","DOI":"10.14778\/3236187.3236210"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Doherty, S., Dongol, B., Wehrheim, H., Derrick, J.: Making linearizability compositional for partially ordered executions. In: Integrated Formal Methods - 14th International Conference, IFM 2018, Maynooth, Ireland, 5\u20137 September 2018, Proceedings, pp. 110\u2013129 (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98938-9_7","DOI":"10.1007\/978-3-319-98938-9_7"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C.: Weak-consistency specification via visibility relaxation. Proc. ACM Program. Lang. 3(POPL), 60:1\u201360:28 (2019). \nhttps:\/\/doi.org\/10.1145\/3290373","DOI":"10.1145\/3290373"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C., Hamza, J.: Monitoring refinement via symbolic reasoning. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 260\u2013269 (2015). \nhttps:\/\/doi.org\/10.1145\/2737924.2737983","DOI":"10.1145\/2737924.2737983"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Gomes, V.B.F., Kleppmann, M., Mulligan, D.P., Beresford, A.R.: Verifying strong eventual consistency in distributed systems. PACMPL 1(OOPSLA), 109:1\u2013109:28 (2017). \nhttps:\/\/doi.org\/10.1145\/3133933","DOI":"10.1145\/3133933"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Gotsman, A., Yang, H., Ferreira, C., Najafzadeh, M., Shapiro, M.: \u2019cause i\u2019m strong enough: reasoning about consistency choices in distributed systems. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 371\u2013384 (2016). \nhttps:\/\/doi.org\/10.1145\/2837614.2837625","DOI":"10.1145\/2837614.2837625"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain, 27\u201330 June 2004, pp. 206\u2013215 (2004). \nhttps:\/\/doi.org\/10.1145\/1007912.1007944","DOI":"10.1145\/1007912.1007944"},{"key":"13_CR21","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). \nhttps:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR23","unstructured":"Houshmand, F., Lesani, M.: Hamsaz: replication coordination analysis and synthesis. PACMPL 3(POPL), 74:1\u201374:32 (2019). \nhttps:\/\/dl.acm.org\/citation.cfm?id=3290387"},{"key":"13_CR24","unstructured":"Jepsen. \nhttps:\/\/jepsen.io\n\n. Accessed 27 Jan 2019"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Kaki, G., Earanky, K., Sivaramakrishnan, K.C., Jagannathan, S.: Safe replication through bounded concurrency verification. PACMPL 2(OOPSLA), 164:1\u2013164:27 (2018). \nhttps:\/\/doi.org\/10.1145\/3276534","DOI":"10.1145\/3276534"},{"key":"13_CR26","unstructured":"Lightweight transactions in cassandra. \nhttps:\/\/docs.datastax.com\/en\/cql\/3.3\/cql\/cql_using\/useInsertLWT.html\n\n. Accessed 2 Dec 2019"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Lloyd, W., Freedman, M.J., Kaminsky, M., Andersen, D.G.: Don\u2019t settle for eventual: scalable causal consistency for wide-area storage with COPS. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles 2011, SOSP 2011, Cascais, Portugal, 23\u201326 October 2011, pp. 401\u2013416 (2011). \nhttps:\/\/doi.org\/10.1145\/2043556.2043593","DOI":"10.1145\/2043556.2043593"},{"key":"13_CR28","unstructured":"Mehdi, S.A., Littley, C., Crooks, N., Alvisi, L., Bronson, N., Lloyd, W.: I can\u2019t believe it\u2019s not causal! scalable causal consistency with no slowdown cascades. In: 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, 27\u201329 March 2017, pp. 453\u2013468 (2017). \nhttps:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/mehdi"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, 23\u201326 May 1996, pp. 267\u2013275 (1996). \nhttps:\/\/doi.org\/10.1145\/248052.248106","DOI":"10.1145\/248052.248106"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Nagar, K., Jagannathan, S.: Automated detection of serializability violations under weak consistency. In: 29th International Conference on Concurrency Theory, CONCUR 2018, Beijing, China, 4\u20137 September 2018, pp. 41:1\u201341:18 (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.41","DOI":"10.4230\/LIPIcs.CONCUR.2018.41"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Nagar, K., Jagannathan, S.: Automated parameterized verification of CRDTs. In: Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, 15\u201318 July 2019, Proceedings, Part II, pp. 459\u2013477 (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-25543-5_26","DOI":"10.1007\/978-3-030-25543-5_26"},{"key":"13_CR32","unstructured":"Nagar, K., Mukherjee, P., Jagannathan, S.: Semantics, Specification and Bounded Verification of Concurrent Libraries in Replicated Systems (Extended Version). \nhttps:\/\/arxiv.org\/abs\/2004.10158"},{"key":"13_CR33","unstructured":"Peierls, T., Goetz, B., Bloch, J., Bowbeer, J., Lea, D., Holmes, D.: Java Concurrency in Practice. Addison-Wesley Professional, Reading (2005)"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Raad, A., Doko, M., Rozic, L., Lahav, O., Vafeiadis, V.: On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models. PACMPL 3(POPL), 68:1\u201368:31 (2019). \nhttps:\/\/doi.org\/10.1145\/3290381","DOI":"10.1145\/3290381"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Rahmani, K., Nagar, K., Delaware, B., Jagannathan, S.: CLOTHO: directed test generation for weakly consistent database systems. PACMPL 3(OOPSLA), 117:1\u2013117:28 (2019). \nhttps:\/\/doi.org\/10.1145\/3360543","DOI":"10.1145\/3360543"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: A comprehensive study of Convergent and Commutative Replicated Data Types. Technical report, RR-7506, INRIA, Inria - Centre Paris-Rocquencourt (2011)","DOI":"10.1007\/978-3-642-24550-3_29"},{"issue":"3","key":"13_CR37","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Commun. ACM 54(3), 76\u201384 (2011). \nhttps:\/\/doi.org\/10.1145\/1897852.1897873","journal-title":"Commun. ACM"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Sivaramakrishnan, K.C., Kaki, G., Jagannathan, S.: Declarative programming over eventually consistent data stores. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 413\u2013424 (2015). \nhttps:\/\/doi.org\/10.1145\/2737924.2737981","DOI":"10.1145\/2737924.2737981"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Terry, D.B., Demers, A.J., Petersen, K., Spreitzer, M., Theimer, M., Welch, B.B.: Session guarantees for weakly consistent replicated data. In: Proceedings of the Third International Conference on Parallel and Distributed Information Systems (PDIS 94), Austin, Texas, USA, 28\u201330 September 1994, pp. 140\u2013149 (1994). \nhttps:\/\/doi.org\/10.1109\/PDIS.1994.331722","DOI":"10.1109\/PDIS.1994.331722"},{"key":"13_CR40","unstructured":"Treiber, R.K.: Systems programming: coping with parallelism. International Business Machines Incorporated, Thomas J. Watson Research (1986)"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Wang, C., Enea, C., Mutluergil, S.O., Petri, G.: Replication-aware linearizability. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, 22\u201326 June 2019, pp. 980\u2013993 (2019). \nhttps:\/\/doi.org\/10.1145\/3314221.3314617","DOI":"10.1145\/3314221.3314617"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Zeller, P., Bieniusa, A., Poetzsch-Heffter, A.: Formal specification and verification of CRDTs. In: Formal Techniques for Distributed Objects, Components, and Systems - 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, 3\u20135 June 2014, Proceedings, pp. 33\u201348 (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43613-4_3","DOI":"10.1007\/978-3-662-43613-4_3"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53288-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T19:07:33Z","timestamp":1594840053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53288-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532871","9783030532888"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53288-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 July 2020","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":"Los Angeles, 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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2020\/","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":"EasyChair.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"240","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":"43","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":"22","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":"4","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)"}},{"value":"The conference was held virtually 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)"}}]}}