{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T06:37:06Z","timestamp":1770619026298,"version":"3.49.0"},"reference-count":100,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["DGE-1545362 and IIS-1633363"],"award-info":[{"award-number":["DGE-1545362 and IIS-1633363"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and\/or constraint functions. In this article, we focus on a specific type of SOP called spatial partitioning, which is a combinatorial problem due to the presence of discrete spatial units. Exact optimization methods do not scale with the size of the problem, especially within practicable time limits. This motivated us to develop population-based metaheuristics for solving such SOPs. However, the search operators employed by these population-based methods are mostly designed for real-parameter continuous optimization problems. For adapting these methods to SOPs, we apply domain knowledge in designing spatially aware search operators for efficiently searching through the discrete search space while preserving the spatial constraints. To this end, we put forward a simple yet effective algorithm called<jats:underline>s<\/jats:underline>warm-based s<jats:underline>p<\/jats:underline>atial meme<jats:underline>ti<\/jats:underline>c<jats:underline>al<\/jats:underline>gorithm (SPATIAL) and test it on the school (re)districting problem. Detailed experimental investigations are performed on real-world datasets to evaluate the performance of SPATIAL. Besides, ablation studies are performed to understand the role of the individual components of SPATIAL. Additionally, we discuss how SPATIAL is helpful in the real-life planning process and its applicability to different scenarios and motivate future research directions.<\/jats:p>","DOI":"10.1145\/3544779","type":"journal-article","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T09:03:16Z","timestamp":1655456596000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Memetic Algorithms for Spatial Partitioning Problems"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7065-2966","authenticated-orcid":false,"given":"Subhodip","family":"Biswas","sequence":"first","affiliation":[{"name":"Virginia Tech, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-3178","authenticated-orcid":false,"given":"Fanglan","family":"Chen","sequence":"additional","affiliation":[{"name":"Virginia Tech, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-9647","authenticated-orcid":false,"given":"Zhiqian","family":"Chen","sequence":"additional","affiliation":[{"name":"Mississippi State University, Starkville, Mississippi, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3675-0199","authenticated-orcid":false,"given":"Chang-Tien","family":"Lu","sequence":"additional","affiliation":[{"name":"Virginia Tech, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1821-9743","authenticated-orcid":false,"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[{"name":"Virginia Tech, Virginia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107351"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1971.tb00373.x"},{"key":"e_1_3_2_4_2","volume-title":"Districting Principles and Democratic Representation","author":"Altman Micah","year":"1998","unstructured":"Micah Altman. 1998. Districting Principles and Democratic Representation. Ph.D. Dissertation. California Institute of Technology."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-68891-4_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"Armbruster Michael","year":"2008","unstructured":"Michael Armbruster, Marzena F\u00fcgenschuh, Christoph Helmberg, and Alexander Martin. 2008. A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In Integer Programming and Combinatorial Optimization, Andrea Lodi, Alessandro Panconesi, and Giovanni Rinaldi (Eds.). Springer Berlin, 112\u2013124."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Amariah Becker and Justin Solomon. 2022. Redistricting algorithms. Springer International Publishing Cham 303\u2013340.","DOI":"10.1007\/978-3-319-69161-9_16"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Peter C. Belford and H. Donald Ratliff. 1972. A network-flow model for racially balancing schools. Operations Research 20 3 (1972) 619\u2013628.","DOI":"10.1287\/opre.20.3.619"},{"key":"e_1_3_2_8_2","unstructured":"Dimitris Bertsimas and John N. Tsitsiklis. 1997. Introduction to linear optimization. Vol. 6. Athena Scientific Belmont MA."},{"key":"e_1_3_2_9_2","unstructured":"Subhodip Biswas. 2022. Spatial Optimization Techniques for School Redistricting. Ph.D. Dissertation. Virginia Tech. http:\/\/hdl.handle.net\/10919\/110433."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397536.3422265"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359377"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i09.7058"},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Christian Blum Jakob Puchinger G\u00fcnther R. Raidl and Andrea Roli. 2011. Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11 6 (2011) 4135\u20134151.","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614373"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_16_2","first-page":"244","article-title":"1.17 Spatial optimization for sustainable land use planning","author":"Cao Kai","year":"2017","unstructured":"Kai Cao. 2017. 1.17 Spatial optimization for sustainable land use planning. In Comprehensive Geographic Information Systems (2017), 244.","journal-title":"Comprehensive Geographic Information Systems"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601729"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.016"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1177\/0160017616650612"},{"key":"e_1_3_2_20_2","unstructured":"Daryl R. DeFord Moon Duchin and Justin Solomon. 2019. Recombination: A family of markov chains for redistricting. arXiv:1911.05725. Retrieved from http:\/\/arxiv.org\/abs\/1911.05725."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.04.008"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-642-33090-2_36","volume-title":"Algorithms \u2013 ESA 2012","author":"Delling Daniel","year":"2012","unstructured":"Daniel Delling and Renato F. Werneck. 2012. Better bounds for graph bisection. In Algorithms \u2013 ESA 2012, Leah Epstein and Paolo Ferragina (Eds.). Springer, Berlin, 407\u2013418."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-08-01238-X"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/2765472.2765474"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1177\/0160017607301605"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.1.15"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/3113618.3114091"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/800263.809204"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1984.tb00799.x"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.5555\/303645.303661"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.12.1509"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0597-1"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_1"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.6532"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026110926707"},{"key":"e_1_3_2_40_2","first-page":"188","article-title":"Spatial clustering methods in data mining","author":"Han Jiawei","year":"2001","unstructured":"Jiawei Han, Micheline Kamber, and Anthony K. H. Tung. 2001. Spatial clustering methods in data mining. Geogr. Data Min. Knowl. Discov. (2001), 188\u2013217.","journal-title":"Geogr. Data Min. Knowl. Discov."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07124-4_19"},{"key":"e_1_3_2_42_2","volume-title":"Spatial Optimization for Managed Ecosystems","author":"Hof John G.","year":"1998","unstructured":"John G. Hof and Michael Bevers. 1998. Spatial Optimization for Managed Ecosystems. Columbia University Press, New York, NY."},{"issue":"3","key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1093\/forestscience\/38.3.489","article-title":"Spatial optimization for wildlife and timber in managed forest ecosystems","volume":"38","author":"Hof John G.","year":"1992","unstructured":"John G. Hof and Linda A. Joyce. 1992. Spatial optimization for wildlife and timber in managed forest ecosystems. Forest Sci. 38, 3 (1992), 489\u2013508.","journal-title":"Forest Sci."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02027381"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.5555\/2998828.2998889"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02578982"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32177-2_25"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.177.12637"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001642"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1969.tb00615.x"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32177-2_1"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0038-0121(99)00019-1"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.2.159"},{"key":"e_1_3_2_59_2","first-page":"1","volume-title":"Spatial Optimization","author":"Ligmann-Zielinska Arika","year":"2017","unstructured":"Arika Ligmann-Zielinska. 2017. Spatial Optimization. American Cancer Society, 1\u20136."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0342-x"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.11.2.213"},{"key":"e_1_3_2_62_2","volume-title":"LANDUSE: A Computer Program for Laboratory use in Economic Geography Courses","author":"Marble Duane Francis","year":"1972","unstructured":"Duane Francis Marble and Bruce M. Anderson. 1972. LANDUSE: A Computer Program for Laboratory use in Economic Geography Courses. Technical Paper No. 8. Association of American Geographers."},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9787.1969.tb01448.x"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1137\/0213014"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2009.11.001"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.10.001"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.034"},{"key":"e_1_3_2_68_2","first-page":"1989","article-title":"On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms","volume":"826","author":"Moscato Pablo","year":"1989","unstructured":"Pablo Moscato et\u00a0al. 1989. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826 (1989), 1989.","journal-title":"Caltech Concurrent Computation Program, C3P Report"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_6"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.2307\/1226994"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1068\/a270425"},{"key":"e_1_3_2_72_2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-642-15775-2_24","volume-title":"Algorithms\u2013ESA 2010","author":"Osipov Vitaly","year":"2010","unstructured":"Vitaly Osipov and Peter Sanders. 2010. N-level graph partitioning. In Algorithms\u2013ESA 2010. Springer, Berlin, 278\u2013289."},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"issue":"2","key":"e_1_3_2_74_2","first-page":"301","article-title":"The third criterion: Compactness as a procedural safeguard against partisan gerrymandering","volume":"9","author":"Polsby Daniel D.","year":"1991","unstructured":"Daniel D. Polsby and Robert D. Popper. 1991. The third criterion: Compactness as a procedural safeguard against partisan gerrymandering. Yale Law Pol. Rev. 9, 2 (1991), 301\u2013353.","journal-title":"Yale Law Pol. Rev."},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1970.tb00142.x"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03647-7_11"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0177-5"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34312-5_1"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.10.024"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11067-010-9151-6"},{"key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/978-3-642-23719-5_40","volume-title":"Algorithms\u2013ESA 2011","author":"Sanders Peter","year":"2011","unstructured":"Peter Sanders and Christian Schulz. 2011. Engineering multilevel graph partitioning algorithms. In Algorithms\u2013ESA 2011, Camil Demetrescu and Magn\u00fas M. Halld\u00f3rsson (Eds.). Springer, Berlin, 469\u2013480."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1989.176"},{"key":"e_1_3_2_83_2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-44676-1_33","volume-title":"Algorithms\u2013ESA 2001","author":"Sensen Norbert","year":"2001","unstructured":"Norbert Sensen. 2001. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. In Algorithms\u2013ESA 2001, Friedhelm Meyer auf der Heide (Ed.). Springer, Berlin, 391\u2013403."},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1068\/b34104"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(91)90014-V"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1153-7_1167"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.148"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.5.955"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1080\/00045608.2012.685044"},{"key":"e_1_3_2_90_2","first-page":"131","volume-title":"Papers of the Regional Science Association","author":"Toregas Constantine","year":"1972","unstructured":"Constantine Toregas and Charles ReVelle. 1972. Optimal location under time or distance constraints. In Papers of the Regional Science Association, Vol. 28. Springer, Springer International Publishing, 131\u2013143."},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039525.80601.15"},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78295-7_9"},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330030502"},{"issue":"1","key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1111\/j.1435-5597.1995.tb00626.x","article-title":"Political redistricting: A review","volume":"74","author":"Jr Justin C. Williams","year":"1995","unstructured":"Justin C. Williams Jr. 1995. Political redistricting: A review. Pap. Region. Sci. 74, 1 (1995), 13\u201340.","journal-title":"Pap. Region. Sci."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1080\/00045600802232458"},{"key":"e_1_3_2_96_2","volume-title":"GIS Algorithms","author":"Xiao Ningchuan","year":"2015","unstructured":"Ningchuan Xiao. 2015. GIS Algorithms. SAGE."},{"key":"e_1_3_2_97_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-642-40235-7_4","volume-title":"Advances in Spatial and Temporal Databases","author":"Yang KwangSoo","year":"2013","unstructured":"KwangSoo Yang, Apurv Hirsh Shekhar, Dev Oliver, and Shashi Shekhar. 2013. Capacity-constrained network-voronoi diagram: A summary of results. In Advances in Spatial and Temporal Databases. Springer, Berlin, 56\u201373."},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2445756"},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34312-5_3"},{"key":"e_1_3_2_100_2","doi-asserted-by":"publisher","DOI":"10.1177\/0160017617728551"},{"key":"e_1_3_2_101_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.11.1237"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544779","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3544779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:24Z","timestamp":1750178784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,12]]},"references-count":100,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3544779"],"URL":"https:\/\/doi.org\/10.1145\/3544779","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,12]]},"assertion":[{"value":"2021-04-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-31","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}