{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T16:08:07Z","timestamp":1779034087160,"version":"3.51.4"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032262035","type":"print"},{"value":"9783032262042","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":137,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We present a tool\n                    <jats:italic>QSeqSim<\/jats:italic>\n                    , a Qiskit-integrated symbolic backend that fills the current gap of having no Qiskit-native support for simulating -loop quantum programs and their induced sequential quantum circuits.\n                    <jats:italic>QSeqSim<\/jats:italic>\n                    takes Qiskit  objects, translates them into OpenQASM\u00a03 code, and organises the resulting program into a combination of combinational, dynamic, and sequential circuits, thereby assigning -loops a precise sequential circuit semantics with explicit internal and external qubits. Building on this semantics,\n                    <jats:italic>QSeqSim<\/jats:italic>\n                    adopts a Binary Decision Diagram (BDD)-based symbolic representation and integrates weighted model counting to compute measurement probabilities efficiently by exploiting sharing in structured and sparse BDDs. On top of this Boolean backbone, it introduces dedicated symbolic operators for quantum state composition and state retention, thereby enabling efficient symbolic execution of sequential quantum circuits. Our experiments demonstrate that\n                    <jats:italic>QSeqSim<\/jats:italic>\n                    scales to substantial -induced sequential circuits; in particular, in the quantum random walk benchmark we successfully simulate circuits with over 1000 qubits for more than 10 loop iterations.\n                  <\/jats:p>\n                  <jats:p>\n                    \u00a0\u00a0\u00a0\n                    <jats:italic>QSeqSim<\/jats:italic>\n                    is available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/Veri-Q\/QSeqSim\" ext-link-type=\"uri\">https:\/\/github.com\/Veri-Q\/QSeqSim<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-26204-2_30","type":"book-chapter","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T15:50:24Z","timestamp":1779033024000},"page":"578-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QSeqSim: A Symbolic Simulator for\u00a0Qiskit While Loops Using Sequential Quantum Circuits (Long Tool Paper)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1768-6662","authenticated-orcid":false,"given":"Zihao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3490-0029","authenticated-orcid":false,"given":"Ji","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4847-702X","authenticated-orcid":false,"given":"Mingsheng","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629417","volume":"62","author":"M Agrawal","year":"2015","unstructured":"Agrawal, M., Akshay, S., Genest, B., Thiagarajan, P.: Approximate verification of the symbolic dynamics of Markov chains. J. ACM (JACM) 62(1), 1\u201334 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ipl.2014.08.013","volume":"115","author":"S Akshay","year":"2015","unstructured":"Akshay, S., Antonopoulos, T., Ouaknine, J., Worrell, J.: Reachability problems for Markov chains. Inf. Process. Lett. 115(2), 155\u2013158 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac47f1","volume":"7","author":"P Andr\u00e9s-Mart\u00ednez","year":"2022","unstructured":"Andr\u00e9s-Mart\u00ednez, P., Heunen, C.: Weakly measured while loops: peeking at quantum states. Quant. Sci. Technol. 7(2), 025007 (2022)","journal-title":"Quant. Sci. Technol."},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45793-3_21","volume-title":"Computer Science Logic","author":"D Beauquier","year":"2002","unstructured":"Beauquier, D., Rabinovich, A., Slissenko, A.: A Logic of Probability with Decidable Model-Checking. In: Bradfield, J. (ed.) CSL 2002. LNCS, vol. 2471, pp. 306\u2013321. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45793-3_21"},{"issue":"8","key":"30_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.080502","volume":"114","author":"A Bocharov","year":"2015","unstructured":"Bocharov, A., Roetteler, M., Svore, K.M.: Efficient synthesis of universal repeat-until-success quantum circuits. Phys. Rev. Lett. 114(8), 080502 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Wille, R.: Advanced equivalence checking for quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(9), 1810\u20131824 (2020)","DOI":"10.1109\/TCAD.2020.3032630"},{"issue":"6\u20137","key":"30_CR7","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.artint.2007.11.002","volume":"172","author":"M Chavira","year":"2008","unstructured":"Chavira, M., Darwiche, A.: On probabilistic inference by weighted model counting. Artif. Intell. 172(6\u20137), 772\u2013799 (2008)","journal-title":"Artif. Intell."},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Chen, T.F., Jiang, J.H.R.: SliQSim: A quantum circuit simulator and solver for probability and statistics queries. In: Gurfinkel, A., Heule, M. (eds.) TACAS 2025. LNCS, vol. 15698, pp. 129\u2013138. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-90660-2_7","DOI":"10.1007\/978-3-031-90660-2_7"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y.F.: AutoQ 2.0: from verification of quantum circuits to verification of quantum programs. In: Gurfinkel, A., Heule, M. (eds.) TACAS 2025. LNCS, vol. 15698, pp. 87\u2013108. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-90660-2_5","DOI":"10.1007\/978-3-031-90660-2_5"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Chen, Y.F., Chung, K.M., Leng\u00e1l, O., Lin, J.A., Tsai, W.L.: AutoQ: an automata-based quantum circuit verifier. In: Enea, C., Lal, A. (eds.) CAV 2023. LNCS, vol. 13966, pp. 139\u2013153. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37709-9_7","DOI":"10.1007\/978-3-031-37709-9_7"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Y.F., Chung, K.M., Leng\u00e1l, O., Lin, J.A., Tsai, W.L., Yen, D.D.: An automata-based framework for verification and bug hunting in quantum circuits. Proc. ACM Program. Lang. 7(PLDI), 1218\u20131243 (2023)","DOI":"10.1145\/3591270"},{"key":"30_CR12","unstructured":"Cirq Developers: Cirq (v1.6.1) (2025). doi: 10.5281\/zenodo.16867504"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505636","volume":"3","author":"A Cross","year":"2022","unstructured":"Cross, A., et al.: OpenQASM 3: a broader and deeper quantum assembly language. ACM Trans. Quant. Comput. 3(3), 1\u201350 (2022)","journal-title":"ACM Trans. Quant. Comput."},{"issue":"26","key":"30_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.260501","volume":"108","author":"J Eisert","year":"2012","unstructured":"Eisert, J., M\u00fcller, M.P., Gogolin, C.: Quantum measurement occurrence is undecidable. Phys. Rev. Lett. 108(26), 260501 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"7","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1016\/j.jcss.2013.04.002","volume":"79","author":"Y Feng","year":"2013","unstructured":"Feng, Y., Yu, N., Ying, M.: Model checking quantum Markov chains. J. Comput. Syst. Sci. 79(7), 1181\u20131198 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR16","unstructured":"Gay, S., Nagarajan, R., Papanikolaou, N.: Probabilistic model-checking of quantum protocols, (2005). arXiv preprint"},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s42354-021-0330-z","volume":"5","author":"C Gonzalez","year":"2021","unstructured":"Gonzalez, C.: Cloud based QC with Amazon Braket. Digitale Welt 5(2), 14\u201317 (2021)","journal-title":"Digitale Welt"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. (1996)","DOI":"10.1145\/237814.237866"},{"key":"30_CR19","doi-asserted-by":"publisher","unstructured":"Guan, J., Feng, Y., Turrini, A., Ying, M.: Measurement-based verification of quantum Markov chains. In: Gurfinkel, A., Ganesh, V. (eds.) CAV 2024. LNCS, vol. 14683, pp. 533\u2013554. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-65633-0_24","DOI":"10.1007\/978-3-031-65633-0_24"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8505","volume":"5","author":"GG Guerreschi","year":"2020","unstructured":"Guerreschi, G.G., Hogaboam, J., Baruffa, F., Sawaya, N.P.: Intel Quantum Simulator: a cloud-ready high-performance simulator of quantum circuits. Quant. Sci. Technol. 5(3), 034007 (2020)","journal-title":"Quant. Sci. Technol."},{"key":"30_CR21","unstructured":"Hoaglin, D.C., Mosteller, F., Tukey, J.W.: Understanding Robust and Exploratory Data Analysis, Wiley (2000)"},{"key":"30_CR22","unstructured":"Javadi-Abhari, A.: Quantum computing with Qiskit, (2024). arXiv preprint"},{"issue":"1","key":"30_CR23","doi-asserted-by":"publisher","first-page":"10736","DOI":"10.1038\/s41598-019-47174-9","volume":"9","author":"T Jones","year":"2019","unstructured":"Jones, T., Brown, A., Bush, I., Benjamin, S.C.: QuEST and high performance simulation of quantum computers. Sci. Rep. 9(1), 10736 (2019)","journal-title":"Sci. Rep."},{"issue":"4","key":"30_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.042315","volume":"67","author":"V Kendon","year":"2003","unstructured":"Kendon, V., Tregenna, B.: Decoherence can be useful in quantum walks. Phys. Rev. A 67(4), 042315 (2003)","journal-title":"Phys. Rev. A"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Kissinger, A., Van De Wetering, J.: PyZX: large scale automated diagrammatic reasoning, (2019). arXiv preprint","DOI":"10.4204\/EPTCS.318.14"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-25543-5_12","volume-title":"Computer Aided Verification","author":"J Liu","year":"2019","unstructured":"Liu, J., Zhan, B., Wang, S., Ying, S., Liu, T., Li, Y., Ying, M., Zhan, N.: Formal Verification of Quantum Algorithms Using Quantum Hoare Logic. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 187\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_12"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Mei, J., Bonsangue, M., Laarman, A.: Simulating quantum circuits by model counting. In: Gurfinkel, A., Ganesh, V. (eds.) CAV 2024. LNCS, vol. 14683, pp. 555\u2013578. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-65633-0_25","DOI":"10.1007\/978-3-031-65633-0_25"},{"key":"30_CR28","doi-asserted-by":"publisher","unstructured":"Mei, J., Coopmans, T., Bonsangue, M., Laarman, A.: Equivalence checking of quantum circuits by model counting. In: Benzm\u00fcller, C., Heule, M.J., Schmidt, R.A. (eds.) IJCAR 2024. LNCS, vol. 14740, pp. 401\u2013421. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63501-4_21","DOI":"10.1007\/978-3-031-63501-4_21"},{"key":"30_CR29","unstructured":"OpenQASM Contributors: OpenQASM Live Specification (2025). https:\/\/openqasm.com\/index.html. Accessed 02 Mar 2026"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Paetznick, A., Svore, K.M.: Repeat-until-success: non-deterministic decomposition of single-qubit unitaries, (2013). arXiv preprint","DOI":"10.26421\/QIC14.15-16-2"},{"key":"30_CR31","unstructured":"Papanikolaou, N.K.: Model checking quantum protocols, University of Warwick (2009). Ph.D. thesis"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Peham, T., Burgholzer, L., Wille, R.: Equivalence checking of quantum circuits with the ZX-calculus. IEEE J. Emerg. Sel. Top. Circuits Syst 12(3), 662\u2013675 (2022)","DOI":"10.1109\/JETCAS.2022.3202204"},{"key":"30_CR33","doi-asserted-by":"publisher","unstructured":"Quist, A.J., Mei, J., Coopmans, T., Laarman, A.: Advancing quantum computing with formal methods. In: Platzer, A., Rozier, K.Y., Pradella, M., Rossi, M. (eds.) FM 2024. LNCS, vol. 14934, pp. 420\u2013446. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71177-0_25","DOI":"10.1007\/978-3-031-71177-0_25"},{"issue":"4","key":"30_CR34","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Struct. Comput. Sci. 14(4), 527\u2013586 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"30_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67(5), 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"30_CR36","doi-asserted-by":"publisher","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","volume":"2","author":"DS Steiger","year":"2018","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: ProjectQ: an open source software framework for quantum computing. Quantum 2, 49 (2018)","journal-title":"Quantum"},{"key":"30_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.22331\/q-2021-10-06-559","volume":"5","author":"Y Suzuki","year":"2021","unstructured":"Suzuki, Y., et al.: Qulacs: a fast and versatile quantum circuit simulator for research purpose. Quantum 5, 559 (2021)","journal-title":"Quantum"},{"key":"30_CR38","unstructured":"The CUDA Quantum development team: CUDA Quantum (0.11.0) (2025). doi: 10.5281\/zenodo.15407754"},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"Tsai, Y.H., Jiang, J.H.R., Jhang, C.S.: Bit-slicing the Hilbert space: scaling up accurate quantum circuit simulation. In: 2021 58th ACM\/IEEE Design Automation Conference (DAC), pp. 439\u2013444. IEEE (2021)","DOI":"10.1109\/DAC18074.2021.9586191"},{"key":"30_CR40","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Quantum relational Hoare logic. Proc. ACM Program. Lang. 3(POPL), 1\u201331 (2019)","DOI":"10.1145\/3290346"},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Wang, Q., Li, R., Ying, M.: Equivalence checking of sequential quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(9), 3143\u20133156 (2021)","DOI":"10.1109\/TCAD.2021.3117506"},{"key":"30_CR42","doi-asserted-by":"publisher","unstructured":"Wang, Z., Cheng, B., Yuan, L., Ji, Z.: FeynmanDD: quantum circuit analysis with classical decision diagrams. In: Piskac, R., Rakamari\u0107, Z. (eds.) CAV 2025. LNCS, vol. 15934, pp. 28\u201352. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-98685-7_2","DOI":"10.1007\/978-3-031-98685-7_2"},{"key":"30_CR43","doi-asserted-by":"crossref","unstructured":"Wei, C.Y., Tsai, Y.H., Jhang, C.S., Jiang, J.H.R.: Accurate BDD-based unitary operator manipulation for scalable and robust quantum circuit verification. In: Proceedings of the 59th ACM\/IEEE Design Automation Conference, pp. 523\u2013528. (2022)","DOI":"10.1145\/3489517.3530481"},{"issue":"6","key":"30_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049706.2049708","volume":"33","author":"M Ying","year":"2012","unstructured":"Ying, M.: Floyd-Hoare logic for quantum programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 33(6), 1\u201349 (2012)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"30_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-90870-6_2","volume-title":"Formal Methods","author":"M Ying","year":"2021","unstructured":"Ying, M.: Model Checking for Verification of Quantum Circuits. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 23\u201339. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_2"},{"key":"30_CR46","doi-asserted-by":"crossref","unstructured":"Ying, M.: Foundations of Quantum Programming, Elsevier (2024)","DOI":"10.1016\/B978-0-44-315942-8.00019-8"},{"issue":"4","key":"30_CR47","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00236-010-0117-4","volume":"47","author":"M Ying","year":"2010","unstructured":"Ying, M., Feng, Y.: Quantum loop programs. Acta Informatica 47(4), 221\u2013250 (2010)","journal-title":"Acta Informatica"},{"key":"30_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yu, N., Ying, M.: An applied quantum Hoare logic. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1149\u20131162. (2019)","DOI":"10.1145\/3314221.3314584"},{"key":"30_CR49","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Advanced simulation of quantum computations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(5), 848\u2013859 (2018)","DOI":"10.1109\/TCAD.2018.2834427"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26204-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T15:50:27Z","timestamp":1779033027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26204-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032262035","9783032262042"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26204-2_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":"18 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 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":"fm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/fm-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}