{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T10:32:24Z","timestamp":1774348344487,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100018967","name":"Universitat Pompeu Fabra","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018967","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper presents an exact algorithm for a generalisation of the classical 0\u20131 Knapsack Problem, called the Knapsack Problem with Group Fairness. In this problem, items are partitioned into classes, and fairness constraints affect the number of items that can or must be chosen from each class. The problem was introduced by Patel et al.\u00a0(in: Dignum (eds) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 2021), where approximation algorithms are discussed. This paper describes the first exact solution approaches for the Knapsack Problem with Group Fairness, based on integer linear programming formulations and a dynamic programming algorithm. The latter allows us to establish the complexity of the problem. Finally, a set of computational experiments on benchmark instances derived from the knapsack literature compare the effectiveness of the alternative solution approaches.<\/jats:p>","DOI":"10.1007\/s11590-025-02252-y","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T11:35:48Z","timestamp":1759750548000},"page":"577-594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms and complexity results for the 0\u20131 knapsack problem with group fairness"],"prefix":"10.1007","volume":"20","author":[{"given":"Enrico","family":"Malaguti","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Paronuzzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0440-0357","authenticated-orcid":false,"given":"Alberto","family":"Santini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"2252_CR1","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s12351-019-00463-7","volume":"21","author":"T Al-douri","year":"2021","unstructured":"Al-douri, T., Hifi, M., Zissimpoulos, V.: An iterative algorithm for the max\u2013min knapsack problem with multiple scenarios. Oper. Res. Int. J. 21, 1355\u20131392 (2021). https:\/\/doi.org\/10.1007\/s12351-019-00463-7","journal-title":"Oper. Res. Int. J."},{"key":"2252_CR2","first-page":"761","volume":"221","author":"L Babat","year":"1975","unstructured":"Babat, L.: Linear functionals on the $$n$$-dimensional unit cube. Rep. Acad. Sci. Soviet Union 221, 761\u2013762 (1975)","journal-title":"Rep. Acad. Sci. Soviet Union"},{"key":"2252_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-50784-7_5","volume-title":"Decidim, A Technopolitical Network for Participatory Democracy: Philosophy, Practice and Autonomy of a Collective Platform in the Age of Digital Intelligence","author":"XE Barandiaran","year":"2024","unstructured":"Barandiaran, X.E., Calleja-L\u00f3pez, A., Monterde, A., Romero, C.: A technopolitical network for participatory democracy: the future of a collective platform. In: Decidim, A Technopolitical Network for Participatory Democracy: Philosophy, Practice and Autonomy of a Collective Platform in the Age of Digital Intelligence, pp. 119\u2013133. Springer Nature Switzerland, Cham (2024)"},{"key":"2252_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s00224-021-10039-8","volume":"65","author":"X Bei","year":"2021","unstructured":"Bei, X., Lu, X., Manurangsi, P., et al.: The price of fairness for indivisible goods. Theory Comput. Syst. 65, 1069\u20131093 (2021). https:\/\/doi.org\/10.1007\/s00224-021-10039-8","journal-title":"Theory Comput. Syst."},{"key":"2252_CR5","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Chakraborty, M., Ho, X.V., et\u00a0al.: Diversity constraints in public housing allocation. In: Dastani M, Sukthankar G, Andr\u00e9 E, et\u00a0al (eds) Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 973\u2013981 (2018)","DOI":"10.65109\/XVTN6533"},{"key":"2252_CR6","doi-asserted-by":"publisher","unstructured":"Benabbou, N., Chakraborty, M., Elkind, E., et\u00a0al.: Fairness towards groups of agents in the allocation of indivisible items. In: Kraus S (ed) Proceedings of the 28th International Joint Conference on Artificial Intelligence. AAAI Press, 95\u2013101 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/14","DOI":"10.24963\/ijcai.2019\/14"},{"key":"2252_CR7","unstructured":"Bera, S., Chakrabarty, D., Flores, N., et\u00a0al.: Fair algorithms for clustering. In: Wallach H, Larochelle H, Beygelzimer A, et\u00a0al (eds) Proceedings of the 32nd Conference on Advances in Neural Information Processing Systems (NeurIPS). Curran Associates, 4954\u20134965 (2019)"},{"issue":"1","key":"2252_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011). https:\/\/doi.org\/10.1287\/opre.1100.0865","journal-title":"Oper. Res."},{"key":"2252_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-008-0452-9","volume":"179","author":"A Bettinelli","year":"2008","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Ann. Oper. Res. 179, 221\u2013241 (2008). https:\/\/doi.org\/10.1007\/s10479-008-0452-9","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"2252_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017). https:\/\/doi.org\/10.1287\/ijoc.2016.0742","journal-title":"INFORMS J. Comput."},{"key":"2252_CR11","doi-asserted-by":"publisher","first-page":"100771","DOI":"10.1016\/j.disopt.2023.100771","volume":"48","author":"J Boeckmann","year":"2023","unstructured":"Boeckmann, J., Thielen, C., Pferschy, U.: Approximating single- and multi-objective nonlinear sum and product knapsack problems. Dis. Optim. 48, 100771 (2023). https:\/\/doi.org\/10.1016\/j.disopt.2023.100771","journal-title":"Dis. Optim."},{"key":"2252_CR12","doi-asserted-by":"publisher","first-page":"105692","DOI":"10.1016\/j.cor.2021.105692","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., et al.: Knapsack problems\u2014An overview of recent advances. Part I: Single knapsack problems. Comput. Oper. Res. 143, 105692 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105692","journal-title":"Comput. Oper. Res."},{"key":"2252_CR13","doi-asserted-by":"publisher","first-page":"105693","DOI":"10.1016\/j.cor.2021.105693","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., et al.: Knapsack problems\u2014An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105693","journal-title":"Comput. Oper. Res."},{"key":"2252_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.1030.0050","volume":"17","author":"P Cappanera","year":"2005","unstructured":"Cappanera, P., Trubian, M.: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem. INFORMS J. Comput. 17, 82\u201398 (2005). https:\/\/doi.org\/10.1287\/ijoc.1030.0050","journal-title":"INFORMS J. Comput."},{"key":"2252_CR15","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2020.12.036","volume":"293","author":"F Clautiaux","year":"2021","unstructured":"Clautiaux, F., Detienne, B., Guillot, G.: An iterative dynamic programming approach for the temporal knapsack problem. Eur. J. Oper. Res. 293, 442\u2013456 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.12.036","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR16","doi-asserted-by":"publisher","unstructured":"Conitzer, V., Freeman, R., Shah, N., et\u00a0al.: Group fairness for the allocation of indivisible goods. In: Peoceedings of the 33th AAAI Conference on Artificial Intelligence. AAAI Press, 1853\u20131860 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33011853","DOI":"10.1609\/aaai.v33i01.33011853"},{"issue":"1\u20132","key":"2252_CR17","first-page":"15","volume":"10","author":"J Csirik","year":"1991","unstructured":"Csirik, J., Frenk, H., Labb\u00e9, M., et al.: Heuristics for the 0\u20131 min-knapsack problem. Acta Cybernet. 10(1\u20132), 15\u201320 (1991)","journal-title":"Acta Cybernet."},{"issue":"4","key":"2252_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1177\/0032329298026004003","volume":"26","author":"SB Sousa","year":"1998","unstructured":"Sousa, S.B.: Participatory budgeting in Porto Alegre: toward a redistributive democracy. Polit. Soc. 26(4), 461\u2013510 (1998). https:\/\/doi.org\/10.1177\/0032329298026004003","journal-title":"Polit. Soc."},{"key":"2252_CR19","unstructured":"Foley, D.K.: Resource allocation and the public sector. PhD Thesis, Yale University (1966)"},{"issue":"2","key":"2252_CR20","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","volume":"262","author":"F Furini","year":"2017","unstructured":"Furini, F., Ljubi\u0107, I., Sinnl, M.: An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262(2), 438\u2013448 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.03.061","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR21","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W. H, Freeman and Company (1979)"},{"issue":"3","key":"2252_CR22","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2021.12.009","volume":"301","author":"J Jooken","year":"2022","unstructured":"Jooken, J., Leyman, P., Causmaecker, P.: A new class of hard problem instances for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 301(3), 841\u2013854 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR23","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: The multiple-choice knapsack problem. In: Kellerer H, Pferschy U, Pisinger D (eds) Knapsack Problems. Springer, 317\u2013347 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_11","DOI":"10.1007\/978-3-540-24777-7_11"},{"key":"2252_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-010-0356-8","volume":"124","author":"A Lodi","year":"2010","unstructured":"Lodi, A., Malaguti, E., Stier-Moses, N.E.: Efficient and fair routing for mesh networks. Math. Program. 124, 285\u2013316 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0356-8","journal-title":"Math. Program."},{"key":"2252_CR25","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ejor.2023.11.030","volume":"319","author":"A Lodi","year":"2023","unstructured":"Lodi, A., Sankaranarayanan, S., Wang, G.: A framework for fair decision-making over time with time-invariant utilities. Eur. J. Oper. Res. 319, 456\u2013467 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.11.030","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2252_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1287\/opre.47.3.361","volume":"47","author":"H Luss","year":"1999","unstructured":"Luss, H.: On equitable resource allocation problems: a lexicographic minimax approach. Oper. Res. 47(3), 361\u2013378 (1999). https:\/\/doi.org\/10.1287\/opre.47.3.361","journal-title":"Oper. Res."},{"key":"2252_CR27","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.ejor.2018.09.020","volume":"273","author":"E Malaguti","year":"2019","unstructured":"Malaguti, E., Monaci, M., Paronuzzi, P., et al.: Integer optimization with penalized fractional values: the knapsack case. Eur. J. Oper. Res. 273, 874\u2013888 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.09.020","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2252_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/14719037.2021.1963821","volume":"25","author":"F Manes-Rossi","year":"2023","unstructured":"Manes-Rossi, F., Brusca, I., Levy Orelli, R., et al.: Features and drivers of citizen participation: insights from participatory budgeting in three European cities. Public Manag. Rev. 25(2), 201\u2013223 (2023). https:\/\/doi.org\/10.1080\/14719037.2021.1963821","journal-title":"Public Manag. Rev."},{"issue":"4","key":"2252_CR29","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1287\/ijoc.2019.0909","volume":"32","author":"R Mansini","year":"2020","unstructured":"Mansini, R., Zanotti, R.: A core-based exact algorithm for the multidimensional multiple choice knapsack problem. INFORMS J. Comput. 32(4), 1061\u20131079 (2020). https:\/\/doi.org\/10.1287\/ijoc.2019.0909","journal-title":"INFORMS J. Comput."},{"key":"2252_CR30","volume-title":"Knapsack Problems","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems. Wiley (1990)"},{"key":"2252_CR31","doi-asserted-by":"publisher","first-page":"105848","DOI":"10.1016\/j.cor.2022.105848","volume":"145","author":"M Monaci","year":"2022","unstructured":"Monaci, M., Pike-Burke, C., Santini, A.: Exact algorithms for the 0\u20131 time-bomb knapsack problem. Comput. Oper. Res. 145, 105848 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105848","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"2252_CR32","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1080\/00420980500279828","volume":"42","author":"A Novy","year":"2005","unstructured":"Novy, A., Leubolt, B.: Participatory budgeting in Porto Alegre: social innovation and the dialectical relationship of state and civil society. Urban Studi. 42(11), 2023\u20132036 (2005). https:\/\/doi.org\/10.1080\/00420980500279828","journal-title":"Urban Studi."},{"key":"2252_CR33","doi-asserted-by":"publisher","unstructured":"Patel, D., Khan, A., Louis, A.: Group fairness for knapsack problems. In: Dignum F, Lomuscio A, Endriss U, et\u00a0al (eds) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 1001\u20131009 (2021). https:\/\/doi.org\/10.5555\/3463952.3464069","DOI":"10.5555\/3463952.3464069"},{"key":"2252_CR34","unstructured":"Pisinger, D.: David Pisinger\u2019s optimization codes. (1995a). https:\/\/web.archive.org\/web\/20250219094749\/http:\/\/hjemmesider.diku.dk\/\u00a0pisinger\/codes.html"},{"key":"2252_CR35","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the multiple-choice knapsack problem. Eur. J. Oper. Res. 83, 394\u2013410 (1995). https:\/\/doi.org\/10.1016\/0377-2217(95)00015-I","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR36","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32, 2271\u20132284 (2005). https:\/\/doi.org\/10.1016\/j.cor.2004.03.002","journal-title":"Comput. Oper. Res."},{"key":"2252_CR37","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2023.07.020","volume":"312","author":"A Santini","year":"2024","unstructured":"Santini, A., Malaguti, E.: The min-knapsack problem with compactness constraints and applications in statistics. Eur. J. Oper. Res. 312, 385\u2013397 (2024). https:\/\/doi.org\/10.1016\/j.ejor.2023.07.020","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR38","doi-asserted-by":"publisher","unstructured":"Santini, A., Paronuzzi, P.: Source code and instances for the 0\u20131 knapsack problem with group fairness. (2025). https:\/\/doi.org\/10.5281\/zenodo.16600726, https:\/\/github.com\/alberto-santini\/kpgf","DOI":"10.5281\/zenodo.16600726"},{"key":"2252_CR39","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.ejor.2020.07.040","volume":"289","author":"L Sch\u00e4fer","year":"2021","unstructured":"Sch\u00e4fer, L., Dietz, T., Barbati, M., et al.: The binary knapsack problem with qualitative levels. Eur. J. Oper. Res. 289, 508\u2013514 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.07.040","journal-title":"Eur. J. Oper. Res."},{"key":"2252_CR40","doi-asserted-by":"publisher","unstructured":"Serramia, M., Lopez-Sanchez, M., Rodr\u00edguez-Aguilar, J., et\u00a0al.: Optimising participatory budget allocation: The decidim use case. In: Sabater-Mir J, Torra V, Aguil\u00f3 I, et\u00a0al (eds) Artificial Intelligence Research and Development, Frontiers in Artificial Intelligence and Applications, vol 319. IOS Press, 193\u2013202 (2019). https:\/\/doi.org\/10.3233\/FAIA190124","DOI":"10.3233\/FAIA190124"},{"key":"2252_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/07393148.2017.1278854","volume":"39","author":"C Su","year":"2017","unstructured":"Su, C.: From Porto Alegre to New York city: participatory budgeting and democracy. New Polit. Sci. 39, 67\u201375 (2017). https:\/\/doi.org\/10.1080\/07393148.2017.1278854","journal-title":"New Polit. Sci."},{"key":"2252_CR42","unstructured":"van de Velde, S., Worm, J.: Multi-period planning of road maintenance: a multiple-choice multiple-knapsack problem. Tech. Rep. 94-6, Laboratory of Production and Operations Management, University of Twente (1994)"},{"key":"2252_CR43","doi-asserted-by":"publisher","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: J\u00fcnger M, Liebling TM, Naddef D, et\u00a0al (eds) 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. Springer Berlin Heidelberg, 431\u2013502 (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_13","DOI":"10.1007\/978-3-540-68279-0_13"},{"key":"2252_CR44","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"H Varian","year":"1974","unstructured":"Varian, H.: Equity, envy, and efficiency. J. Econ. Theory 9, 63\u201391 (1974). https:\/\/doi.org\/10.1016\/0022-0531(74)90075-1","journal-title":"J. Econ. Theory"},{"key":"2252_CR45","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/nav.21520","volume":"60","author":"Z Xu","year":"2013","unstructured":"Xu, Z.: The knapsack problem with a minimum filling constraint. Nav. Res. Logist. 60, 56\u201363 (2013). https:\/\/doi.org\/10.1002\/nav.21520","journal-title":"Nav. Res. Logist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02252-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T07:34:18Z","timestamp":1774337658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02252-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2252"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02252-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"3 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}