{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:12:50Z","timestamp":1743135170223,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78709-6_14","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:37Z","timestamp":1738361437000},"page":"279-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Guiding Word Equation Solving Using Graph Neural Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6832-6611","authenticated-orcid":false,"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8229-3481","authenticated-orcid":false,"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6665-8089","authenticated-orcid":false,"given":"Julie","family":"Cailler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4926-8089","authenticated-orcid":false,"given":"Chencheng","family":"Liang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2733-7098","authenticated-orcid":false,"given":"Philipp","family":"R\u00fcmmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"14_CR1","unstructured":"The satisfiability modulo theories library (SMT-LIB). Accessed 25 April 2024. https:\/\/smtlib.cs.uiowa.edu\/benchmarks.shtml"},{"key":"14_CR2","unstructured":"DragonLi github repository (2024). Accessed 28 June 2024. https:\/\/github.com\/ChenchengLiang\/boosting-string-equation-solving-by-GNNs"},{"key":"14_CR3","unstructured":"Zenodo record of DragonLi (2024). Accessed 21 Aug 2024. https:\/\/zenodo.org\/records\/13354774"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-08867-9_10","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2014","unstructured":"Abdulla, P.A., et al.: String constraints for verification. In: Biere, A., Bloem, R. (eds.) Computer Aided Verification, pp. 150\u2013166. Springer International Publishing, Cham (2014)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Kroening, D., P\u0103s\u0103reanu, C.S. (eds.): Norn: an SMT solver for string constraints. In: Computer Aided Verification, pp. 462\u2013469. Springer International Publishing, Cham (2015)","DOI":"10.1007\/978-3-319-21690-4_29"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., et al.: TRAU: SMT solver for string constraints. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp.\u00a01\u20135 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8602997","DOI":"10.23919\/FMCAD.2018.8602997"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-031-50524-9_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"PA Abdulla","year":"2024","unstructured":"Abdulla, P.A., Liang, C., R\u00fcmmer, P.: Boosting constrained Horn solving by unsat core learning. In: Dimitrova, R., Lahav, O., Wolff, S. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 280\u2013302. Springer Nature Switzerland, Cham (2024)"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Agarap, A.F.: Deep Learning using Rectified Linear Units (ReLU). arXiv:1803.08375 (Mar 2018). https:\/\/doi.org\/10.48550\/arXiv.1803.08375","DOI":"10.48550\/arXiv.1803.08375"},{"key":"14_CR9","unstructured":"Allamanis, M., Brockschmidt, M., Khademi, M.: Learning to represent programs with graphs. CoRR arxvi preprint arxiv: abs\/1711.00740 (2017). http:\/\/arxiv.org\/abs\/1711.00740"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-99524-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Barbosa","year":"2022","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 415\u2013442. Springer International Publishing, Cham (2022)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","volume-title":"Computer Aided Verification","author":"C Barrett","year":"2011","unstructured":"Barrett, C., et al.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_14"},{"key":"14_CR12","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Tech. rep., Department of Computer Science, The University of Iowa (2017). Available at www.SMT-LIB.org"},{"key":"14_CR13","unstructured":"Battaglia, P.W., et al.: Relational inductive biases, deep learning, and graph networks. CoRR abs\/1806.01261 (2018). http:\/\/arxiv.org\/abs\/1806.01261"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Berzish, M., Ganesh, V., Zheng, Y.: Z3str3: a string solver with theory-aware heuristics. In: 2017 Formal Methods in Computer Aided Design (FMCAD), pp. 55\u201359 (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102241","DOI":"10.23919\/FMCAD.2017.8102241"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Chen, A., et al.: Developments in MLflow: a system to accelerate the machine learning lifecycle. In: Proceedings of the Fourth International Workshop on Data Management for End-to-End Machine Learning. DEEM \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3399579.3399867","DOI":"10.1145\/3399579.3399867"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chen, T., Hague, M., Lin, A.W., R\u00fcmmer, P., Wu, Z.: Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang. 3(POPL), 49:1\u201349:30 (2019). https:\/\/doi.org\/10.1145\/3290362","DOI":"10.1145\/3290362"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-031-57246-3_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"YF Chen","year":"2024","unstructured":"Chen, Y.F., Chocholat\u00fd, D., Havlena, V., Hol\u00edk, L., Leng\u00e1l, O., S\u00ed\u010d, J.: Z3-Noodler: an automata-based string solver. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 24\u201333. Springer Nature Switzerland, Cham (2024)"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Chvalovsky, K., Korovin, K., Piepenbrock, J., Urban, J.: Guiding an instantiation prover with graph neural networks. In: Piskac, R., Voronkov, A. (eds.) Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol.\u00a094, pp. 112\u2013123. EasyChair (2023). https:\/\/doi.org\/10.29007\/tp23, https:\/\/easychair.org\/publications\/paper\/5z94","DOI":"10.29007\/tp23"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-30806-3_8","volume-title":"Reachability Problems","author":"JD Day","year":"2019","unstructured":"Day, J.D., Ehlers, T., Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: On solving word equations using SAT. In: Filiot, E., Jungers, R., Potapov, I. (eds.) Reachability Problems, pp. 93\u2013106. Springer International Publishing, Cham (2019)"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Day, J.D., Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: Rule-based word equation solving. In: Proceedings of the 8th International Conference on Formal Methods in Software Engineering, pp. 87\u201397. FormaliSE \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372020.3391556","DOI":"10.1145\/3372020.3391556"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Ellson, J., Gansner, E.R., Koutsofios, E., North, S.C., Woodhull, G.: Graphviz and Dynagraph \u2014 Static and Dynamic Graph Drawing Tools, pp. 127\u2013148. Springer Berlin Heidelberg, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_6","DOI":"10.1007\/978-3-642-18638-7_6"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Fan, W., et al.: Graph neural networks for social recommendation. In: The World Wide Web Conference, pp. 417\u2013426. WWW \u201919, Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3308558.3313488","DOI":"10.1145\/3308558.3313488"},{"key":"14_CR23","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for Quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning - Volume 70, pp. 1263\u20131272. ICML\u201917, JMLR.org (2017)"},{"key":"14_CR24","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. CoRR abs\/1704.01212 (2017), http:\/\/arxiv.org\/abs\/1704.01212"},{"key":"14_CR25","unstructured":"Goodfellow, I.J., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge, MA, USA (2016). http:\/\/www.deeplearningbook.org"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Harrison, J.: HOL light: an overview. In: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, pp. 60\u201366. TPHOLs \u201909, Springer-Verlag, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03359-9_4"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Hojjat, H., R\u00fcmmer, P.: The ELDARICA horn solver. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp. 1\u20137 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603013","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"H\u016fla, J., Moj\u017e\u00ed\u0161ek, D., Janota, M.: Graph neural networks for scheduling of SMT solvers. In: 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), pp. 447\u2013451 (2021). https:\/\/doi.org\/10.1109\/ICTAI52525.2021.00072","DOI":"10.1109\/ICTAI52525.2021.00072"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-51054-1_29","volume-title":"Automated Reasoning","author":"J Jakub\u016fv","year":"2020","unstructured":"Jakub\u016fv, J., Chvalovsk\u00fd, K., Ol\u0161\u00e1k, M., Piotrowski, B., Suda, M., Urban, J.: Enigma anonymous: symbol-independent inference guiding machine (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) Automated Reasoning, pp. 448\u2013463. Springer International Publishing, Cham (2020)"},{"key":"14_CR30","first-page":"1","volume":"107","author":"YI Khmelevskii","year":"1971","unstructured":"Khmelevskii, Y.I.: Equations in a free semigroup. Proc. Steklov Inst. Math. 107, 1\u2013270 (1971)","journal-title":"Proc. Steklov Inst. Math."},{"key":"14_CR31","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings. OpenReview.net (2017). https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"issue":"1","key":"14_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"key":"14_CR33","unstructured":"Kurin, V., Godil, S., Whiteson, S., Catanzaro, B.: Improving SAT solver heuristics with graph networks and reinforcement learning (2020). https:\/\/openreview.net\/forum?id=B1lCn64tvS"},{"issue":"141\u2013146","key":"14_CR34","first-page":"82","volume":"36","author":"FW Levi","year":"1944","unstructured":"Levi, F.W.: On semigroups. Bull. Calcutta Math. Soc. 36(141\u2013146), 82 (1944)","journal-title":"Bull. Calcutta Math. Soc."},{"key":"14_CR35","unstructured":"Liang, C., R\u00fcmmer, P., Brockschmidt, M.: Exploring representation of horn clauses using GNNs. In: Konev, B., Schon, C., Steen, A. (eds.) Proceedings of the Workshop on Practical Aspects of Automated Reasoning Co-located with the 11th International Joint Conference on Automated Reasoning (FLoC\/IJCAR 2022), Haifa, Israel, August, 11 - 12, 2022. CEUR Workshop Proceedings, vol.\u00a03201. CEUR-WS.org (2022). https:\/\/ceur-ws.org\/Vol-3201\/paper7.pdf"},{"key":"14_CR36","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. Sb. (N.S.) 103(145)(2(6)), 147\u2013236 (1977)"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Computers 48, 506\u2013521 (1999). https:\/\/api.semanticscholar.org\/CorpusID:13039801","DOI":"10.1109\/12.769433"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Mou, L., Li, G., Zhang, L., Wang, T., Jin, Z.: Convolutional neural networks over tree structures for programming language processing. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 1287\u20131293. AAAI\u201916, AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10139"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: 2008 Tools and Algorithms for Construction and Analysis of Systems, pp. 337\u2013340. Springer, Berlin, Heidelberg (March 2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Nielsen, J.: Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden. Mathematische Annalen 78, 385\u2013397 (1917). https:\/\/api.semanticscholar.org\/CorpusID:119726936","DOI":"10.1007\/BF01457113"},{"key":"14_CR41","unstructured":"Paliwal, A., Loos, S.M., Rabe, M.N., Bansal, K., Szegedy, C.: Graph representations for higher-order logic and theorem proving. CoRR arxiv preprint arxiv: abs\/1905.10006 (2019)"},{"key":"14_CR42","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems 32, pp. 8024\u20138035. Curran Associates, Inc. (2019). http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Pezoa, F., Reutter, J.L., Suarez, F., Ugarte, M., Vrgo\u010d, D.: Foundations of JSON schema. In: Proceedings of the 25th International Conference on World Wide Web, pp. 263\u2013273. International World Wide Web Conferences Steering Committee (2016)","DOI":"10.1145\/2872427.2883029"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 467\u2014-476. STOC \u201906, Association for Computing Machinery, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1132516.1132584","DOI":"10.1145\/1132516.1132584"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Selsam, D., Bj\u00f8rner, N.: Neurocore: Guiding high-performance SAT solvers with unsat-core predictions. CoRR arxiv preprint arxiv: abs\/1903.04671. (2019)","DOI":"10.1007\/978-3-030-24258-9_24"},{"key":"14_CR46","unstructured":"Selsam, D., Lamm, M., B\u00fcnz, B., Liang, P., de\u00a0Moura, L., Dill, D.L.: Learning a SAT solver from single-bit supervision. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net (2019). https:\/\/openreview.net\/forum?id=HJMC_iA5tm"},{"key":"14_CR47","unstructured":"Si, X., Dai, H., Raghothaman, M., Naik, M., Song, L.: Learning loop invariants for program verification. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a031. Curran Associates, Inc. (2018)"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-53291-8_9","volume-title":"Computer Aided Verification","author":"X Si","year":"2020","unstructured":"Si, X., Naik, A., Dai, H., Naik, M., Song, L.: Code2Inv: a deep learning framework for program verification. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 151\u2013164. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_9"},{"key":"14_CR49","volume-title":"Python 3 Reference Manual","author":"G Van Rossum","year":"2009","unstructured":"Van Rossum, G., Drake, F.L.: Python 3 Reference Manual. CreateSpace, Scotts Valley, CA (2009)"},{"key":"14_CR50","unstructured":"Wang, M., Tang, Y., Wang, J., Deng, J.: Premise selection for theorem proving by deep graph embedding. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 2783\u2014-2793. NIPS\u201917, Curran Associates Inc., Red Hook, NY, USA (2017)"},{"key":"14_CR51","unstructured":"Wang, M., et al.: Deep graph library: a graph-centric, highly-performant package for graph neural networks. arXiv preprint arXiv:1909.01315 (2019)"},{"key":"14_CR52","unstructured":"Wang, W., Hu, Y., Tiwari, M., Khurshid, S., McMillan, K.L., Miikkulainen, R.: Neurocomb: improving SAT solving with graph neural networks. CoRR abs\/2110.14053 (2021). https:\/\/arxiv.org\/abs\/2110.14053"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78709-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:55Z","timestamp":1738361455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}