{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:30:37Z","timestamp":1763728237057,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031103629"},{"type":"electronic","value":"9783031103636"}],"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-10363-6_23","type":"book-chapter","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T12:20:21Z","timestamp":1656678021000},"page":"344-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["AllSynth: Transiently Correct Network Update Synthesis Accounting for\u00a0Operator Preferences"],"prefix":"10.1007","author":[{"given":"Kim Guldstrand","family":"Larsen","sequence":"first","affiliation":[]},{"given":"Anders","family":"Mariegaard","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,3]]},"reference":[{"key":"23_CR1","unstructured":"dd python package (2021). https:\/\/github.com\/tulip-control\/dd"},{"key":"23_CR2","unstructured":"Akhoondian Amiri, S., Dudycz, S., Schmid, S., Wiederrecht, S.: Congestion-free rerouting of flows on DAGs. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP), vol. 107, pp. 143:1\u2013143:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/2578855.2535862","volume":"49","author":"CJ Anderson","year":"2014","unstructured":"Anderson, C.J., et al.: NetKAT: semantic foundations for networks. ACM SIGPLAN Notices 49(1), 113\u2013126 (2014)","journal-title":"ACM SIGPLAN Notices"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Avin, C., Ghobadi, M., Griner, C., Schmid, S.: On the complexity of traffic traces and implications. In: Proceedings of the ACM SIGMETRICS (2020)","DOI":"10.1145\/3393691.3394205"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Beckett, R., Mahajan, R., Millstein, T., Padhye, J., Walker, D.: Don\u2019t mind the gap: bridging network-wide objectives and device-level configurations. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 328\u2013341 (2016)","DOI":"10.1145\/2934872.2934909"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Benson, T., Akella, A., Maltz, D.A.: Network traffic characteristics of data centers in the wild. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, pp. 267\u2013280 (2010)","DOI":"10.1145\/1879141.1879175"},{"key":"23_CR7","unstructured":"Brain, M.N., Davenport, J.H., Griggio, A.: Benchmarking solvers, SAT-style. In: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017). CEUR, vol. 1974, pp. 1\u201315. CEUR-WS.org (2017)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, S., F\u00f6rster, K.T., Wattenhofer, R.: On consistent migration of flows in SDNs. In: IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications, pp. 1\u20139. IEEE (2016)","DOI":"10.1109\/INFOCOM.2016.7524332"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Bryant: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C3-5(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Canini, M., Kuznetsov, P., Levin, D., Schmid, S.: A distributed and robust SDN control plane for transactional network updates. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 190\u2013198. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218382"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-662-53426-7_9","volume-title":"Distributed Computing","author":"P \u010cern\u00fd","year":"2016","unstructured":"\u010cern\u00fd, P., Foster, N., Jagnik, N., McClurg, J.: Optimal consistent network updates in polynomial time. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 114\u2013128. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_9"},{"key":"23_CR12","unstructured":"Chirgwin, R.: Google routing blunder sent Japan\u2019s internet dark on friday (2017). https:\/\/www.theregister.co.uk\/2017\/08\/27\/google_routing_blunder_sent_japans_internet_dark\/"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NUSMV: a new symbolic model checker. Int. J. Softw. Tools Technol. Transf. 2(4), 410\u2013425 (2000). https:\/\/doi.org\/10.1007\/s100090050046","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Dudycz, S., Ludwig, A., Schmid, S.: Can\u2019t touch this: consistent network updates for multiple policies. In: 2016 46th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 133\u2013143. IEEE (2016)","DOI":"10.1109\/DSN.2016.21"},{"key":"23_CR15","unstructured":"Duluth News Tribune: Human error to blame in minnesota 911 outage (2018). https:\/\/www.ems1.com\/911\/articles\/389343048-Officials-Human-error-to-blame-in-Minn-911-outage\/"},{"key":"23_CR16","unstructured":"El-Hassany, A., Tsankov, P., Vanbever, L., Vechev, M.: Netcomplete: practical network-wide configuration synthesis with autocompletion. In: 15th $$\\{$$USENIX$$\\}$$ Symposium on Networked Systems Design and Implementation ($$\\{$$NSDI$$\\}$$ 2018), pp. 579\u2013594 (2018)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Feamster, N., Rexford, J.: Why (and how) networks should run themselves. arXiv report (2017)","DOI":"10.1145\/3232755.3234555"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.R.: Model checking data flows in concurrent network updates (full version). arXiv preprint arXiv:1907.11061 (2019)","DOI":"10.1007\/978-3-030-31784-3_30"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/COMST.2018.2876749","volume":"21","author":"K Foerster","year":"2019","unstructured":"Foerster, K., Schmid, S., Vissicchio, S.: Survey of consistent software-defined network updates. IEEE Commun. Surv. Tutor. 21(2), 1435\u20131461 (2019)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Foerster, K.T.: On the consistent migration of unsplittable flows: upper and lower complexity bounds. In: 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA), pp. 1\u20134. IEEE (2017)","DOI":"10.1109\/NCA.2017.8171348"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2016.11.018","volume":"709","author":"KT Foerster","year":"2018","unstructured":"Foerster, K.T., Luedi, T., Seidel, J., Wattenhofer, R.: Local checkability, no strings attached:(a) cyclicity, reachability, loop free updates in SDNs. Theoret. Comput. Sci. 709, 48\u201363 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR22","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pp. 854\u2013860. AAAI Press (2013)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Glavind, M., Christensen, N., Srba, J., Schmid, S.: Latte: improving the latency of transiently consistent network update schedules. In: Proceedings of 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE) (2020)","DOI":"10.1145\/3453953.3453957"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Heller, B., et al.: Leveraging SDN layering to systematically troubleshoot networks. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, pp. 37\u201342 (2013)","DOI":"10.1145\/2491185.2491197"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Jin, X., et al.: Dynamic scheduling of network updates. In: ACM SIGCOMM Computer Communication Review, vol. 44, no. 4, pp. 539\u2013550. ACM (2014)","DOI":"10.1145\/2740070.2626307"},{"key":"23_CR26","unstructured":"Kazemian, P., Chang, M., Zeng, H., Varghese, G., McKeown, N., Whyte, S.: Real time network policy checking using header space analysis. In: Presented as part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2013), pp. 99\u2013111 (2013)"},{"key":"23_CR27","unstructured":"Kazemian, P., Varghese, G., McKeown, N.: Header space analysis: static checking for networks. In: Presented as part of the 9th $$\\{$$USENIX$$\\}$$ Symposium on Networked Systems Design and Implementation ($$\\{$$NSDI$$\\}$$ 2012), pp. 113\u2013126 (2012)"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Kellerer, W., Kalmbach, P., Blenk, A., Basta, A., Reisslein, M., Schmid, S.: Adaptable and data-driven softwarized networks: review, opportunities, and challenges. In: Proceedings of the IEEE (PIEEE) (2019)","DOI":"10.1109\/JPROC.2019.2895553"},{"issue":"9","key":"23_CR29","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R.A., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765\u20131775 (2011). https:\/\/doi.org\/10.1109\/JSAC.2011.111002","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/JPROC.2014.2371999","volume":"103","author":"D Kreutz","year":"2014","unstructured":"Kreutz, D., Ramos, F.M., Verissimo, P.E., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14\u201376 (2014)","journal-title":"Proc. IEEE"},{"key":"23_CR31","unstructured":"Larsen, K., Mariegaard, A., Schmid, S., Srba, J.: Reproducibility package for: the hazard value: a quantitative network connectivy measure accounting for failures, March 2022. https:\/\/doi.org\/10.5281\/zenodo.6534948"},{"issue":"4","key":"23_CR32","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. The Bell Syst. Tech. J. 38(4), 985\u2013999 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01585.x","journal-title":"The Bell Syst. Tech. J."},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Liu, H.H., Wu, X., Zhang, M., Yuan, L., Wattenhofer, R., Maltz, D.: zUpdate: updating data center networks with zero loss. In: ACM SIGCOMM Computer Communication Review, vol. 43, no. 4, pp. 411\u2013422. ACM (2013)","DOI":"10.1145\/2534169.2486005"},{"issue":"1","key":"23_CR34","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/2964791.2901476","volume":"44","author":"A Ludwig","year":"2016","unstructured":"Ludwig, A., Dudycz, S., Rost, M., Schmid, S.: Transiently secure network updates. ACM SIGMETRICS Perform. Eval. Rev. 44(1), 273\u2013284 (2016)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Ludwig, A., Marcinkowski, J., Schmid, S.: Scheduling loop-free network updates: it\u2019s good to relax! In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 13\u201322. ACM (2015)","DOI":"10.1145\/2767386.2767412"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Ludwig, A., Rost, M., Foucard, D., Schmid, S.: Good network updates for bad packets: waypoint enforcement beyond destination-based routing policies. In: Proceedings of 13th ACM Workshop on Hot Topics in Networks (HotNets), p. 15. ACM (2014)","DOI":"10.1145\/2670518.2673873"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Mahajan, R., Wattenhofer, R.: On consistent updates in software defined networks. In: Proceedings of 12th ACM Workshop on Hot Topics in Networks (HotNets), p. 20. ACM (2013)","DOI":"10.1145\/2535771.2535791"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"McClurg, J., Hojjat, H., Cern\u00fd, P., Foster, N.: Efficient synthesis of network updates. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 196\u2013207 (2015). https:\/\/doi.org\/10.1145\/2737924.2737980","DOI":"10.1145\/2737924.2737980"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"McClurg, J., Hojjat, H., \u010cern\u1ef3, P., Foster, N.: Efficient synthesis of network updates. In: ACM SIGPLAN Notices, vol. 50, no. 6, pp. 196\u2013207. ACM (2015)","DOI":"10.1145\/2813885.2737980"},{"key":"23_CR40","unstructured":"Monsanto, C., Reich, J., Foster, N., Rexford, J., Walker, D.: Composing software defined networks. In: 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2013), pp. 1\u201313 (2013)"},{"key":"23_CR41","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 46\u201357. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"23_CR42","unstructured":"Prabhu, S., Chou, K.Y., Kheradmand, A., Godfrey, B., Caesar, M.: Plankton: scalable network configuration verification through model checking. In: 17th USENIX Symposium on Networked Systems Design and Implementation ($$\\{$$NSDI$$\\}$$ 2020), pp. 953\u2013967 (2020)"},{"issue":"4","key":"23_CR43","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/2377677.2377748","volume":"42","author":"M Reitblatt","year":"2012","unstructured":"Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., Walker, D.: Abstractions for network update. ACM SIGCOMM Comput. Commun. Rev. 42(4), 323\u2013334 (2012)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"23_CR44","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0.0. University of Colorado at Boulder (2015). http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Steffen, S., Gehr, T., Tsankov, P., Vanbever, L., Vechev, M.: Probabilistic verification of network configurations. In: Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 750\u2013764 (2020)","DOI":"10.1145\/3387514.3405900"},{"key":"23_CR46","doi-asserted-by":"publisher","unstructured":"Vissicchio, S., Cittadini, L.: FLIP the (flow) table: fast lightweight policy-preserving SDN updates. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, 10\u201314 April 2016, pp. 1\u20139 (2016). https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524419","DOI":"10.1109\/INFOCOM.2016.7524419"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Zerwas, J., et al.: AHAB: data-driven virtual cluster hunting. In: Proceedings of IFIP Networking (2018)","DOI":"10.23919\/IFIPNetworking.2018.8696399"},{"key":"23_CR48","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Liu, V., Zeng, H., Krishnamurthy, A.: High-resolution measurement of data center microbursts. In: Proceedings of the 2017 Internet Measurement Conference, pp. 78\u201385 (2017)","DOI":"10.1145\/3131365.3131375"},{"key":"23_CR49","unstructured":"Zhou, W., Jin, D., Croft, J., Caesar, M., Godfrey, P.B.: Enforcing customizable consistency properties in software-defined networks. In: Proceedings of 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2015), pp. 73\u201385 (2015)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10363-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T08:08:50Z","timestamp":1656749330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10363-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031103629","9783031103636"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10363-6_23","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":"3 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","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":"tase2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ubbcluj.ro\/tase2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"71","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":"21","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":"5","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":"4","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)"}}]}}