{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T10:26:33Z","timestamp":1768213593576,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156990","type":"print"},{"value":"9783032157003","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-15700-3_9","type":"book-chapter","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:59Z","timestamp":1768202519000},"page":"173-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SAT-Based Synthesis of\u00a0Minimal Deterministic Real-Time Automata via\u00a03DRTA Representation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0603-1899","authenticated-orcid":false,"given":"Junjie","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9260-9697","authenticated-orcid":false,"given":"Jie","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7301-9234","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4343-9323","authenticated-orcid":false,"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9179-0893","authenticated-orcid":false,"given":"Miaomiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,13]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-030-45190-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J An","year":"2020","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata. In: TACAS 2020. LNCS, vol. 12078, pp. 444\u2013462. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_25"},{"issue":"9","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-019-2767-4","volume":"64","author":"J An","year":"2021","unstructured":"An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. Sci. China Inf. Sci. 64(9), 1\u201317 (2021). https:\/\/doi.org\/10.1007\/s11432-019-2767-4","journal-title":"Sci. China Inf. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"An, J., Zhan, B., Zhan, N., Zhang, M.: Learning nondeterministic real-time automata. ACM Trans. Embed. Comput. Syst. 20(5s), 99:1\u201399:26 (2021). https:\/\/doi.org\/10.1145\/3477030","DOI":"10.1145\/3477030"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11561163_8","volume-title":"Formal Methods for Components and Objects","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Priced timed automata: algorithms and applications. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 162\u2013182. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561163_8"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2017","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transfer 21(1), 1\u201329 (2017). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11603009_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Bouyer","year":"2005","unstructured":"Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: forward analysis of timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 112\u2013126. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603009_10"},{"issue":"1\u20132","key":"9_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.3233\/FI-2021-1997","volume":"178","author":"F Cassez","year":"2021","unstructured":"Cassez, F., Jensen, P.G., Larsen, K.G.: Verification and parameter synthesis for real-time programs using refinement of trace abstraction. Fund. Inf. 178(1\u20132), 31\u201357 (2021). https:\/\/doi.org\/10.3233\/FI-2021-1997","journal-title":"Fund. Inf."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y-F Chen","year":"2009","unstructured":"Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Learning minimal separating DFA\u2019s for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 31\u201345. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_3"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite state automata. Comput. Linguist. 26(1), 3\u201316 (2000). https:\/\/doi.org\/10.1162\/089120100561601","journal-title":"Comput. Linguist."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"D\u2019Antoni, L., Veanes, M.: Minimization of symbolic automata. In: Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, pp. 541\u2013553. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535849","DOI":"10.1145\/2535838.2535849"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Dell\u2019Erba, D., Li, Y., Schewe, S.: DFAMiner: mining minimal separating DFAs from labelled samples. In: 26th International Symposium on Formal Methods, FM 2024 (2). LNCS, vol. 14934, pp. 48\u201366. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-71177-0_4","DOI":"10.1007\/978-3-031-71177-0_4"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Dima, C.: Real-time automata. J. Automata Lang. Comb. 6(1), 3\u201323 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-003","DOI":"10.25596\/jalc-2001-003"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Fisman, D., Frenkel, H., Zilles, S.: Inferring symbolic automata. Logical Methods Comput. Sci. 19(2), 5:1\u20135:37 (2023). https:\/\/doi.org\/10.46298\/LMCS-19(2:5)2023","DOI":"10.46298\/LMCS-19(2:5)2023"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90562-4","journal-title":"Inf. Control"},{"issue":"40\u201342","key":"9_CR18","doi-asserted-by":"publisher","first-page":"4029","DOI":"10.1016\/J.TCS.2010.07.008","volume":"411","author":"O Grinchtein","year":"2010","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theor. Comput. Sci. 411(40\u201342), 4029\u20134054 (2010). https:\/\/doi.org\/10.1016\/J.TCS.2010.07.008","journal-title":"Theor. Comput. Sci."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11814771_40","volume-title":"Automated Reasoning","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 483\u2013497. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_40"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-24617-6_9","volume-title":"Formal Approaches to Software Testing","author":"A Hessel","year":"2004","unstructured":"Hessel, A., Larsen, K.G., Nielsen, B., Pettersson, P., Skou, A.: Time-optimal real-time test case generation using Uppaal. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 114\u2013130. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24617-6_9"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-15488-1_7","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"MJH Heule","year":"2010","unstructured":"Heule, M.J.H., Verwer, S.: Exact DFA identification using SAT solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 66\u201379. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_7"},{"issue":"9","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/J.PATCOG.2005.01.003","volume":"38","author":"C de la Higuera","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recogn. 38(9), 1332\u20131348 (2005). https:\/\/doi.org\/10.1016\/J.PATCOG.2005.01.003","journal-title":"Pattern Recogn."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-28756-5_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Z Jiang","year":"2012","unstructured":"Jiang, Z., Pajic, M., Moarref, S., Alur, R., Mangharam, R.: Modeling and verification of a dual chamber implantable pacemaker. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 188\u2013203. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_14"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: 4th International Colloquium on Grammatical Inference, ICGI 1998. LNCS, vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFB0054059","DOI":"10.1007\/BFB0054059"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Neider, D., Gavran, I.: Learning linear temporal properties. In: 2018 Formal Methods in Computer Aided Design, FMCAD 2018, pp. 1\u201310. IEEE (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8603016","DOI":"10.23919\/FMCAD.2018.8603016"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: 20th IEEE Symposium on Logic in Computer Science, LICS 2005, pp. 188\u2013197. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/LICS.2005.33","DOI":"10.1109\/LICS.2005.33"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. In: 21st Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 421\u2013432. ACM (1989). https:\/\/doi.org\/10.1145\/73007.73048","DOI":"10.1145\/73007.73048"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Riener, H.: Exact synthesis of LTL properties from traces. In: 2019 Forum for Specification and Design Languages, FDL 2019, pp.\u00a01\u20136. IEEE (2019). https:\/\/doi.org\/10.1109\/FDL.2019.8876900","DOI":"10.1109\/FDL.2019.8876900"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-63406-3_8","volume-title":"Formal Methods and Software Engineering","author":"W Shen","year":"2020","unstructured":"Shen, W., An, J., Zhan, B., Zhang, M., Xue, B., Zhan, N.: PAC learning of deterministic one-clock timed automata. In: Lin, S.-W., Hou, Z., Mahony, B. (eds.) ICFEM 2020. LNCS, vol. 12531, pp. 129\u2013146. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63406-3_8"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Tang, X., Shen, W., Zhang, M., An, J., Zhan, B., Zhan, N.: Learning deterministic one-clock timed automata via mutation testing. In: 20th International Symposium on Automated Technology for Verification and Analysis, ATVA 2022. LNCS, vol. 13505, pp. 233\u2013248. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-19992-9_15","DOI":"10.1007\/978-3-031-19992-9_15"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Lorber, F.: Timed automata learning via SMT solving. In: 14th International Symposium on NASA Formal Methods, NFM 2022). LNCS, vol. 13260, pp. 489\u2013507. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_26","DOI":"10.1007\/978-3-031-06773-0_26"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Teng, Y., Zhang, M., An, J.: Learning deterministic multi-clock timed automata. In: \u00c1brah\u00e1m, E., Jr., M.M. (eds.) 27th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2024, pp. 6:1\u20136:11. ACM (2024). https:\/\/doi.org\/10.1145\/3641513.3650124","DOI":"10.1145\/3641513.3650124"},{"issue":"3","key":"9_CR34","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/J.IC.2010.11.023","volume":"209","author":"S Verwer","year":"2011","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: The efficiency of identifying timed automata and the power of clocks. Inf. Comput. 209(3), 606\u2013625 (2011). https:\/\/doi.org\/10.1016\/J.IC.2010.11.023","journal-title":"Inf. Comput."},{"issue":"3","key":"9_CR35","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/S10994-011-5265-4","volume":"86","author":"S Verwer","year":"2012","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: Efficiently identifying deterministic real-time automata from labeled data. Mach. Learn. 86(3), 295\u2013333 (2012). https:\/\/doi.org\/10.1007\/S10994-011-5265-4","journal-title":"Mach. Learn."},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Waga, M.: Active learning of deterministic timed automata with Myhill-Nerode style characterization. In: Enea, C., Lal, A. (eds.) CAV 2023. Lecture Notes in Computer Science, vol. 13964, pp. 3\u201326. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_1","DOI":"10.1007\/978-3-031-37706-8_1"},{"issue":"11","key":"9_CR37","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1109\/TCAD.2018.2857363","volume":"37","author":"L Wang","year":"2018","unstructured":"Wang, L., Zhan, N., An, J.: The opacity of real-time automata. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(11), 2845\u20132856 (2018). https:\/\/doi.org\/10.1109\/TCAD.2018.2857363","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-74781-1_9","volume-title":"Software Engineering and Formal Methods","author":"I Zakirzyanov","year":"2018","unstructured":"Zakirzyanov, I., Shalyto, A., Ulyantsev, V.: Finding All minimum-size DFA consistent with\u00a0given examples: SAT-based approach. In: Cerone, A., Roveri, M. (eds.) SEFM 2017. LNCS, vol. 10729, pp. 117\u2013131. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74781-1_9"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15700-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:22:00Z","timestamp":1768202520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15700-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156990","9783032157003"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15700-3_9","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 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/VMCAI-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}