{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:40Z","timestamp":1759638520053,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_3","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"36-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems"],"prefix":"10.1007","author":[{"given":"Chryssis","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Marcoullis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad M.","family":"Schiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.jcss.2014.11.014","volume":"81","author":"N Alon","year":"2015","unstructured":"Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4), 692\u2013701 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-57271-6_35","volume-title":"Distributed Algorithms","author":"E Anagnostou","year":"1993","unstructured":"Anagnostou, E., Hadzilacos, V.: Tolerating transient and permanent failures (extended abstract). In: Schiper, A. (ed.) WDAG 1993. LNCS, vol. 725, pp. 174\u2013188. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57271-6_35"},{"key":"3_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02013-1","volume-title":"Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory","author":"K Altisen","year":"2019","unstructured":"Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2019)"},{"issue":"11","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1080\/00207729708929476","volume":"28","author":"J Beauquier","year":"1997","unstructured":"Beauquier, J., Kekkonen-Moneta, S.: Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. Int. J. Syst. Sci. 28(11), 1177\u20131187 (1997)","journal-title":"Int. J. Syst. Sci."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Dolev, D., Hoch, E.N.: Fast self-stabilizing Byzantine tolerant digital clock synchronization. In: Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC\u201908, pp. 385\u2013394. ACM (2008)","DOI":"10.1145\/1400751.1400802"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-49259-9_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Binun","year":"2016","unstructured":"Binun, A., et al.: Self-stabilizing Byzantine-tolerant distributed replicated state machine. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 36\u201353. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_4"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-030-20951-3_10","volume-title":"Cyber Security Cryptography and Machine Learning","author":"A Binun","year":"2019","unstructured":"Binun, A., Dolev, S., Hadad, T.: Self-stabilizing Byzantine consensus for blockchain. In: Dolev, S., Hendler, D., Lodha, S., Yung, M. (eds.) CSCML 2019. LNCS, vol. 11527, pp. 106\u2013110. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20951-3_10"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Dolev, S., Potop-Butucaru, M., Raynal, M.: Stabilizing server-based storage in Byzantine asynchronous message-passing systems. In: ACM Symposium on Principles of Distributed Computing, PODC\u201915, pp. 471\u2013479. ACM (2015)","DOI":"10.1145\/2767386.2767441"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Potop-Butucaru, M., Tixeuil, S.: Stabilizing Byzantine-fault tolerant storage. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS\u201915, pp. 894\u2013903. IEEE Computer Society (2015)","DOI":"10.1109\/IPDPS.2015.89"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Optimal mobile Byzantine fault tolerant distributed storage. In: ACM Symposium on Principles of Distributed Computing, PODC\u201916, pp. 269\u2013278. ACM (2016)","DOI":"10.1145\/2933057.2933100"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Optimal storage under unsynchronized mobile Byzantine faults. In: 36th IEEE Symposium on Reliable Distributed Systems, SRDS\u201917, pp. 154\u2013163. IEEE Computer Society (2017)","DOI":"10.1109\/SRDS.2017.20"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-03232-6_28","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Bonomi","year":"2018","unstructured":"Bonomi, S., Del Pozzo, A., Potop-Butucaru, M., Tixeuil, S.: Brief announcement: optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 398\u2013403. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_28"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2018.08.001","volume":"758","author":"S Bonomi","year":"2019","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. Theor. Comput. Sci. 758, 17\u201329 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. IACR Cryptol. ePrint Arch. 2001, 6 (2001). http:\/\/eprint.iacr.org\/2001\/006","DOI":"10.1007\/3-540-44647-8_31"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1093\/comjnl\/bxh145","volume":"49","author":"M Correia","year":"2006","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: From consensus to atomic broadcast: time-free Byzantine-resistant protocols without signatures. Comput. J. 49(1), 82\u201396 (2006)","journal-title":"Comput. J."},{"issue":"11","key":"3_CR17","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jcss.2018.04.003","volume":"96","author":"S Dolev","year":"2018","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Practically-self-stabilizing virtual synchrony. J. Comput. Syst. Sci. 96, 50\u201373 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-94147-9_7","volume-title":"Cyber Security Cryptography and Machine Learning","author":"S Dolev","year":"2018","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing Byzantine tolerant replicated state machine based on failure detectors. In: Dinur, I., Dolev, S., Lodha, S. (eds.) CSCML 2018. LNCS, vol. 10879, pp. 84\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94147-9_7"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40148-0_4","volume-title":"Networked Systems","author":"S Dolev","year":"2013","unstructured":"Dolev, S., Liba, O., Schiller, E.M.: Self-stabilizing Byzantine resilient topology discovery and message delivery. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 42\u201357. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40148-0_4"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of Byzantine faults. In: 14th Principles of Distributed Computing PODC\u201995, p. 256. ACM (1995)","DOI":"10.1145\/224964.224994"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: BEAT: asynchronous BFT made practical. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 2028\u20132041. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243812","DOI":"10.1145\/3243734.3243812"},{"issue":"29","key":"3_CR24","doi-asserted-by":"publisher","first-page":"3418","DOI":"10.1016\/j.tcs.2011.02.012","volume":"412","author":"S Dubois","year":"2011","unstructured":"Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Dynamic FTSS in asynchronous systems: the case of unison. Theor. Comput. Sci. 412(29), 3418\u20133439 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"3_CR25","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.jpdc.2012.04.001","volume":"72","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Potop-Butucaru, M., Nesterenko, M., Tixeuil, S.: Self-stabilizing Byzantine asynchronous unison. J. Parallel Distrib. Comput. 72(7), 917\u2013923 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-31277-0_9","volume-title":"Networked Systems","author":"C Georgiou","year":"2019","unstructured":"Georgiou, C., Gustafsson, R., Lindh\u00e9, A., Schiller, E.M.: Self-stabilization overhead: a case study on coded atomic storage. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 131\u2013147. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31277-0_9"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-31277-0_8","volume-title":"Networked Systems","author":"C Georgiou","year":"2019","unstructured":"Georgiou, C., Lundstr\u00f6m, O., Schiller, E.M.: Self-stabilizing snapshot objects for asynchronous failure-prone networked systems. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 113\u2013130. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31277-0_8"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Dolev, S., Petig, T., Schiller, E.M.: Brief announcement: robust and private distributed shared atomic memory in message passing networks. In: Distributed Computing, PODC\u201915, pp. 311\u2013313. ACM (2015)","DOI":"10.1145\/2767386.2767450"},{"key":"3_CR31","unstructured":"Dolev, S., Petig, T., Schiller, E.M.: Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks. CoRR abs\/1806.03498 (2018)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Marcoullis, I., Raynal, M., Schiller, E.M.: Loosely-self-stabilizing Byzantine-tolerant binary consensus for signature-free message-passing systems. CoRR abs\/2103.14649 (2021)","DOI":"10.1007\/978-3-030-91014-3_3"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-017-9840-3","volume":"63","author":"P Khanchandani","year":"2019","unstructured":"Khanchandani, P., Lenzen, C.: Self-stabilizing Byzantine clock synchronization with optimal precision. Theory Comput. Syst. 63(2), 261\u2013305 (2019). https:\/\/doi.org\/10.1007\/s00224-017-9840-3","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"3_CR34","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Rybicki, J.: Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. J. ACM 66(5), 32:1\u201332:56 (2019)","DOI":"10.1145\/3339471"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Lundstr\u00f6m, O., Raynal, M., Schiller, E.M.: Self-stabilizing set-constrained delivery broadcast. In: 40th Distributed Computing Systems, ICDCS\u201920, pp. 617\u2013627. IEEE (2020)","DOI":"10.1109\/ICDCS47774.2020.00080"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-030-67087-0_19","volume-title":"Networked Systems","author":"O Lundstr\u00f6m","year":"2021","unstructured":"Lundstr\u00f6m, O., Raynal, M., M. Schiller, E.: Self-stabilizing uniform reliable broadcast. In: Georgiou, C., Majumdar, R. (eds.) NETYS 2020. LNCS, vol. 12129, pp. 296\u2013313. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_19"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Lundstr\u00f6m, O., Raynal, M., Schiller, E.M.: Self-stabilizing indulgent zero-degrading binary consensus. In: Distributed Computing and Networking ICDCN\u201921, pp. 106\u2013115. ACM (2021)","DOI":"10.1145\/3427796.3427836"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Lundstr\u00f6m, O., Raynal, M., Schiller, E.M.: Self-stabilizing multivalued consensus in asynchronous crash-prone systems. CoRR abs\/2104.03129 (2021). https:\/\/arxiv.org\/abs\/2104.03129","DOI":"10.1109\/EDCC53658.2021.00023"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Computer and Communications Security, CCS \u201916, pp. 31\u201342. ACM (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Hamouma, M., Raynal, M.: Signature-free asynchronous Byzantine consensus with $$t<n\/3$$ and $$O(n^2)$$ messages. In: ACM Symposium on Principles of Distributed Computing, PODC\u201914, pp. 2\u20139. ACM (2014)","DOI":"10.1145\/2611462.2611468"},{"issue":"2","key":"3_CR42","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"3_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-05529-5_21","volume-title":"Networked Systems","author":"I Salem","year":"2019","unstructured":"Salem, I., Schiller, E.M.: Practically-self-stabilizing vector clocks in the absence of execution fairness. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 318\u2013333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05529-5_21"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2012.01.007","volume":"444","author":"Y Sudo","year":"2012","unstructured":"Sudo, Y., Nakamura, J., Yamauchi, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Loosely-stabilizing leader election in a population protocol model. Theor. Comput. Sci. 444, 100\u2013112 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Toueg, S.: Randomized Byzantine agreements. In: Third Annual ACM Symposium on Principles of Distributed Computing PODC\u201984, pp. 163\u2013178. ACM (1984)","DOI":"10.1145\/800222.806744"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T21:01:16Z","timestamp":1673902876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"32","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":"15","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":"2","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":"47% - 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":"2,84","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)"}}]}}