{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T04:15:34Z","timestamp":1785557734384,"version":"3.56.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001824","name":"grantov\u00e1 agentura cesk\u00e9 republiky","doi-asserted-by":"publisher","award":["19-27871X"],"award-info":[{"award-number":["19-27871X"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"ministerstvo \u0161kolstv\u00ed, ml\u00e1de\u017ee a telov\u00fdchovy","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"deutsche forschungsgemeinschaft","doi-asserted-by":"crossref","award":["NI 369\/19"],"award-info":[{"award-number":["NI 369\/19"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"deutsche forschungsgemeinschaft","doi-asserted-by":"crossref","award":["MN 59\/4-1"],"award-info":[{"award-number":["MN 59\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"israel science foundation","doi-asserted-by":"publisher","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>N<\/jats:italic>-fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and successfully applied. We study <jats:italic>high-multiplicity<\/jats:italic><jats:italic>N<\/jats:italic>-fold IPs, which encode IPs succinctly by presenting a description of each block <jats:italic>type<\/jats:italic> and a vector of block multiplicities. Our goal is to design algorithms which solve <jats:italic>N<\/jats:italic>-fold IPs in time polynomial in the size of the succinct encoding, which may be significantly smaller than the size of the explicit (non-succinct) instance. We present the first fixed-parameter algorithm for high-multiplicity <jats:italic>N<\/jats:italic>-fold IPs, which even works for convex objectives. Our key contribution is a novel proximity theorem which relates fractional and integer optima of the Configuration LP, a fundamental notion by Gilmore and Gomory\u00a0[Oper. Res., 1961] which we generalize. Our algorithm for <jats:italic>N<\/jats:italic>-fold IP is faster than previous algorithms whenever the number of blocks is much larger than the number of block types, such as in <jats:italic>N<\/jats:italic>-fold IP models for various scheduling problems.<\/jats:p>","DOI":"10.1007\/s10107-022-01882-9","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T17:03:23Z","timestamp":1663779803000},"page":"199-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["High-multiplicity N-fold IP via configuration LP"],"prefix":"10.1007","volume":"200","author":[{"given":"Du\u0161an","family":"Knop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-0053","authenticated-orcid":false,"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Onn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"issue":"1","key":"1882_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"issue":"1","key":"1882_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3330137","volume":"24","author":"K Altmanov\u00e1","year":"2019","unstructured":"Altmanov\u00e1, K., Knop, D., Kouteck\u00fd, M.: Evaluating and tuning $$n$$-fold integer programming. ACM J. Exp. Algorithmics 24(1), 1\u201322 (2019)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"6","key":"1882_CR3","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Scientific Comput. 25(6), 1860\u20131879 (2004)","journal-title":"SIAM J. Scientific Comput."},{"issue":"1\u20132","key":"1882_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0761-5","volume":"149","author":"M Bergner","year":"2015","unstructured":"Bergner, M., Caprara, A., Ceselli, A., Furini, F., L\u00fcbbecke, M.E., Malaguti, E., Traversi, E.: Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Prog. 149(1\u20132), 391\u2013424 (2015)","journal-title":"Math. Prog."},{"issue":"1","key":"1882_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R Bornd\u00f6rfer","year":"1998","unstructured":"Bornd\u00f6rfer, R., Ferreira, C.E., Martin, A.: Decomposing matrices into blocks. SIAM J. Optim. 9(1), 236\u2013269 (1998)","journal-title":"SIAM J. Optim."},{"key":"1882_CR6","first-page":"2801","volume":"2018","author":"L Chen","year":"2018","unstructured":"Chen, L., Marx, D.: Covering a tree with rooted subtrees\u2014parameterized and approximation algorithms. In Proc. SODA 2018, 2801\u20132820 (2018)","journal-title":"In Proc. SODA"},{"issue":"1","key":"1882_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0213007","volume":"13","author":"SS Cosmadakis","year":"1984","unstructured":"Cosmadakis, S.S., Papadimitriou, C.H.: The traveling salesman problem with many visits to few cities. SIAM J. Comput. 13(1), 99\u2013108 (1984)","journal-title":"SIAM J. Comput."},{"key":"1882_CR8","doi-asserted-by":"crossref","unstructured":"Cslovjecsek, J., Eisenbrand, F., Hunkenschr\u00f6der, C., Rohwedder, L., Weismantel, R.: Block-structured integer and linear programming in strongly polynomial and near linear time. In: Proc. SODA 2021, pp. 1666\u20131681 (2021)","DOI":"10.1137\/1.9781611976465.101"},{"issue":"2","key":"1882_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"JA De Loera","year":"2008","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: $$n$$-fold integer programming. Discrete Optim. 5(2), 231\u2013241 (2008)","journal-title":"Discrete Optim."},{"key":"1882_CR10","doi-asserted-by":"crossref","unstructured":"De\u00a0Loera, J.\u00a0A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and geometric ideas in the theory of discrete optimization, volume\u00a014 of MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Optimization Society, Philadelphia, PA (2013)","DOI":"10.1137\/1.9781611972443"},{"issue":"1","key":"1882_CR11","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/3340322","volume":"16","author":"F Eisenbrand","year":"2020","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Trans. Algorithms 16(1), 5:1-5:14 (2020)","journal-title":"ACM Trans. Algorithms"},{"key":"1882_CR12","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.-M.: Faster algorithms for integer programs with block structure. In Proc. ICALP 2018, volume 107 of Leibniz Int. Proc. Informatics, pp. 49:1\u201349:13 (2018)"},{"key":"1882_CR13","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K., Kouteck\u00fd, M., Levin, A., Onn, S.: An algorithmic theory of integer programming. Technical report (2019). http:\/\/arXiv.org\/abs\/1904.01361"},{"issue":"4","key":"1882_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within $$1+\\varepsilon $$ in linear time. Combinatorica 1(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"issue":"1","key":"1882_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01582130","volume":"80","author":"MC Ferris","year":"1998","unstructured":"Ferris, M.C., Horn, J.D.: Partitioning mathematical programs for parallel solution. Math. Prog. 80(1), 35\u201361 (1998)","journal-title":"Math. Prog."},{"key":"1882_CR16","doi-asserted-by":"crossref","unstructured":"Gamrath, G., L\u00fcbbecke, M.\u00a0E.: Experiments with a generic Dantzig\u2013Wolfe decomposition for integer programs. In: Proc. SEA 2010, Lecture Notes in Computer Science, vol. 6049, pp. 239\u2013252. Springer (2010)","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"1882_CR17","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"1882_CR18","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, vol.\u00a02 of Algorithms and Combinatorics. Springer-Verlag, Berlin, second edition (1993)","DOI":"10.1007\/978-3-642-78240-4"},{"key":"1882_CR19","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Prog. 145(1\u20132, Ser. A), 1\u201318 (2014)","DOI":"10.1007\/s10107-013-0638-z"},{"issue":"4","key":"1882_CR20","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"DS Hochbaum","year":"1991","unstructured":"Hochbaum, D.S., Shamir, R.: Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper. Res. 39(4), 648\u2013653 (1991)","journal-title":"Oper. Res."},{"issue":"4","key":"1882_CR21","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shantikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. ACM 37(4), 843\u2013862 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"1882_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. Assoc. Comput. Mach. 34(1), 144\u2013162 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1882_CR23","unstructured":"Jansen, K., Rohwedder, L.: On integer programming and convolution. In Proc. ITCS 2019, vol. 124 of Leibniz Int. Proc. Informatics, pp. 43:1\u201343:17 (2019)"},{"issue":"4","key":"1882_CR24","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1287\/moor.1110.0515","volume":"36","author":"K Jansen","year":"2011","unstructured":"Jansen, K., Solis-Oba, R.: A polynomial time $$OPT+1$$ algorithm for the cutting stock problem with a constant number of object lengths. Math. Oper. Res. 36(4), 743\u2013753 (2011)","journal-title":"Math. Oper. Res."},{"key":"1882_CR25","unstructured":"Jansen, K., Klein, K., Maack, M., Rau, M.: Empowering the Configuration-IP \u2014 new PTAS results for scheduling with setups times. In Proc. ITCS 2019, volume 124 of Leibniz Int. Proc. Informatics, pp. 44:1\u201344:19 (2019)"},{"issue":"4","key":"1882_CR26","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1137\/19M1303873","volume":"34","author":"K Jansen","year":"2020","unstructured":"Jansen, K., Lassota, A., Rohwedder, L.: Near-linear time algorithm for $$n$$-fold ilps via color coding. SIAM J. Discret. Math. 34(4), 2282\u20132299 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"1882_CR27","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In Proc. FOCS 1982, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"issue":"3","key":"1882_CR28","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/ijoc.2017.0797","volume":"30","author":"T Khaniyev","year":"2018","unstructured":"Khaniyev, T., Elhedhli, S., Erenay, F.S.: Structure detection in mixed-integer programs. INFORMS J. Comput. 30(3), 570\u2013587 (2018)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"1882_CR29","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2018","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling meets $$n$$-fold integer programming. J. Sched. 21(5), 493\u2013503 (2018)","journal-title":"J. Sched."},{"key":"1882_CR30","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling kernels via configuration LP. Technical report, (2020). arXiv:2003.02187"},{"key":"1882_CR31","unstructured":"Knop, D., Kouteck\u00fd, M., Levin, A., Mnich, M., Onn, S.: Multitype integer monoid optimization and applications. Technical report (2019) arXiv:1909.07326"},{"issue":"1","key":"1882_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01402-2","volume":"184","author":"D Knop","year":"2020","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Combinatorial $$n$$-fold integer programming and applications. Math. Program. 184(1), 1\u201334 (2020)","journal-title":"Math. Program."},{"key":"1882_CR33","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. In Proc. ICALP 2018, vol. 107 of Leibniz Int. Proc. Informatics, pp. 85:1\u201385:14 (2018)"},{"key":"1882_CR34","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear discrete optimization\u2014an algorithmic theory. Zurich Lectures in Advanced Mathematics. European Mathematical Society (EMS), Z\u00fcrich (2010)","DOI":"10.4171\/093"},{"key":"1882_CR35","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disopt.2014.07.003","volume":"14","author":"S Onn","year":"2014","unstructured":"Onn, S.: Huge multiway table problems. Discrete Optim. 14, 72\u201377 (2014)","journal-title":"Discrete Optim."},{"issue":"1","key":"1882_CR36","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcss.2016.07.004","volume":"83","author":"S Onn","year":"2017","unstructured":"Onn, S.: Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carath\u00e9odory. J. Comput. Syst. Sci. 83(1), 207\u2013214 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"1882_CR37","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming approach for sequencing groups of identical jobs. Oper. Res. 28(6), 1347\u20131359 (1980)","journal-title":"Oper. Res."},{"issue":"3","key":"1882_CR38","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(95)00022-I","volume":"84","author":"G Scheithauer","year":"1995","unstructured":"Scheithauer, G., Terno, J.: The modified integer round-up property of the one-dimensional cutting stock problem. European J. Oper. Res. 84(3), 562\u2013571 (1995)","journal-title":"European J. Oper. Res."},{"issue":"1\u20133","key":"1882_CR39","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(94)00240-J","volume":"169","author":"S Sevast\u2019janov","year":"1997","unstructured":"Sevast\u2019janov, S., Banaszczyk, W.: To the Steinitz lemma in coordinate form. Discrete Math. 169(1\u20133), 145\u2013152 (1997)","journal-title":"Discrete Math."},{"key":"1882_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/crll.1916.146.1","volume":"146","author":"E Steinitz","year":"1916","unstructured":"Steinitz, E.: Bedingt konvergente Reihen und konvexe Systeme. J. Reine Angew. Math. 146, 1\u201352 (1916)","journal-title":"J. Reine Angew. Math."},{"issue":"6","key":"1882_CR41","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"JM van den Akker","year":"1999","unstructured":"van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Oper. Res. 47(6), 862\u2013872 (1999)","journal-title":"Oper. Res."},{"key":"1882_CR42","doi-asserted-by":"crossref","unstructured":"Vanderbeck, F., Wolsey, L.\u00a0A.: Reformulation and decomposition of integer programs. In: 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, pp. 431\u2013502. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_13"},{"issue":"1","key":"1882_CR43","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1112\/blms\/17.1.21","volume":"17","author":"MD Vose","year":"1985","unstructured":"Vose, M.D.: Egyptian fractions. Bull. London Math. Soc. 17(1), 21\u201324 (1985)","journal-title":"Bull. London Math. Soc."},{"key":"1882_CR44","doi-asserted-by":"crossref","unstructured":"Wang, J., Ralphs, T.: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 394\u2013402. Springer (2013)","DOI":"10.1007\/978-3-642-38171-3_31"},{"issue":"1","key":"1882_CR45","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.18.1.98","volume":"18","author":"RL Weil","year":"1971","unstructured":"Weil, R.L., Kettler, P.C.: Rearranging matrices to block-angular form for decomposition (and other) algorithms. Mgmt. Sci. 18(1), 98\u2013108 (1971)","journal-title":"Mgmt. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01882-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01882-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01882-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T23:08:35Z","timestamp":1684451315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01882-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1882"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01882-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"assertion":[{"value":"6 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}