{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:14:37Z","timestamp":1778498077185,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"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-75409-8_19","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:41Z","timestamp":1737497441000},"page":"266-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recognition of\u00a0Unit Segment and\u00a0Polyline Graphs is $$\\exists \\mathbb {R} $$-Complete"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-7106","authenticated-orcid":false,"given":"Michael","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4563-2864","authenticated-orcid":false,"given":"Tillmann","family":"Miltzow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1901-3621","authenticated-orcid":false,"given":"Simon","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7139-4092","authenticated-orcid":false,"given":"Lasse","family":"Wulf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abel, Z., Demaine, E., Demaine, M., Eisenstat, S., Lynch, J., Schardl, T.: Who needs crossings? Hardness of plane graph rigidity. In: 32nd International Symposium on Computational Geometry (SoCG 2016), pp. 3:1\u20133:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.3","DOI":"10.4230\/LIPIcs.SoCG.2016.3"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Abrahamsen, M.: Covering polygons is even harder. In: Vishnoi, N.K. (ed.) 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 375\u2013386 (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00045","DOI":"10.1109\/FOCS52979.2021.00045"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists {\\mathbb{R}}$$-complete. J. ACM 69(1), 4:1\u20134:70 (2022). https:\/\/doi.org\/10.1145\/3486220","DOI":"10.1145\/3486220"},{"key":"19_CR4","unstructured":"Abrahamsen, M., Kleist, L., Miltzow, T.: Training neural networks is $$\\exists {\\mathbb{R}}$$-complete. In: NeurIPS 2021, pp. 18293\u201318306 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/9813b270ed0288e7c0388f0fd4ec68f5-Abstract.html"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for $$\\exists {\\mathbb{R}} $$-completeness of two-dimensional packing problems. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1014\u20131021 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00098","DOI":"10.1109\/FOCS46700.2020.00098"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00224-022-10080-1","volume":"66","author":"MLT Berthelsen","year":"2022","unstructured":"Berthelsen, M.L.T., Hansen, K.A.: On the computational complexity of decision problems about multi-player Nash equilibria. Theory Comput. Syst. 66(3), 519\u2013545 (2022). https:\/\/doi.org\/10.1007\/s00224-022-10080-1","journal-title":"Theory Comput. Syst."},{"key":"19_CR7","unstructured":"Bertschinger, D., Hertrich, C., Jungeblut, P., Miltzow, T., Weber, S.: Training fully connected neural networks is $$\\exists {\\mathbb{R}} $$-complete. CoRR abs\/2204.01368 (2022). To appear at NeurIPS 2024"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Mavronicolas, M.: A catalog of $$\\exists {\\mathbb{R}} $$-complete decision problems about Nash equilibria in multi-player games. In: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.17","DOI":"10.4230\/LIPIcs.STACS.2016.17"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Mavronicolas, M.: $$\\exists {\\mathbb{R}} $$-complete decision problems about symmetric Nash equilibria in symmetric multi-player games. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.13","DOI":"10.4230\/LIPIcs.STACS.2017.13"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, C., Bonnet, \u00c9., Marx, D., Miltzow, T., Rzazewski, P.: Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2), 47\u201380 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i2a4","DOI":"10.20382\/jocg.v9i2a4"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Bonamy, M., et al.: EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs. J. ACM 68(2), 9:1\u20139:38 (2021). https:\/\/doi.org\/10.1145\/3433160","DOI":"10.1145\/3433160"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using $$PQ$$-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 460\u2013467. Association for Computing Machinery, New York (1988). https:\/\/doi.org\/10.1145\/62212.62257","DOI":"10.1145\/62212.62257"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.7155\/jgaa.00470","volume":"22","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22(2), 273\u2013294 (2018). https:\/\/doi.org\/10.7155\/jgaa.00470","journal-title":"J. Graph Algorithms Appl."},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Chistikov, D., Kiefer, S., Marusic, I., Shirmohammadi, M., Worrell, J.: On Restricted nonnegative matrix factorization. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a055, pp. 103:1\u2013103:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.103","DOI":"10.4230\/LIPIcs.ICALP.2016.103"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Dobbins, M.G., Kleist, L., Miltzow, T., Rz\u0105\u017cewski, P.: $$\\forall \\exists {\\mathbb{R}} $$-completeness and area-universality. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 164\u2013175. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_14","DOI":"10.1007\/978-3-030-00256-5_14"},{"key":"19_CR17","unstructured":"Dobbins, M.G., Holmsen, A., Miltzow, T.: A universality theorem for nested polytopes. arXiv:1908.02213 (2019)"},{"key":"19_CR18","unstructured":"Erickson, J.: Optimal curve straightening is $$\\exists {\\mathbb{R}} $$-complete. arXiv:1908.09400 (2019)"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Erickson, J., van der Hoog, I., Miltzow, T.: Smoothing the gap between NP and ER. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1022\u20131033 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00099","DOI":"10.1109\/FOCS46700.2020.00099"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Garg, J., Mehta, R., Vazirani, V.V., Yazdanbod, S.: $$\\exists {\\mathbb{R}} $$-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Trans. Econ. Comput. 6(1) (2018). https:\/\/doi.org\/10.1145\/3175494","DOI":"10.1145\/3175494"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Miltzow, T., Weber, S., Wulf, L.: Recognition of unit segment and polyline graphs is $$\\exists {\\mathbb{R}} $$-complete (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.02172","DOI":"10.48550\/arXiv.2401.02172"},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"R Kang","year":"2012","unstructured":"Kang, R., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete Comput. Geom. 47(3), 548\u2013569 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9394-8","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Combin. Theory Ser. B 52(1), 53\u201366 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90090-7","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Combin. Theory Ser. B 52(1), 67\u201378 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90091-W","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"19_CR25","first-page":"761","volume":"30","author":"J Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Comment. Math. Univ. Carol. 30(4), 761\u2013773 (1989)","journal-title":"Comment. Math. Univ. Carol."},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Combin. Theory Ser. B 62(2), 289\u2013315 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1071","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"19_CR27","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00602","volume":"26","author":"A Lubiw","year":"2022","unstructured":"Lubiw, A., Miltzow, T., Mondal, D.: The complexity of drawing a graph in a polygonal region. J. Graph Algorithms Appl. 26(4), 421\u2013446 (2022). https:\/\/doi.org\/10.7155\/jgaa.00602","journal-title":"J. Graph Algorithms Appl."},{"key":"19_CR28","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists {\\mathbb{R}} $$. ArXiv:1406.2636 (2014)"},{"issue":"1","key":"19_CR29","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Combin. Theory Ser. B 103(1), 114\u2013143 (2013). https:\/\/doi.org\/10.1016\/j.jctb.2012.09.004","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Mn\u00ebv, N.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Topology and Geometry \u2013 Rohlin Seminar, pp. 527\u2013543 (1988)","DOI":"10.1007\/BFb0082792"},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/110825224","volume":"27","author":"T M\u00fcller","year":"2013","unstructured":"M\u00fcller, T., van Leeuwen, E.J., van Leeuwen, J.: Integer representations of convex polygon intersection graphs. SIAM J. Discret. Math. 27(1), 205\u2013231 (2013). https:\/\/doi.org\/10.1137\/110825224","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1090\/S0273-0979-1995-00604-X","volume":"32","author":"J Richter-Gebert","year":"1995","unstructured":"Richter-Gebert, J., Ziegler, G.M.: Realization spaces of 4-polytopes are universal. Bull. Am. Math. Soc. 32(4), 403\u2013412 (1995)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1137\/17M1157374","volume":"33","author":"A Rok","year":"2019","unstructured":"Rok, A., Walczak, B.: Outerstring graphs are $$\\chi $$-bounded. SIAM J. Discret. Math. 33(4), 2181\u20132199 (2019). https:\/\/doi.org\/10.1137\/17M1157374","journal-title":"SIAM J. Discret. Math."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Realizability of Graphs and Linkages. In: Pach, J. (eds) Thirty Essays on Geometric Graph Theory, pp. 461\u2013482. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_24","DOI":"10.1007\/978-1-4614-0110-0_24"},{"issue":"1","key":"19_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00548","volume":"25","author":"M Schaefer","year":"2021","unstructured":"Schaefer, M.: Complexity of geometric k-planarity for fixed k. J. Graph Algorithms Appl. 25(1), 29\u201341 (2021). https:\/\/doi.org\/10.7155\/jgaa.00548","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"19_CR37","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003). https:\/\/doi.org\/10.1016\/S0022-0000(03)00045-X. Special Issue on STOC 2002","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Decidability of string graphs. J. Comput. Syst. Sci. 68(2), 319\u2013334 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.002. Special Issue on STOC 2001","DOI":"10.1016\/j.jcss.2003.07.002"},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017). https:\/\/doi.org\/10.1007\/s00224-015-9662-0","DOI":"10.1007\/s00224-015-9662-0"},{"issue":"5","key":"19_CR40","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1007\/s00224-017-9800-y","volume":"62","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: The Complexity of Tensor Rank. Theory Comput. Syst. 62(5), 1161\u20131174 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9800-y","journal-title":"Theory Comput. Syst."},{"key":"19_CR41","unstructured":"Shitov, Y.: A universality theorem for nonnegative matrix factorizations. ArXiv:1606.09068 (2016)"},{"issue":"3","key":"19_CR42","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1137\/16M1080616","volume":"27","author":"Y Shitov","year":"2017","unstructured":"Shitov, Y.: The complexity of positive semidefinite matrix factorization. SIAM J. Optim. 27(3), 1898\u20131909 (2017). https:\/\/doi.org\/10.1137\/16M1080616","journal-title":"SIAM J. Optim."},{"key":"19_CR43","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a04, pp. 531\u2013554 (1991). https:\/\/doi.org\/10.1090\/dimacs\/004\/41","DOI":"10.1090\/dimacs\/004\/41"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Spinrad, J.: Recognition of circle graphs. J. Algorithms. Cogn. Inform. Log. 16(2), 264\u2013282 (1994).https:\/\/doi.org\/10.1006\/jagm.1994.1012","DOI":"10.1006\/jagm.1994.1012"},{"key":"19_CR45","doi-asserted-by":"publisher","unstructured":"Stade, J.: Complexity of the boundary-guarding art gallery problem. CoRR abs\/2210.12817 (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.12817","DOI":"10.48550\/arXiv.2210.12817"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:45Z","timestamp":1737497445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","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":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}