{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:58:11Z","timestamp":1781305091488,"version":"3.54.1"},"publisher-location":"Cham","reference-count":48,"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_18","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:26Z","timestamp":1781303726000},"page":"265-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polytope Scheduling with\u00a0Groups: Unified Models and\u00a0Optimal Guarantees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6714-5034","authenticated-orcid":false,"given":"Alexander","family":"Lindermayr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4169-1349","authenticated-orcid":false,"given":"Zhenwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3531-7644","authenticated-orcid":false,"given":"Nicole","family":"Megow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"12","key":"18_CR1","doi-asserted-by":"publisher","first-page":"3604","DOI":"10.1007\/S00453-020-00741-3","volume":"82","author":"S Ahmadi","year":"2020","unstructured":"Ahmadi, S., Khuller, S., Purohit, M., Yang, S.: On scheduling coflows. Algorithmica 82(12), 3604\u20133629 (2020). https:\/\/doi.org\/10.1007\/S00453-020-00741-3","journal-title":"Algorithmica"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/060674417","volume":"38","author":"N Bansal","year":"2008","unstructured":"Bansal, N., Coppersmith, D., Sviridenko, M.: Improved approximation algorithms for broadcast scheduling. SIAM J. Comput. 38(3), 1157\u20131174 (2008). https:\/\/doi.org\/10.1137\/060674417","journal-title":"SIAM J. Comput."},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., Khot, S.: Optimal long code test with one free bit. In: FOCS, pp. 453\u2013462. IEEE Comput. Soc. (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.23","DOI":"10.1109\/FOCS.2009.23"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: STOC, pp. 156\u2013167. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897572","DOI":"10.1145\/2897518.2897572"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/JAGM.1998.0938","volume":"28","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Kortsarz, G.: Minimum color sum of bipartite graphs. J. Algorithms 28(2), 339\u2013365 (1998). https:\/\/doi.org\/10.1006\/JAGM.1998.0938","journal-title":"J. Algorithms"},{"key":"18_CR6","unstructured":"Bhimaraju, A., Nayak, D., Vaze, R.: Non-clairvoyant scheduling of coflows. In: WiOpt, pp. 81\u201388. IEEE (2020). https:\/\/dl.ifip.org\/db\/conf\/wiopt\/wiopt2020\/32.pdf"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Buchsbaum, A.L., Karloff, H.J., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. SIAM J. Comput. 33(3), 632\u2013646 (2004). https:\/\/doi.org\/10.1137\/S0097539703423941","DOI":"10.1137\/S0097539703423941"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Q., Im, S., Petety, A.: Online scheduling via gradient descent for weighted flow time minimization. In: SODA, pp. 3802\u20133841. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.128","DOI":"10.1137\/1.9781611978322.128"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1287\/MOOR.1110.0520","volume":"37","author":"JR Correa","year":"2012","unstructured":"Correa, J.R., Skutella, M., Verschae, J.: The power of preemption on unrelated machines and applications to scheduling orders. Math. Oper. Res. 37(2), 379\u2013398 (2012). https:\/\/doi.org\/10.1287\/MOOR.1110.0520","journal-title":"Math. Oper. Res."},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Darbouy, S.P., Friggstad, Z.: Approximating minimum sum coloring with bundles. In: SWAT. LIPIcs, vol.\u00a0294, pp. 21:1\u201321:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.SWAT.2024.21","DOI":"10.4230\/LIPICS.SWAT.2024.21"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Feldman, J., Muthukrishnan, S., Nikolova, E., P\u00e1l, M.: A truthful mechanism for offline ad slot scheduling. In: SAGT. Lecture Notes in Computer Science, vol.\u00a04997, pp. 182\u2013193. Springer (2008).https:\/\/doi.org\/10.1007\/978-3-540-79309-0_17","DOI":"10.1007\/978-3-540-79309-0_17"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Fukunaga, T.: Integrality gap of time-indexed linear programming relaxation for coflow scheduling. In: APPROX\/RANDOM. LIPIcs, vol.\u00a0245, pp. 36:1\u201336:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.APPROX\/RANDOM.2022.36","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2022.36"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. In: ICALP. Lecture Notes in Computer Science, vol.\u00a03142, pp. 658\u2013669. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_56","DOI":"10.1007\/978-3-540-27836-8_56"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for scheduling conflicting jobs with Minsum criteria. ACM Trans. Algorithms 4(1), 11:1\u201311:20 (2008). https:\/\/doi.org\/10.1145\/1328911.1328922","DOI":"10.1145\/1328911.1328922"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Corrigendum: improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4), 34:1\u201334:7 (2013). https:\/\/doi.org\/10.1145\/2500123","DOI":"10.1145\/2500123"},{"key":"18_CR16","unstructured":"Garg, N., Gupta, A., Kumar, A., Singla, S.: Non-clairvoyant precedence constrained scheduling. In: ICALP. LIPIcs, vol.\u00a0132, pp. 63:1\u201363:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"18_CR17","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: NSDI. USENIX Association (2011). https:\/\/www.usenix.org\/conference\/nsdi11\/dominant-resource-fairness-fair-allocation-multiple-resource-types"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. J. SIAM Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"J. SIAM Appl. Math."},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Gupta, A., Kumar, A., Singla, S.: Bag-of-tasks scheduling on related machines. In: APPROX-RANDOM. LIPIcs, vol.\u00a0207, pp. 3:1\u20133:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.APPROX\/RANDOM.2021.3","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2021.3"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/MOOR.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997). https:\/\/doi.org\/10.1287\/MOOR.22.3.513","journal-title":"Math. Oper. Res."},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/JAGM.2001.1210","volume":"42","author":"MM Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms 42(2), 334\u2013366 (2002). https:\/\/doi.org\/10.1006\/JAGM.2001.1210","journal-title":"J. Algorithms"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Sviridenko, M.: Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2), 22:1\u201322:21 (2011). https:\/\/doi.org\/10.1145\/1921659.1921668","DOI":"10.1145\/1921659.1921668"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"EC Horvath","year":"1977","unstructured":"Horvath, E.C., Lam, S., Sethi, R.: A level algorithm for preemptive scheduling. J. ACM 24(1), 32\u201343 (1977). https:\/\/doi.org\/10.1145\/321992.321995","journal-title":"J. ACM"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Im, S., Kulkarni, J., Munagala, K.: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. J. ACM 65(1), 3:1\u20133:33 (2018). https:\/\/doi.org\/10.1145\/3136754","DOI":"10.1145\/3136754"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Im, S., Kulkarni, J., Munagala, K., Pruhs, K.: Selfishmigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors. In: FOCS, pp. 531\u2013540. IEEE Comput. Soc. (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.63","DOI":"10.1109\/FOCS.2014.63"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Im, S., Moseley, B., Pruhs, K., Purohit, M.: Matroid coflow scheduling. In: ICALP. LIPIcs, vol.\u00a0132, pp. 145:1\u2013145:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2019.145","DOI":"10.4230\/LIPICS.ICALP.2019.145"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"J\u00e4ger, S., Lindermayr, A., Megow, N.: The power of proportional fairness for non-clairvoyant scheduling under polyhedral constraints. In: SODA, pp. 3901\u20133930. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.132","DOI":"10.1137\/1.9781611978322.132"},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Jain, K., Vazirani, V.V.: Eisenberg\u2013Gale markets: algorithms and game-theoretic properties 70(1), 84\u2013106. https:\/\/doi.org\/10.1016\/j.geb.2008.11.011","DOI":"10.1016\/j.geb.2008.11.011"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Kaneko, M., Nakamura, K.: The Nash social welfare function 47(2), 423\u201343 https:\/\/doi.org\/10.2307\/1914191","DOI":"10.2307\/1914191"},{"issue":"1","key":"18_CR30","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/J.JALGOR.2004.07.009","volume":"55","author":"YA Kim","year":"2005","unstructured":"Kim, Y.A.: Data migration to minimize the total completion time. J. Algorithms 55(1), 42\u201357 (2005). https:\/\/doi.org\/10.1016\/J.JALGOR.2004.07.009","journal-title":"J. Algorithms"},{"issue":"4","key":"18_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/nav.20138","volume":"53","author":"JYT Leung","year":"2006","unstructured":"Leung, J.Y.T., Li, H., Pinedo, M.: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Res. Logistics (NRL) 53(4), 243\u2013260 (2006)","journal-title":"Naval Res. Logistics (NRL)"},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Liu, Z., Megow, N.: Polytope scheduling with groups: unified models and optimal guarantees. CoRR abs\/2501.17682 (2026). https:\/\/doi.org\/10.48550\/ARXIV.2501.17682","DOI":"10.48550\/ARXIV.2501.17682"},{"issue":"7","key":"18_CR33","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1137\/080731712","volume":"39","author":"J Mestre","year":"2010","unstructured":"Mestre, J.: Adaptive local ratio. SIAM J. Comput. 39(7), 3038\u20133057 (2010). https:\/\/doi.org\/10.1137\/080731712","journal-title":"SIAM J. Comput."},{"issue":"1","key":"18_CR34","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S.J., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair division and collective welfare, MIT Press (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Nash, Jr., J.F.: The bargaining problem 18(2), 155\u2013162. https:\/\/doi.org\/10.2307\/1907266","DOI":"10.2307\/1907266"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Panageas, I., Tr\u00f6bst, T., Vazirani, V.V.: Time-efficient algorithms for Nash-bargaining-based matching market models. In: WINE. Lecture Notes in Computer Science, vol. 15534, pp. 119\u2013136. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-032-08560-3_7","DOI":"10.1007\/978-3-032-08560-3_7"},{"key":"18_CR38","doi-asserted-by":"publisher","unstructured":"Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Program. 58, 263\u2013285 (1993). https:\/\/doi.org\/10.1007\/BF01581271","DOI":"10.1007\/BF01581271"},{"issue":"2","key":"18_CR39","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0196-6774(02)00251-1","volume":"45","author":"M Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2), 202\u2013212 (2002). https:\/\/doi.org\/10.1016\/S0196-6774(02)00251-1","journal-title":"J. Algorithms"},{"issue":"4","key":"18_CR40","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jos.96","volume":"5","author":"M Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. J. Sched. 5(4), 287\u2013305 (2002)","journal-title":"J. Sched."},{"key":"18_CR41","unstructured":"Rohwedder, L., Schnaars, L.: 3.415-approximation for coflow scheduling via iterated rounding. In: ICALP. LIPIcs, vol.\u00a0334, pp. 128:1\u2013128:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"18_CR42","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency, vol. 24, Springer (2003)"},{"key":"18_CR43","doi-asserted-by":"publisher","unstructured":"Schulz, A.S.: Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: IPCO. Lecture Notes in Computer Science, vol.\u00a01084, pp. 301\u2013315. Springer (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_23","DOI":"10.1007\/3-540-61310-2_23"},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Schulz, A.S., Skutella, M.: Random-based scheduling: New approximations and LP lower bounds. RANDOM. Lecture Notes in Computer Science 1269, 119\u2013133. Springer (1997). https:\/\/doi.org\/10.1007\/3-540-63248-411","DOI":"10.1007\/3-540-63248-411"},{"issue":"6","key":"18_CR45","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"DB Shmoys","year":"1995","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM J. Comput. 24(6), 1313\u20131331 (1995). https:\/\/doi.org\/10.1137\/S0097539793248317","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR46","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2), 206\u2013242 (2001). https:\/\/doi.org\/10.1145\/375827.375840","journal-title":"J. ACM"},{"issue":"3","key":"18_CR47","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-6377(99)00076-0","volume":"26","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: A comment on scheduling on uniform machines under chain-type precedence constraints. Oper. Res. Lett. 26(3), 107\u2013109 (2000). https:\/\/doi.org\/10.1016\/S0167-6377(99)00076-0","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"18_CR48","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/S10951-005-5315-5","volume":"8","author":"J Yang","year":"2005","unstructured":"Yang, J., Posner, M.E.: Scheduling parallel machines for the customer order problem. J. Sched. 8(1), 49\u201374 (2005). https:\/\/doi.org\/10.1007\/S10951-005-5315-5","journal-title":"J. Sched."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:30Z","timestamp":1781303730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_18","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"}}]}}