{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:28:44Z","timestamp":1778354924938,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031263897","type":"print"},{"value":"9783031263903","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26390-3_5","type":"book-chapter","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T09:04:46Z","timestamp":1678957486000},"page":"69-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Inferring Tie Strength in\u00a0Temporal Networks"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Oettershagen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios L.","family":"Konstantinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-020-00673-0","volume":"34","author":"F Adriaens","year":"2020","unstructured":"Adriaens, F., De Bie, T., Gionis, A., Lijffijt, J., Matakos, A., Rozenshtein, P.: Relaxing the strong triadic closure problem for edge strength inference. Data Min. Knowl. Disc. 34, 1\u201341 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Haddadan, S.: A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications. In: International Conference on Big Data (Big Data), pp. 5\u201314. IEEE (2020)","DOI":"10.1109\/BigData50022.2020.9378434"},{"issue":"3","key":"5_CR3","first-page":"859","volume":"47","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Henzinger, M., Italiano, G.F.: Deterministic fully dynamic data structures for vertex cover and matching. J. Comput. 47(3), 859\u2013887 (2018)","journal-title":"J. Comput."},{"issue":"22","key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/22\/224015","volume":"41","author":"J Candia","year":"2008","unstructured":"Candia, J., Gonz\u00e1lez, M.C., Wang, P., Schoenharl, T., Madey, G., Barab\u00e1si, A.L.: Uncovering individual and collective human dynamics from mobile phone records. J. Phys. A Math. Theor. 41(22), 224015 (2008)","journal-title":"J. Phys. A Math. Theor."},{"key":"5_CR5","unstructured":"Chen, J., Molter, H., Sorge, M., Such\u00fd, O.: Cluster editing in multi-layer and temporal graphs. In: International Symposium on Algorithms and Computation, ISAAC, LIPIcs, vol. 123, pp. 24:1\u201324:13. Schloss Dagstuhl-LZI (2018)"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets - Reasoning About a Highly Connected World","author":"DA Easley","year":"2010","unstructured":"Easley, D.A., Kleinberg, J.M.: Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"issue":"40","key":"5_CR7","doi-asserted-by":"publisher","first-page":"14333","DOI":"10.1073\/pnas.0405728101","volume":"101","author":"JP Eckmann","year":"2004","unstructured":"Eckmann, J.P., Moses, E., Sergi, D.: Entropy of dialogues creates coherent structures in e-mail traffic. Proc. Natl. Acad. Sci. 101(40), 14333\u201314337 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1\u20132","key":"5_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta M. Hung. 18(1\u20132), 25\u201366 (1967)","journal-title":"Acta M. Hung."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci. 7(1), 11 (2018)","journal-title":"EPJ Data Sci."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, E., Karahalios, K.: Predicting tie strength with social media. In: Proceedings of the 27th International Conference on Human Factors in Computing Systems, CHI, pp. 211\u2013220. ACM (2009)","DOI":"10.1145\/1518701.1518736"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gilbert, E., Karahalios, K., Sandvig, C.: The network in the garden: an empirical analysis of social media in rural life. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1603\u20131612 (2008)","DOI":"10.1145\/1357054.1357304"},{"issue":"6","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter, M.S.: The strength of weak ties. A. J. Soc. 78(6), 1360\u20131380 (1973)","journal-title":"A. J. Soc."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00453-019-00617-1","volume":"82","author":"N Gr\u00fcttemeier","year":"2020","unstructured":"Gr\u00fcttemeier, N., Komusiewicz, C.: On the relation of strong triadic closure and cluster deletion. Algorithmica 82, 853\u2013880 (2020)","journal-title":"Algorithmica"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-73133-7_9","volume-title":"Statistical Network Analysis: Models, Issues, and New Directions","author":"S Hanneke","year":"2007","unstructured":"Hanneke, S., Xing, E.P.: Discrete temporal models of social networks. In: Airoldi, E., Blei, D.M., Fienberg, S.E., Goldenberg, A., Xing, E.P., Zheng, A.X. (eds.) ICML 2006. LNCS, vol. 4503, pp. 115\u2013125. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73133-7_9"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Hessel, J., Tan, C., Lee, L.: Science, askscience, and badscience: on the coexistence of highly related communities. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 10, pp. 171\u2013180 (2016)","DOI":"10.1609\/icwsm.v10i1.14739"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Himmel, A., Molter, H., Niedermeier, R., Sorge, M.: Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1), 35:1\u201335:16 (2017)","DOI":"10.1007\/s13278-017-0455-0"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2004.01.007","volume":"26","author":"P Holme","year":"2004","unstructured":"Holme, P., Edling, C.R., Liljeros, F.: Structure and time evolution of an internet dating community. Social Netw. 26(2), 155\u2013174 (2004)","journal-title":"Social Netw."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Huang, H., Tang, J., Wu, S., Liu, L., Fu, X.: Mining triadic closure patterns in social networks. In: International Conference on World Wide Web, WWW, pp. 499\u2013504. ACM (2014)","DOI":"10.1145\/2567948.2576940"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Kahanda, I., Neville, J.: Using transactional information to predict link strength in online social networks. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 3, pp. 74\u201381 (2009)","DOI":"10.1609\/icwsm.v3i1.13957"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR22","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education, Noida (2006)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"Machine Learning: ECML 2004","author":"B Klimt","year":"2004","unstructured":"Klimt, B., Yang, Y.: The enron corpus: a new dataset for email classification research. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217\u2013226. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2018.05.012","volume":"740","author":"AL Konstantinidis","year":"2018","unstructured":"Konstantinidis, A.L., Nikolopoulos, S.D., Papadopoulos, C.: Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comp. Sci. 740, 76\u201384 (2018)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2020.05.035","volume":"285","author":"AL Konstantinidis","year":"2020","unstructured":"Konstantinidis, A.L., Papadopoulos, C.: Maximizing the strong triadic closure in split graphs and proper interval graphs. Disc. Appl. Math. 285, 79\u201395 (2020)","journal-title":"Disc. Appl. Math."},{"issue":"5757","key":"5_CR26","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G., Watts, D.J.: Empirical analysis of an evolving social network. Science 311(5757), 88\u201390 (2006)","journal-title":"Science"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 61:1\u201361:29 (2018)","DOI":"10.1007\/s13278-018-0537-7"},{"issue":"2","key":"5_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1177\/004912417800700203","volume":"7","author":"N Lin","year":"1978","unstructured":"Lin, N., Dayton, P.W., Greenwald, P.: Analyzing the instrumental use of relations in the context of social structure. Sociol. Meth. Res. 7(2), 149\u2013166 (1978)","journal-title":"Sociol. Meth. Res."},{"issue":"1","key":"5_CR29","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s10618-021-00812-1","volume":"36","author":"A Matakos","year":"2022","unstructured":"Matakos, A., Gionis, A.: Strengthening ties towards a highly-connected world. Data Min. Knowl. Disc. 36(1), 448\u2013476 (2022)","journal-title":"Data Min. Knowl. Disc."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"issue":"10","key":"5_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.108701","volume":"114","author":"A Moinet","year":"2015","unstructured":"Moinet, A., Starnini, M., Pastor-Satorras, R.: Burstiness and aging in social temporal networks. Phys. Rev. Lett. 114(10), 108701 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"5_CR32","unstructured":"Oettershagen, L., Konstantinidis, A.L., Italiano, G.F.: Inferring tie strength in temporal networks (2022). https:\/\/arxiv.org\/abs\/2206.11705"},{"issue":"5","key":"5_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1089\/big.2020.0086","volume":"8","author":"L Oettershagen","year":"2020","unstructured":"Oettershagen, L., Kriege, N.M., Morris, C., Mutzel, P.: Classifying dissemination processes in temporal graphs. Big Data 8(5), 363\u2013378 (2020)","journal-title":"Big Data"},{"issue":"1","key":"5_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1140\/epjds\/s13688-021-00302-w","volume":"10","author":"L Ozella","year":"2021","unstructured":"Ozella, L., et al.: Using wearable proximity sensors to characterize social contact patterns in a village of rural malawi. EPJ Data Sci. 10(1), 46 (2021)","journal-title":"EPJ Data Sci."},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the tenth ACM International Conference on Web Search and Data Mining, pp. 601\u2013610 (2017)","DOI":"10.1145\/3018661.3018731"},{"issue":"8","key":"5_CR36","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1007\/s11590-018-1330-2","volume":"13","author":"A Pyatkin","year":"2019","unstructured":"Pyatkin, A., Lykhovyd, E., Butenko, S.: The maximum number of induced open triangles in graphs of a given order. Optim. Lett. 13(8), 1927\u20131935 (2019)","journal-title":"Optim. Lett."},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com\/","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Inferring the strength of social ties: a community-driven approach. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1017\u20131025. ACM (2017)","DOI":"10.1145\/3097983.3098199"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Sintos, S., Tsaparas, P.: Using strong triadic closure to characterize ties in social networks. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1466\u20131475 (2014)","DOI":"10.1145\/2623330.2623664"},{"issue":"8","key":"5_CR40","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, J., et al.: High-resolution measurements of face-to-face contact patterns in a primary school. PloS One 6(8), e23176 (2011)","journal-title":"PloS One"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T.Y.: Finding communities in dynamic social networks. In: International Conference on Data Mining, ICDM, pp. 1236\u20131241. IEEE (2011)","DOI":"10.1109\/ICDM.2011.67"},{"key":"5_CR42","unstructured":"Wei, H.T., Hon, W.K., Horn, P., Liao, C.S., Sadakane, K.: An O(1)-approximation algorithm for dynamic weighted vertex cover with soft capacity. In: Approximation, Random, and Combinatorial Optics Algorithm and Techniques (APPROX\/RANDOM 2018). LIPIcs, vol. 116, pp. 27:1\u201327:14. Schloss Dagstuhl-LZI (2018)"},{"issue":"8","key":"5_CR43","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TKDE.2016.2556663","volume":"28","author":"B Wu","year":"2016","unstructured":"Wu, B., Yi, K., Li, Z.: Counting triangles in large graphs by random sampling. IEEE Trans. Knowl. Data Eng. 28(8), 2013\u20132026 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Xiang, R., Neville, J., Rogati, M.: Modeling relationship strength in online social networks. In: International Conference on World Wide Web, WWW, pp. 981\u2013990. ACM (2010)","DOI":"10.1145\/1772690.1772790"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yang, Y., Ren, X., Wu, F., Zhuang, Y.: Dynamic network embedding by modeling triadic closure process. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, pp. 571\u2013578. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11257"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26390-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T07:04:34Z","timestamp":1697180674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26390-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031263897","9783031263903"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26390-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 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":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"0","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":"22% - 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-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":"3-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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}