{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:37Z","timestamp":1781305057902,"version":"3.54.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","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-28691-8_24","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:24Z","timestamp":1781303664000},"page":"362-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Kernels with Reachability for Weighted d-Matroid Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8147-8653","authenticated-orcid":false,"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3918-3479","authenticated-orcid":false,"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9478-7307","authenticated-orcid":false,"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3530-2194","authenticated-orcid":false,"given":"Tatsuya","family":"Terao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0002-9947-1971-0286689-5","volume":"158","author":"M Aigner","year":"1971","unstructured":"Aigner, M., Dowling, T.A.: Matching theory for combinatorial geometries. Trans. Am. Math. Soc. 158(1), 231\u2013245 (1971). https:\/\/doi.org\/10.1090\/S0002-9947-1971-0286689-5","journal-title":"Trans. Am. Math. Soc."},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Banik, A., Fomin, F.V., Golovach, P.A., Inamdar, T., Jana, S., Saurabh, S.: Cuts in graphs with matroid constraints. In: Proceedings of the 32nd Annual European Symposium on Algorithms (ESA 2024), vol.\u00a0308, pp. 17:1\u201317:15 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2024.17","DOI":"10.4230\/LIPIcs.ESA.2024.17"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01585571","volume":"69","author":"AI Barvinok","year":"1995","unstructured":"Barvinok, A.I.: New algorithms for linear $$k$$-matroid intersection and matroid $$k$$-parity problems. Math. Program. 69(1), 449\u2013470 (1995). https:\/\/doi.org\/10.1007\/BF01585571","journal-title":"Math. Program."},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Bentert, M., Fomin, F.V., Golovach, P.A., Morelle, L.: Fault-tolerant matroid bases. In: Proceedings of the 33rd Annual European Symposium on Algorithms (ESA 2025), vol.\u00a0351, pp. 83:1\u201383:14 (2025). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2025.83","DOI":"10.4230\/LIPIcs.ESA.2025.83"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.001, preliminary version in ICALP 2008","DOI":"10.1016\/j.jcss.2009.04.001"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Brand, C., Pratt, K.: Parameterized applications of symbolic differentiation of (totally) multilinear polynomials. In: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), pp. 38:1\u201338:19 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.38","DOI":"10.4230\/LIPIcs.ICALP.2021.38"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Chitnis, R., Cormode, G.: Towards a theory of parameterized streaming algorithms. In: Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). vol.\u00a0148, pp. 7:1\u20137:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.7","DOI":"10.4230\/LIPIcs.IPEC.2019.7"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Chitnis, R., et al.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 1326\u20131344. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch92","DOI":"10.1137\/1.9781611974331.ch92"},{"key":"24_CR9","doi-asserted-by":"publisher","unstructured":"Chitnis, R., Cormode, G., Hajiaghayi, M.T., Monemizadeh, M.: parameterized streaming: maximal matching and vertex cover. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 1234\u20131251. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973730.82","DOI":"10.1137\/1.9781611973730.82"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 23rd annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 68\u201381. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.6","DOI":"10.1137\/1.9781611973099.6"},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., Van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM (JACM) 61(4), 1\u201327 (2014). https:\/\/doi.org\/10.1145\/2629620","journal-title":"J. ACM (JACM)"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Doron-Arad, I., Kulik, A., Shachnai, H.: An EPTAS for budgeted matching and budgeted matroid intersection via representative sets. In: Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), vol.\u00a0261, pp. 49:1\u201349:16 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.49","DOI":"10.4230\/LIPIcs.ICALP.2023.49"},{"issue":"5","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/130927115","volume":"44","author":"A Drucker","year":"2015","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. SIAM J. Comput. 44(5), 1443\u20131479 (2015). https:\/\/doi.org\/10.1137\/130927115","journal-title":"SIAM J. Comput."},{"key":"24_CR15","first-page":"335","volume":"11","author":"J Edmonds","year":"1968","unstructured":"Edmonds, J.: Matroid partition. Math. Decis. Sci. 11, 335 (1968)","journal-title":"Math. Decis. Sci."},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Edmonds, J.: Matroid intersection. In: Annals of Discrete Mathematics, vol.\u00a04, pp. 39\u201349. Elsevier (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70817-3","DOI":"10.1016\/S0167-5060(08)70817-3"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Eiben, E., Koana, T., Wahlstr\u00f6m, M.: Determinantal sieving. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024), pp. 377\u2013423. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.16","DOI":"10.1137\/1.9781611977912.16"},{"key":"24_CR18","doi-asserted-by":"publisher","unstructured":"Fafianie, S., Kratsch, S.: Streaming kernelization. In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), pp. 275\u2013286. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_24","DOI":"10.1007\/978-3-662-44465-8_24"},{"key":"24_CR19","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Korhonen, T., Saurabh, S.: Stability in graphs with matroid constraints. In: Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), vol.\u00a0294, pp. 22:1\u201322:16 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2024.22","DOI":"10.4230\/LIPIcs.SWAT.2024.22"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S., Zehavi, M.: Covering vectors by spaces in perturbed graphic matroids and their duals. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), vol.\u00a0132, pp. 59:1\u201359:13 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.59","DOI":"10.4230\/LIPIcs.ICALP.2019.59"},{"key":"24_CR21","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Representative sets of product families. In: Proceedings of the 22nd European Symposium on Algorithms (ESA 2014), pp. 443\u2013454. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_37","DOI":"10.1007\/978-3-662-44777-2_37"},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886094","volume":"63","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM (JACM) 63(4), 1\u201360 (2016). https:\/\/doi.org\/10.1145\/2886094","journal-title":"J. ACM (JACM)"},{"key":"24_CR23","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781107415157","DOI":"10.1017\/9781107415157"},{"key":"24_CR24","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Saurabh, S.: Kernelization methods for fixed-parameter tractability. In: Tractability: Practical Approaches to Hard Problems. Cambridge University Press, Cambridge (2014). https:\/\/doi.org\/10.1017\/CBO9781139177801.010","DOI":"10.1017\/CBO9781139177801.010"},{"key":"24_CR25","doi-asserted-by":"publisher","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2010.06.007, preliminary version in STOC 2008","DOI":"10.1016\/j.jcss.2010.06.007"},{"key":"24_CR26","doi-asserted-by":"publisher","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. Mathematical Sciences Series, W. H. Freeman (1979). https:\/\/doi.org\/10.5555\/574848","DOI":"10.5555\/574848"},{"issue":"1","key":"24_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31\u201345 (2007). https:\/\/doi.org\/10.1145\/1233481.1233493","journal-title":"ACM SIGACT News"},{"issue":"4","key":"24_CR28","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1007\/s00453-018-0497-3","volume":"81","author":"S Gupta","year":"2018","unstructured":"Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Parameterized algorithms and kernels for rainbow matching. Algorithmica 81(4), 1684\u20131698 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0497-3","journal-title":"Algorithmica"},{"issue":"4","key":"24_CR29","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s00453-019-00618-0","volume":"82","author":"S Gupta","year":"2019","unstructured":"Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Quadratic vertex kernel for rainbow matching. Algorithmica 82(4), 881\u2013897 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00618-0","journal-title":"Algorithmica"},{"key":"24_CR30","doi-asserted-by":"publisher","unstructured":"Gurjar, R., Lokshtanov, D., Misra, P., Panolan, F., Saurabh, S., Zehavi, M.: Quasipolynomial-time deterministic kernelization and (gammoid) representation. In: Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), vol.\u00a0345, pp. 54:1\u201354:17 (2025). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2025.54","DOI":"10.4230\/LIPIcs.MFCS.2025.54"},{"key":"24_CR31","doi-asserted-by":"publisher","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 104\u2013113. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.9","DOI":"10.1137\/1.9781611973099.9"},{"key":"24_CR32","unstructured":"Huang, C.C., Kakimura, N., Kobayashi, Y., Terao, T.: Polynomial kernels with reachability for weighted $$d$$-matroid intersection (2026). https:\/\/arxiv.org\/abs\/2603.17345"},{"issue":"2","key":"24_CR33","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1137\/21M1442267","volume":"37","author":"CC Huang","year":"2023","unstructured":"Huang, C.C., Ward, J.: FPT-algorithms for the $$\\ell $$-matchoid problem with a coverage objective. SIAM J. Discret. Math. 37(2), 1053\u20131078 (2023). https:\/\/doi.org\/10.1137\/21M1442267","journal-title":"SIAM J. Discret. Math."},{"key":"24_CR34","doi-asserted-by":"publisher","unstructured":"Iri, M., Tomizawa, N.: An algorithm for finding an optimal independent assignment. J. Oper. Res. Soc. Japan 19(1), 32\u201357 (1976). https:\/\/doi.org\/10.15807\/jorsj.19.32","DOI":"10.15807\/jorsj.19.32"},{"key":"24_CR35","doi-asserted-by":"publisher","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), pp. 95\u2013103 (2007). https:\/\/doi.org\/10.1145\/1250790.1250806","DOI":"10.1145\/1250790.1250806"},{"key":"24_CR36","unstructured":"Kratsch, S.: Recent developments in kernelization: a survey. Bull. EATCS 2(113) (2014)"},{"key":"24_CR37","doi-asserted-by":"publisher","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. ACM Trans. Algorithms (TALG) 10(4), 1\u201315 (2014). https:\/\/doi.org\/10.1145\/2635810, preliminary version in SODA 2012","DOI":"10.1145\/2635810"},{"key":"24_CR38","doi-asserted-by":"publisher","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: new tools for kernelization. J. ACM (JACM) 67(3), 1\u201350 (2020). https:\/\/doi.org\/10.1145\/3390887, preliminary version in FOCS 2012","DOI":"10.1145\/3390887"},{"issue":"1","key":"24_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"EL Lawler","year":"1975","unstructured":"Lawler, E.L.: Matroid intersection algorithms. Math. Program. 9(1), 31\u201356 (1975). https:\/\/doi.org\/10.1007\/BF01681329","journal-title":"Math. Program."},{"key":"24_CR40","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization\u2013preprocessing with a guarantee. In: The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, pp. 129\u2013161. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30891-8_10","DOI":"10.1007\/978-3-642-30891-8_10"},{"key":"24_CR41","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Misra, P., Panolan, F., Saurabh, S.: Deterministic truncation of linear matroids. ACM Trans. Algorithms (TALG) 14(2), 1\u201320 (2018). https:\/\/doi.org\/10.1145\/3170444, preliminary version in ICALP 2015","DOI":"10.1145\/3170444"},{"key":"24_CR42","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Misra, P., Panolan, F., Saurabh, S., Zehavi, M.: Quasipolynomial representation of transversal matroids with applications in parameterized complexity. In: Proceedings of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), vol.\u00a094, pp. 32:1\u201332:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.32","DOI":"10.4230\/LIPIcs.ITCS.2018.32"},{"key":"24_CR43","doi-asserted-by":"publisher","unstructured":"Marx, D.: A parameterized view on matroid optimization problems. Theor. Comput. Sci. 410(44), 4471\u20134479 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.027, preliminary version in ICALP 2006","DOI":"10.1016\/j.tcs.2009.07.027"},{"key":"24_CR44","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2013.12.013","volume":"524","author":"F Pfender","year":"2014","unstructured":"Pfender, F., et al.: Complexity results for rainbow matchings. Theoret. Comput. Sci. 524, 27\u201333 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.12.013","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR45","doi-asserted-by":"publisher","unstructured":"Wahlstr\u00f6m, M.: Representative set statements for delta-matroids and the Mader delta-matroid. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 780\u2013810. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.31","DOI":"10.1137\/1.9781611977912.31"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:28Z","timestamp":1781303668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_24","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 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 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":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}