{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:52Z","timestamp":1770921412101,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_30","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:22Z","timestamp":1770918802000},"page":"404-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Private Graph Colouring with\u00a0Limited Defectiveness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9486-9115","authenticated-orcid":false,"given":"Aleksander B. G.","family":"Christiansen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5853-7909","authenticated-orcid":false,"given":"Eva","family":"Rotenberg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1078-4075","authenticated-orcid":false,"given":"Teresa Anna","family":"Steiner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0079-8523","authenticated-orcid":false,"given":"Juliette","family":"Vlieghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/jgt.3190110408","volume":"11","author":"D Archdeacon","year":"1987","unstructured":"Archdeacon, D.: A note on defective colorings of graphs in surfaces. J. Graph Theory 11(4), 517\u2013519 (1987). https:\/\/doi.org\/10.1002\/jgt.3190110408","journal-title":"J. Graph Theory"},{"key":"30_CR2","unstructured":"Arora, R., Upadhyay, J.: On differentially private graph sparsification and applications. In: Proceedings of 32nd NeurIPS 2019, pp. 13378\u201313389 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/e44e875c12109e4fa3716c05008048b2-Abstract.html"},{"key":"30_CR3","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Elkin, M.: Distributed (delta+1)-coloring in linear (in delta) time. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pp. 111\u2013120. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536432","DOI":"10.1145\/1536414.1536432"},{"key":"30_CR4","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23:1\u201323:25 (2011). https:\/\/doi.org\/10.1145\/2027216.2027221","DOI":"10.1145\/2027216.2027221"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Blocki, J., Blum, A., Datta, A., Sheffet, O.: Differentially private data analysis of social networks via restricted sensitivity. In: Proceedings of the 4th ITCS, pp. 87\u201396 (2013). https:\/\/doi.org\/10.1145\/2422436.2422449","DOI":"10.1145\/2422436.2422449"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.20467","volume":"65","author":"OV Borodin","year":"2010","unstructured":"Borodin, O.V., Ivanova, A.O., Montassier, M., Ochem, P., Raspaud, A.: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2), 83\u201393 (2010). https:\/\/doi.org\/10.1002\/jgt.20467","journal-title":"J. Graph Theory"},{"key":"30_CR7","doi-asserted-by":"publisher","unstructured":"Chen, J.Y., et al.: Differentially private all-pairs shortest path distances: Improved algorithms and lower bounds. In: Proceedings of the 34th SODA, pp. 5040\u20135067 (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch184","DOI":"10.1137\/1.9781611977554.ch184"},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Chen, S., Zhou, S.: Recursive mechanism: towards node differential privacy and unrestricted joins. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, 22\u201327 June 2013, pp. 653\u2013664. ACM (2013). https:\/\/doi.org\/10.1145\/2463676.2465304","DOI":"10.1145\/2463676.2465304"},{"key":"30_CR9","unstructured":"Cohen, E., Kaplan, H., Mansour, Y., Stemmer, U., Tsfadia, E.: Differentially-private clustering of easy instances. In: Proceedings of the 38th ICML 2021, pp. 2049\u20132059 (2021). https:\/\/proceedings.mlr.press\/v139\/cohen21c.html"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Cohen-Addad, V., et al.: Scalable differentially private clustering via hierarchically separated trees. In: Proceedings of the 28th KDD, pp. 221\u2013230 (2022). https:\/\/doi.org\/10.1145\/3534678.3539409","DOI":"10.1145\/3534678.3539409"},{"key":"30_CR11","unstructured":"Cowen, L.J., Goddard, W., Jesurum, C.E.: Coloring with defect. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1997, pp. 548\u2013557. Society for Industrial and Applied Mathematics, USA (1997)"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Day, W., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. In: Proceedings of the 2016 ACM SIGMOD, pp. 123\u2013138 (2016), https:\/\/doi.org\/10.1145\/2882903.2926745","DOI":"10.1145\/2882903.2926745"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Deng, C., Gao, J., Upadhyay, J., Wang, C.: Differentially private range query on shortest paths. In: Proceedings of the 18th WADS, pp. 340\u2013370 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38906-1_23","DOI":"10.1007\/978-3-031-38906-1_23"},{"key":"30_CR14","unstructured":"Dhulipala, L., Henzinger, M., Li, G.Z., Liu, Q.C., Sricharan, A.R., Zhu, L.: Near-optimal differentially private graph algorithms via the multidimensional abovethreshold mechanism. ESA (2025)"},{"key":"30_CR15","doi-asserted-by":"publisher","unstructured":"Dhulipala, L., Liu, Q.C., Raskhodnikova, S., Shi, J., Shun, J., Yu, S.: Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs. In: Proceedings of the 63rd FOCS, pp. 754\u2013765 (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00077","DOI":"10.1109\/FOCS54457.2022.00077"},{"key":"30_CR16","doi-asserted-by":"publisher","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.D.: Calibrating noise to sensitivity in private data analysis. In: Proceedings of the 3rd TCC, pp. 265\u2013284 (2006). https:\/\/doi.org\/10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A.: The Algorithmic Foundations of Differential Privacy. Now Publishers Inc. (2014)","DOI":"10.1561\/9781601988195"},{"issue":"79\u201387","key":"30_CR18","first-page":"40","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton, N., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25(79\u201387), 40 (1999)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"Eden, T., Liu, Q.C., Raskhodnikova, S., Smith, A.D.: Triangle counting with local edge differential privacy. In: Proceedings of the 50th ICALP, pp. 52:1\u201352:21 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.52","DOI":"10.4230\/LIPIcs.ICALP.2023.52"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Eli\u00e1s, M., Kapralov, M., Kulkarni, J., Lee, Y.T.: Differentially private release of synthetic graphs. In: Proceedings of the 31st SODA, pp. 560\u2013578 (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.34","DOI":"10.1137\/1.9781611975994.34"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02280296","volume":"18","author":"P Erd\u0151s","year":"1967","unstructured":"Erd\u0151s, P., Hajnal, A.: On decomposition of graphs. Acta Math. Acad. Sci. Hungar 18, 359\u2013377 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"30_CR22","unstructured":"Farhadi, A., Hajiaghayi, M., Shi, E.: Differentially private densest subgraph. In: Proceedings of the 25th AISTATS, pp. 11581\u201311597 (2022). https:\/\/proceedings.mlr.press\/v151\/farhadi22a.html"},{"key":"30_CR23","doi-asserted-by":"publisher","unstructured":"Fichtenberger, H., Henzinger, M., Ost, L.: Differentially private algorithms for graphs under continual observation. In: Proceedings of the 29th ESA, pp. 42:1\u201342:16 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.42","DOI":"10.4230\/LIPIcs.ESA.2021.42"},{"key":"30_CR24","doi-asserted-by":"publisher","unstructured":"Frick, M.: A survey of (m, k)-colorings. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory?, Annals of Discrete Mathematics, vol.\u00a055, pp. 45\u201357. Elsevier (1993). https:\/\/doi.org\/10.1016\/S0167-5060(08)70374-1","DOI":"10.1016\/S0167-5060(08)70374-1"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Fuchs, M., Kuhn, F.: List defective colorings: distributed algorithms and applications. In: Oshman, R. (ed.) 37th International Symposium on Distributed Computing, DISC 2023, 10\u201312 October 2023, L\u2019Aquila, Italy. LIPIcs, vol.\u00a0281, pp. 22:1\u201322:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2023.22","DOI":"10.4230\/LIPICS.DISC.2023.22"},{"key":"30_CR26","doi-asserted-by":"publisher","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: Proceedings of the 21st SODA, pp. 1106\u20131125 (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.90","DOI":"10.1137\/1.9781611973075.90"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Hay, M., Li, C., Miklau, G., Jensen, D.D.: Accurate estimation of the degree distribution of private networks. In: Proceedings of the 9th ICDM, pp. 169\u2013178 (2009). https:\/\/doi.org\/10.1109\/ICDM.2009.11","DOI":"10.1109\/ICDM.2009.11"},{"issue":"5","key":"30_CR28","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1017\/S0963548319000063","volume":"28","author":"K Hendrey","year":"2019","unstructured":"Hendrey, K., Wood, D.R.: Defective and clustered choosability of sparse graphs. Comb. Probab. Comput. 28(5), 791\u2013810 (2019). https:\/\/doi.org\/10.1017\/S0963548319000063","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"30_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1112\/jlms.12127","volume":"98","author":"J van den Heuvel","year":"2018","unstructured":"van den Heuvel, J., Wood, D.R.: Improper colourings inspired by hadwiger\u2019s conjecture. J. Lond. Math. Soc. 98(1), 129\u2013148 (2018). https:\/\/doi.org\/10.1112\/jlms.12127","journal-title":"J. Lond. Math. Soc."},{"key":"30_CR30","doi-asserted-by":"publisher","unstructured":"Huang, Z., Liu, J.: Optimal differentially private algorithms for k-means clustering. In: Proceedings of the 37th PODS, pp. 395\u2013408 (2018). https:\/\/doi.org\/10.1145\/3196959.3196977","DOI":"10.1145\/3196959.3196977"},{"key":"30_CR31","unstructured":"Imola, J., Murakami, T., Chaudhuri, K.: Locally differentially private analysis of graph statistics. In: Proceedings of the 30th USENIX, pp. 983\u20131000 (2021). www.usenix.org\/conference\/usenixsecurity21\/presentation\/imola"},{"key":"30_CR32","unstructured":"Imola, J., Murakami, T., Chaudhuri, K.: Communication-efficient triangle counting under local differential privacy. In: Proceedings of the 31st USENIX, pp. 537\u2013554 (2022). www.usenix.org\/conference\/usenixsecurity22\/presentation\/imola"},{"key":"30_CR33","doi-asserted-by":"publisher","unstructured":"Imola, J., Murakami, T., Chaudhuri, K.: Differentially private triangle and 4-cycle counting in the shuffle model. In: Proceedings of the 29th CCS, pp. 1505\u20131519 (2022). https:\/\/doi.org\/10.1145\/3548606.3560659","DOI":"10.1145\/3548606.3560659"},{"issue":"1","key":"30_CR34","doi-asserted-by":"publisher","first-page":"112637","DOI":"10.1016\/j.disc.2021.112637","volume":"345","author":"Y Jing","year":"2022","unstructured":"Jing, Y., Kostochka, A., Ma, F., Xu, J.: Defective dp-colorings of sparse simple graphs. Discret. Math. 345(1), 112637 (2022). https:\/\/doi.org\/10.1016\/j.disc.2021.112637","journal-title":"Discret. Math."},{"key":"30_CR35","doi-asserted-by":"publisher","unstructured":"Karwa, V., Raskhodnikova, S., Smith, A.D., Yaroslavtsev, G.: Private analysis of graph structure. ACM Trans. Database Syst. 39(3), 22:1\u201322:33 (2014). https:\/\/doi.org\/10.1145\/2611523","DOI":"10.1145\/2611523"},{"key":"30_CR36","doi-asserted-by":"publisher","unstructured":"Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: auf\u00a0der Heide, F.M., Bender, M.A. (eds.) SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, 11\u201313 August 2009, pp. 138\u2013144. ACM (2009). https:\/\/doi.org\/10.1145\/1583991.1584032","DOI":"10.1145\/1583991.1584032"},{"key":"30_CR37","doi-asserted-by":"publisher","unstructured":"Lin, Z., Gao, L., Hu, X., Zhang, Y., Liu, W.: Differentially private graph clustering algorithm based on structure similarity. In: Proceedings of the 9th ICCNS, pp. 63\u201368 (2019). https:\/\/doi.org\/10.1145\/3371676.3371693","DOI":"10.1145\/3371676.3371693"},{"key":"30_CR38","unstructured":"Nguyen, D., Vullikanti, A.: Differentially private densest subgraph detection. In: Proceedings of the 38th ICML, pp. 8140\u20138151 (2021). https:\/\/proceedings.mlr.press\/v139\/nguyen21i.html"},{"key":"30_CR39","doi-asserted-by":"publisher","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.D.: Smooth sensitivity and sampling in private data analysis. In: Proceedings of the 39th STOC, pp. 75\u201384 (2007). https:\/\/doi.org\/10.1145\/1250790.1250803","DOI":"10.1145\/1250790.1250803"},{"key":"30_CR40","doi-asserted-by":"publisher","unstructured":"Nissim, K., Stemmer, U., Vadhan, S.P.: Locating a small cluster privately. In: Proceedings of the 35th PODS, pp. 413\u2013427 (2016). https:\/\/doi.org\/10.1145\/2902251.2902296","DOI":"10.1145\/2902251.2902296"},{"issue":"2","key":"30_CR41","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00493-018-3733-1","volume":"39","author":"P Ossona De Mendez","year":"2018","unstructured":"Ossona De Mendez, P., Oum, S.-I., Wood, D.R.: Defective colouring of graphs excluding a subgraph or minor. Combinatorica 39(2), 377\u2013410 (2018). https:\/\/doi.org\/10.1007\/s00493-018-3733-1","journal-title":"Combinatorica"},{"key":"30_CR42","doi-asserted-by":"publisher","unstructured":"Raskhodnikova, S., Smith, A.D.: Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism. In: Proceedings of the 57th FOCS, pp. 495\u2013504 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.60","DOI":"10.1109\/FOCS.2016.60"},{"key":"30_CR43","doi-asserted-by":"publisher","unstructured":"Sealfon, A.: Shortest paths and distances with differential privacy. In: Milo, T., Tan, W. (eds.) Proceedings of the 35th PODS, pp. 29\u201341 (2016), https:\/\/doi.org\/10.1145\/2902251.2902291","DOI":"10.1145\/2902251.2902291"},{"issue":"3","key":"30_CR44","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R \u0160krekovski","year":"1999","unstructured":"\u0160krekovski, R.: List improper colourings of planar graphs. Comb. Probab. Comput. 8(3), 293\u2013299 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"30_CR45","doi-asserted-by":"publisher","unstructured":"Stausholm, N.M.: Improved differentially private euclidean distance approximation. In: Proceedings of the 40th PODS, pp. 42\u201356 (2021). https:\/\/doi.org\/10.1145\/3452021.3458328","DOI":"10.1145\/3452021.3458328"},{"key":"30_CR46","unstructured":"Stemmer, U., Kaplan, H.: Differentially private k-means with constant multiplicative error. In: Proceedings of the 31st NeurIPS, pp. 5436\u20135446 (2018). https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/32b991e5d77ad140559ffb95522992d0-Abstract.html"},{"key":"30_CR47","doi-asserted-by":"publisher","unstructured":"Sun, H., et al.: Analyzing subgraph statistics from extended local views with decentralized differential privacy. In: Proceedings of the 26th CCS, pp. 703\u2013717 (2019). https:\/\/doi.org\/10.1145\/3319535.3354253","DOI":"10.1145\/3319535.3354253"},{"key":"30_CR48","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Defective and clustered graph colouring. arXiv preprint: 1803.07694 (2018)","DOI":"10.37236\/7406"},{"key":"30_CR49","doi-asserted-by":"publisher","unstructured":"Zhang, J., Cormode, G., Procopiuc, C.M., Srivastava, D., Xiao, X.: Private release of graph statistics using ladder functions. In: Proceedings of the 2015 ACM SIGMOD, pp. 731\u2013745 (2015). https:\/\/doi.org\/10.1145\/2723372.2737785","DOI":"10.1145\/2723372.2737785"},{"key":"30_CR50","doi-asserted-by":"publisher","first-page":"102285","DOI":"10.1016\/J.COSE.2021.102285","volume":"106","author":"S Zhang","year":"2021","unstructured":"Zhang, S., Ni, W., Fu, N.: Differentially private graph publishing with degree distribution preservation. Comput. Secur. 106, 102285 (2021). https:\/\/doi.org\/10.1016\/J.COSE.2021.102285","journal-title":"Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:26Z","timestamp":1770918806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}