{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:55:52Z","timestamp":1742946952577,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171956"},{"type":"electronic","value":"9783031171963"}],"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-031-17196-3_1","type":"book-chapter","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T22:03:09Z","timestamp":1663884189000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized First-Order Monitoring with\u00a0Hashing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8253-4513","authenticated-orcid":false,"given":"Joshua","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"1_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"PS Almeida","year":"2007","unstructured":"Almeida, P.S., Baquero, C., Pregui\u00e7a, N.M., Hutchison, D.: Scalable Bloom filters. Inf. Process. Lett. 101(6), 255\u2013261 (2007)","journal-title":"Inf. Process. Lett."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-35632-2_18","volume-title":"Runtime Verification","author":"E Bartocci","year":"2013","unstructured":"Bartocci, E., Grosu, R., Karmarkar, A., Smolka, S.A., Stoller, S.D., Zadok, E., Seyster, J.: Adaptive runtime verification. In: Qadeer, S., Tasiran, S. (eds.) RV 2012. LNCS, vol. 7687, pp. 168\u2013182. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35632-2_18"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-030-51074-9_25","volume-title":"Automated Reasoning","author":"D Basin","year":"2020","unstructured":"Basin, D., Dardinier, T., Heimes, L., Krsti\u0107, S., Raszyk, M., Schneider, J., Traytel, D.: A formally verified, optimized monitor for metric first-order dynamic logic. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 432\u2013453. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_25"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s10703-015-0222-7","volume":"46","author":"D Basin","year":"2015","unstructured":"Basin, D., Klaedtke, F., Marinovic, S., Z\u0103linescu, E.: Monitoring of temporal first-order properties with aggregations. Formal Methods Syst. Des. 46(3), 262\u2013285 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0222-7","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Z\u0103linescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 15:1\u201315:45 (2015)","DOI":"10.1145\/2699444"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-030-76384-8_21","volume-title":"NASA Formal Methods","author":"FI Berg","year":"2021","unstructured":"Berg, F.I.: Recursive variable-length state compression for multi-core software model checking. In: Dutle, A., Moscato, M.M., Titolo, L., Mu\u00f1oz, C.A., Perez, I. (eds.) NFM 2021. LNCS, vol. 12673, pp. 340\u2013357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_21"},{"issue":"7","key":"1_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Carter, L., Floyd, R.W., Gill, J., Markowsky, G., Wegman, M.N.: Exact and approximate membership testers. In: STOC 1978, pp. 59\u201365. ACM (1978)","DOI":"10.1145\/800133.804332"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/210197.210200","volume":"20","author":"J Chomicki","year":"1995","unstructured":"Chomicki, J.: Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Database Syst. 20(2), 149\u2013186 (1995)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Clayton, D., Patton, C., Shrimpton, T.: Probabilistic data structures in adversarial environments. In: CCS 2019, pp. 1317\u20131334. ACM (2019)","DOI":"10.1145\/3319535.3354235"},{"key":"1_CR12","unstructured":"D\u2019Angelo, B., et al.: LOLA: runtime monitoring of synchronous systems. In: TIME 2005, pp. 166\u2013174. IEEE Computer Society (2005)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30494-4_26","volume-title":"Formal Methods in Computer-Aided Design","author":"PC Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 367\u2013381. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30494-4_26"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than bloom. In: CoNEXT 2014, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw. 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-25540-4_24","volume-title":"Computer Aided Verification","author":"P Faymonville","year":"2019","unstructured":"Faymonville, P., Finkbeiner, B., Schledjewski, M., Schwenger, M., Stenger, M., Tentrup, L., Torfah, H.: StreamLAB: stream-based monitoring of cyber-physical systems. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 421\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_24"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/125187.125200","volume":"9","author":"EA Fox","year":"1991","unstructured":"Fox, E.A., Chen, Q.F., Daoud, A.M., Heath, L.S.: Order-preserving minimal perfect hash functions and information retrieval. ACM Trans. Inf. Syst. 9(3), 281\u2013308 (1991)","journal-title":"ACM Trans. Inf. Syst."},{"key":"1_CR18","unstructured":"Grigore, R., Kiefer, S.: Selective monitoring. In: CONCUR 2018. LIPIcs, vol. 118, pp. 20:1\u201320:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Trans. Knowl. Data Eng. 22(1), 120\u2013133 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10009-014-0309-2","volume":"17","author":"K Havelund","year":"2014","unstructured":"Havelund, K.: Rule-based runtime verification revisited. Int. J. Softw. Tools Technol. Transf. 17(2), 143\u2013170 (2014). https:\/\/doi.org\/10.1007\/s10009-014-0309-2","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-59152-6_1","volume-title":"Automated Technology for Verification and Analysis","author":"K Havelund","year":"2020","unstructured":"Havelund, K., Peled, D.: First-order timed runtime verification using BDDs. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 3\u201324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_1"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Havelund, K., Peled, D., Ulus, D.: First-order temporal logic monitoring with BDDs. Formal Methods Syst. Des. 56(1), 1\u201321 (2020)","DOI":"10.1007\/s10703-018-00327-4"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-75632-5_3","volume-title":"Lectures on Runtime Verification","author":"K Havelund","year":"2018","unstructured":"Havelund, K., Reger, G., Thoma, D., Z\u0103linescu, E.: Monitoring events that carry data. In: Bartocci, E., Falcone, Y. (eds.) Lectures on Runtime Verification. LNCS, vol. 10457, pp. 61\u2013102. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5_3"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-46002-0_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Havelund","year":"2002","unstructured":"Havelund, K., Ro\u015fu, G.: Synthesizing monitors for safety properties. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46002-0_24"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Heydari, A., Ali Tavakoli, M., Salim, N.: Detection of fake opinions using time series. Expert Syst. Appl. 58, 83\u201392 (2016)","DOI":"10.1016\/j.eswa.2016.03.020"},{"key":"1_CR26","unstructured":"Holzmann, G.J.: State compression in SPIN: recursive indexing and compression training runs. In: SPIN Workshop 1997 (1997)"},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008696026254","volume":"13","author":"GJ Holzmann","year":"1998","unstructured":"Holzmann, G.J.: An analysis of bitstate hashing. Formal Methods Syst. Des. 13(3), 289\u2013307 (1998)","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-40787-1_9","volume-title":"Runtime Verification","author":"K Kalajdzic","year":"2013","unstructured":"Kalajdzic, K., Bartocci, E., Smolka, S.A., Stoller, S.D., Grosu, R.: Runtime verification with particle filtering. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 149\u2013166. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40787-1_9"},{"issue":"4","key":"1_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real Time Syst. 2(4), 255\u2013299 (1990)","journal-title":"Real Time Syst."},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-22306-8_4","volume-title":"Model Checking Software","author":"A Laarman","year":"2011","unstructured":"Laarman, A., van de Pol, J., Weber, M.: Parallel recursive state compression for free. In: Groce, A., Musuvathi, M. (eds.) SPIN 2011. LNCS, vol. 6823, pp. 38\u201356. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22306-8_4"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-16612-9_11","volume-title":"Runtime Verification","author":"A Legay","year":"2010","unstructured":"Legay, A., Delahaye, B., Bensalem, S.: Statistical model checking: an overview. In: Barringer, H., et al. (eds.) RV 2010. LNCS, vol. 6418, pp. 122\u2013135. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16612-9_11"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s13389-015-0110-5","volume":"6","author":"D Lemire","year":"2015","unstructured":"Lemire, D., Kaser, O.: Faster 64-bit universal hashing using carry-less multiplications. J. Cryptogr. Eng. 6(3), 171\u2013185 (2015). https:\/\/doi.org\/10.1007\/s13389-015-0110-5","journal-title":"J. Cryptogr. Eng."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Mamouras, K., Raghothaman, M., Alur, R., Ives, Z.G., Khanna, S.: StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data. In: PLDI 2017, pp. 693\u2013708. ACM (2017)","DOI":"10.1145\/3140587.3062369"},{"key":"1_CR34","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd edn. Cambridge University Press, Cambridge (2017)"},{"issue":"4","key":"1_CR35","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/s00453-015-0007-9","volume":"73","author":"M Naor","year":"2015","unstructured":"Naor, M., Yogev, E.: Tight bounds for sliding bloom filters. Algorithmica 73(4), 652\u2013672 (2015)","journal-title":"Algorithmica"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Ni, J., Li, J., McAuley, J.J.: Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In: EMNLP 2019, pp. 188\u2013197. Association for Computational Linguistics (2019). Dataset: https:\/\/nijianmo.github.io\/amazon\/index.html","DOI":"10.18653\/v1\/D19-1018"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-30446-1_17","volume-title":"Software Engineering and Formal Methods","author":"DB de Oliveira","year":"2019","unstructured":"de Oliveira, D.B., Cucinotta, T., de Oliveira, R.S.: Efficient formal verification for the Linux kernel. In: \u00d6lveczky, P.C., Sala\u00fcn, G. (eds.) SEFM 2019. LNCS, vol. 11724, pp. 315\u2013332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30446-1_17"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Orgun, M.A., Wadge, W.W.: A relational algebra as a query language for temporal DATALOG. In: Tjoa, A., Ramos, I. (eds.) DEXA 1992, pp. 276\u2013281. Springer, Vienna (1992). https:\/\/doi.org\/10.1007\/978-3-7091-7557-6_48","DOI":"10.1007\/978-3-7091-7557-6_48"},{"key":"1_CR39","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal Bloom filter replacement. In: SODA 2005, pp. 823\u2013829. SIAM (2005)"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Pagh, R., Segev, G., Wieder, U.: How to approximate a set without knowing its size in advance. In: FOCS 2013, pp. 80\u201389. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.17"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., Chen, F.: Semantics and algorithms for parametric monitoring. Log. Methods Comput. Sci. 8(1) (2012)","DOI":"10.2168\/LMCS-8(1:9)2012"},{"key":"1_CR42","unstructured":"Schneider, J.: Randomized first-order monitoring with hashing (extended report) (2022). https:\/\/ethz.ch\/content\/dam\/ethz\/special-interest\/infk\/inst-infsec\/information-security-group-dam\/research\/publications\/pub2022\/rv22-extended.pdf"},{"issue":"1","key":"1_CR43","first-page":"1","volume":"6","author":"J Schumann","year":"2015","unstructured":"Schumann, J., Rozier, K.Y., Reinbacher, T., Mengshoel, O.J., Mbaya, T., Ippolito, C.: Towards real-time, on-board, hardware-supported sensor and software health management for unmanned aerial systems. Int. J. Progn. Health Manag. 6(1), 1\u201327 (2015)","journal-title":"Int. J. Progn. Health Manag."},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-27813-9_16","volume-title":"Computer Aided Verification","author":"K Sen","year":"2004","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Statistical model checking of black-box probabilistic systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 202\u2013215. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_16"},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Des. Codes Cryptogr. 4(4), 369\u2013380 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR46","unstructured":"Tuzhilin, A., Clifford, J.: A temporal relational algebra as basis for temporal relational completeness. In: VLDB Conference 1990, pp. 13\u201323. Morgan Kaufmann (1990)"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC 1982, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Wang, Z., Luo, T., Xu, G., Wang, X.: The application of cartesian-join of Bloom filters to supporting membership query of multidimensional data. In: 2014 IEEE International Congress on Big Data, pp. 288\u2013295. IEEE Computer Society (2014)","DOI":"10.1109\/BigData.Congress.2014.49"},{"issue":"3","key":"1_CR49","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"158","key":"1_CR50","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/01621459.1927.10502953","volume":"22","author":"EB Wilson","year":"1927","unstructured":"Wilson, E.B.: Probable inference, the law of succession, and statistical inference. J. Am. Stat. Assoc. 22(158), 209\u2013212 (1927)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17196-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T14:04:19Z","timestamp":1672841059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17196-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171956","9783031171963"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17196-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Runtime Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilsi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rv22.gitlab.io","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":"40","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":"12","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":"10","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":"30% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}