{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:32:35Z","timestamp":1778661155707,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T00:00:00Z","timestamp":1668038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T00:00:00Z","timestamp":1668038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171392"],"award-info":[{"award-number":["12171392"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006190"],"award-info":[{"award-number":["62006190"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101478"],"award-info":[{"award-number":["12101478"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2021JM-141"],"award-info":[{"award-number":["2021JM-141"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s13042-022-01691-8","type":"journal-article","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T15:04:31Z","timestamp":1668092671000},"page":"1147-1160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Concept reduction in formal concept analysis based on representative concept matrix"],"prefix":"10.1007","volume":"14","author":[{"given":"Siyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"1691_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R Wille","year":"1982","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel Publishing Company, Dordrecht-Boston, pp 445\u2013470"},{"key":"1691_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis: mathematical foundations","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag, Berlin Heidelberg"},{"key":"1691_CR3","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1016\/j.eswa.2009.09.026","volume":"37","author":"CA Kumar","year":"2010","unstructured":"Kumar CA, Srinivas S (2010) Concept lattice reduction using fuzzy K-Means clustering. Expert Syst Appl 37:2696\u20132704","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1691_CR4","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1007\/s12652-018-0831-2","volume":"10","author":"K Sumangali","year":"2019","unstructured":"Sumangali K, Kumar CA (2019) Concept lattice simplification in formal concept analysis using attribute clustering. J Ambient Intell Humaniz Comput 10(6):2327\u20132343","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"7","key":"1691_CR5","first-page":"619","volume":"33","author":"JH Li","year":"2020","unstructured":"Li JH, Wei L, Zhang Z et al (2020) Concept lattice theory and method and their research prospect. Pattern Recogn Artificial Intelligence (in Chinese) 33(7):619\u2013642","journal-title":"Pattern Recogn Artificial Intelligence (in Chinese)"},{"issue":"2\u20133","key":"1691_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"SO Kuznetsov","year":"2002","unstructured":"Kuznetsov SO, Obiedkov SA (2002) Comparing performance of algorithms for generating concept lattices. J Exp Theoret Artif Intell 14(2\u20133):189\u2013216","journal-title":"J Exp Theoret Artif Intell"},{"key":"1691_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.knosys.2015.10.010","volume":"91","author":"MZ Li","year":"2016","unstructured":"Li MZ, Wang GY (2016) Approximate concept construction with three-way decisions and attribute reduction in incomplete contexts. Knowl-Based Syst 91:165\u2013178","journal-title":"Knowl-Based Syst"},{"key":"1691_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.knosys.2016.10.033","volume":"116","author":"T Qian","year":"2017","unstructured":"Qian T, Wei L, Qi JJ (2017) Constructing three-way concept lattices based on apposition and subposition of formal contexts. Knowl-Based Syst 116:39\u201348","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"1691_CR9","first-page":"713","volume":"48","author":"WX Zhang","year":"2005","unstructured":"Zhang WX, Wei L, Qi JJ (2005) Attribute reduction theory and approach to concept lattice. Sci China Series F 48(6):713\u2013726","journal-title":"Sci China Series F"},{"issue":"7","key":"1691_CR10","first-page":"910","volume":"51","author":"L Wei","year":"2008","unstructured":"Wei L, Qi JJ, Zhang WX (2008) Attribute reduction theory of concept lattice based on decision formal contexts. Sci China Series F 51(7):910\u2013923","journal-title":"Sci China Series F"},{"key":"1691_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.knosys.2016.01.045","volume":"99","author":"RS Ren","year":"2016","unstructured":"Ren RS, Wei L (2016) The attribute reductions of three-way concept lattices. Knowl-Based Syst 99:92\u2013102","journal-title":"Knowl-Based Syst"},{"issue":"10","key":"1691_CR12","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1109\/TKDE.2008.223","volume":"21","author":"WZ Wu","year":"2009","unstructured":"Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461\u20131474","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1691_CR13","doi-asserted-by":"crossref","unstructured":"Wang X, Zhang WX (2009) Knowledge reduction in concept lattices based on irreducible elements. Lecture Notes in Computer Science (Transactions on Computational Science V: Special Issue on Cognitive Knowledge Representation). 5540:128\u2013142","DOI":"10.1007\/978-3-642-02097-1_7"},{"issue":"6","key":"1691_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S021969131350046X","volume":"11","author":"TJ Li","year":"2013","unstructured":"Li TJ, Li MZ, Gao Y (2013) Attribute reduction of concept lattice based on irreducible elements. Int J Wavelets Multiresolut Inf Process 11(6):1\u201324","journal-title":"Int J Wavelets Multiresolut Inf Process"},{"issue":"1","key":"1691_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.knosys.2014.10.008","volume":"73","author":"MW Shao","year":"2015","unstructured":"Shao MW, Yang HZ, Wu WZ (2015) Knowledge reduction in formal fuzzy contexts. Knowl-Based Syst 73(1):265\u2013275","journal-title":"Knowl-Based Syst"},{"key":"1691_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.ins.2016.03.018","volume":"378","author":"MW Shao","year":"2017","unstructured":"Shao MW, Li KW (2017) Attribute reduction in generalized one-sided formal contexts. Inf Sci 378:317\u2013327","journal-title":"Inf Sci"},{"issue":"1","key":"1691_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ijar.2012.07.005","volume":"54","author":"JH Li","year":"2013","unstructured":"Li JH, Mei CL, Lv YJ (2013) Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction. Int J Approximate Reason 54(1):149\u2013165","journal-title":"Int J Approximate Reason"},{"key":"1691_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2019.12.024","volume":"516","author":"L Wei","year":"2020","unstructured":"Wei L, Liu L, Qi JJ, Qian T (2020) Rules acquisition of formal decision contexts based on three-way concept lattices. Inf Sci 516:529\u2013544","journal-title":"Inf Sci"},{"key":"1691_CR19","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ins.2016.01.091","volume":"346\u2013347","author":"YY Yao","year":"2016","unstructured":"Yao YY (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346\u2013347:442\u2013462","journal-title":"Inf Sci"},{"issue":"3","key":"1691_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s41066-018-0112-7","volume":"4","author":"JJ Qi","year":"2019","unstructured":"Qi JJ, Wei L, Wan Q (2019) Multi-level granularity in formal concept analysis. Granular Comput 4(3):351\u2013362","journal-title":"Granular Comput"},{"key":"1691_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ijar.2019.11.002","volume":"116","author":"YY Yao","year":"2020","unstructured":"Yao YY (2020) Three-way granular computing, rough sets, and formal concept analysis. Int J Approximate Reason 116:106\u2013125","journal-title":"Int J Approximate Reason"},{"key":"1691_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ins.2016.04.012","volume":"360","author":"E Bartl","year":"2016","unstructured":"Bartl E, Konecny J (2016) L-concept analysis with positive and negative attributes. Inf Sci 360:96\u2013111","journal-title":"Inf Sci"},{"key":"1691_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ijar.2020.11.005","volume":"130","author":"XR Zhao","year":"2021","unstructured":"Zhao XR, Miao DQ, Fujita H (2021) Variable-precision three-way concepts in L-contexts. Int J Approximate Reason 130:107\u2013125","journal-title":"Int J Approximate Reason"},{"key":"1691_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2022.3167789","author":"HL Zhi","year":"2022","unstructured":"Zhi HL, Li JH, Li YN (2022) Multi-level conflict analysis based on fuzzy formal contexts. IEEE Trans Fuzzy Syst. https:\/\/doi.org\/10.1109\/TFUZZ.2022.3167789","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1691_CR25","doi-asserted-by":"crossref","unstructured":"Qi JJ, Wei L, Yao YY (2014) Three-way formal concept analysis. In: Miao DQ, Pedrycz W, Slezak D, Peters G, Hu QH, Wang RZ, editors. Rough Sets and Knowledge Technology. vol. 8818 of Lecture Notes in Computer Science. Cham: Springer International Publishing; p. 732\u2013741","DOI":"10.1007\/978-3-319-11740-9_67"},{"key":"1691_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.knosys.2015.08.006","volume":"91","author":"JJ Qi","year":"2016","unstructured":"Qi JJ, Qian T, Wei L (2016) The connections between three-way and classical concept lattices. Knowl-Based Syst 91:143\u2013151","journal-title":"Knowl-Based Syst"},{"key":"1691_CR27","unstructured":"Keprt A, Sn\u00e1\u0161el V (2004) Binary factor analysis with help of formal concepts. In: Snasel V, B\u011blohl\u00e1vek R, (eds). Proc. CLA 2004. Ostrava: Czech Republic; p. 90\u2013101"},{"key":"1691_CR28","unstructured":"B\u011blohl\u00e1vek R, Vychodil V (2006) On Boolean factor analysis with formal concepts as factors. In: SCIS and ISIS 2006. Tokyo; p. 1054\u20131059"},{"issue":"1","key":"1691_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R B\u011blohl\u00e1vek","year":"2010","unstructured":"B\u011blohl\u00e1vek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76(1):3\u201320","journal-title":"J Comput Syst Sci"},{"key":"1691_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.knosys.2018.05.035","volume":"158","author":"M Trnecka","year":"2018","unstructured":"Trnecka M, Trneckova M (2018) Data reduction for Boolean matrix factorization algorithms based on formal concept analysis. Knowl-Based Syst 158:75\u201380","journal-title":"Knowl-Based Syst"},{"key":"1691_CR31","first-page":"1259","volume-title":"Abraham A","author":"A Keprt","year":"2005","unstructured":"Keprt A, Sn\u00e1\u0161el V (2005) Binary factor analysis with genetic algorithms. In: Dote Y, Furuhashi T, Koppen M, Ohuchi A, Ohsawa Y (eds) Abraham A. Springer-Verlag, Berlin, Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing. Muroran, pp 1259\u20131268"},{"key":"1691_CR32","doi-asserted-by":"crossref","unstructured":"Frolov AA, Husek D, Polyakov PY (2013) Boolean factor analysis by expectation-maximization method. In: Proceedings of the Third International Conference on Intelligent Human Computer Interaction. vol. 179 of Advances in Intelligent Systems and Computing. Prague: Springer-Verlag Berlin; p. 243\u2013254","DOI":"10.1007\/978-3-642-31603-6_21"},{"key":"1691_CR33","doi-asserted-by":"crossref","unstructured":"Ignatov DI, Nenova E, Konstantinova N, Konstantinov AV (2014) Boolean matrix factorisation for collaborative filtering: an FCA-based approach. In: Agre G, Hitzler P, Krisnadhi A, Kuznetsov S, (eds) Artificial intelligence: methodology, systems, and applications. vol. 8722 of Lecture Notes in Artificial Intelligence. Varna: Springer-Verlag Berlin; p. 47\u201358","DOI":"10.1007\/978-3-319-10554-3_5"},{"key":"1691_CR34","doi-asserted-by":"crossref","unstructured":"Kocayusufoglu F, Hoang MX, Singh AK (2018) Summarizing network processes with network-constrained Boolean matrix factorization. In: 2018 IEEE International Conference on Data Mining (ICDM). IEEE International Conference on Data Mining. Singapore: IEEE; p. 237\u2013246","DOI":"10.1109\/ICDM.2018.00039"},{"issue":"8","key":"1691_CR35","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R B\u011blohl\u00e1vek","year":"2015","unstructured":"B\u011blohl\u00e1vek R, Trnecka M (2015) From-below approximations in Boolean matrix factorization: geometry and new algorithm. J Comput Syst Sci 81(8):1678\u20131697","journal-title":"J Comput Syst Sci"},{"issue":"12","key":"1691_CR36","first-page":"1817","volume":"50","author":"L Wei","year":"2020","unstructured":"Wei L, Cao L, Qi JJ, Zhang WX (2020) Concept reduction and concept characteristics in formal concept analysis. Scientia Sinica Inform (in Chinese) 50(12):1817\u20131833","journal-title":"Scientia Sinica Inform (in Chinese)"},{"issue":"6","key":"1691_CR37","first-page":"516","volume":"31","author":"L Cao","year":"2018","unstructured":"Cao L, Wei L, Qi JJ (2018) Concept reduction preserving binary relations. Pattern Recogn Artif Intell (in Chinese) 31(6):516\u2013524","journal-title":"Pattern Recogn Artif Intell (in Chinese)"},{"issue":"1","key":"1691_CR38","first-page":"125","volume":"48","author":"X Wang","year":"2021","unstructured":"Wang X, Peng ZH, Li JY, Wu WZ (2021) Method of concept reduction based on concept discernibility matrix. Comput Sci (in Chinese) 48(1):125\u2013130","journal-title":"Comput Sci (in Chinese)"},{"issue":"4","key":"1691_CR39","first-page":"480","volume":"56","author":"JY Li","year":"2020","unstructured":"Li JY, Li XX, Wang X, Wu WZ (2020) Reduction of triadic concepts based on triadic factor analysis. J Nanjing Univ (Nat Sci) (in Chinese) 56(4):480\u2013493","journal-title":"J Nanjing Univ (Nat Sci) (in Chinese)"},{"issue":"5","key":"1691_CR40","first-page":"32","volume":"55","author":"XX Xie","year":"2020","unstructured":"Xie XX, Li JJ, Chen DX, Lin RD (2020) Concept reduction of preserving binary relations based on Boolean matrix. J Shandong Univ (Nat Sci) (in Chinese) 55(5):32\u201345","journal-title":"J Shandong Univ (Nat Sci) (in Chinese)"},{"key":"1691_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.knosys.2015.01.004","volume":"80","author":"YY Yao","year":"2015","unstructured":"Yao YY (2015) The two sides of the theory of rough sets. Knowl-Based Syst 80:67\u201377","journal-title":"Knowl-Based Syst"},{"key":"1691_CR42","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough set. Int J Comput Inform Sci 11:341\u2013356","journal-title":"Int J Comput Inform Sci"},{"issue":"5","key":"1691_CR43","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s13042-018-0785-x","volume":"10","author":"JM Zhan","year":"2019","unstructured":"Zhan JM, Wang QM (2019) Certain types of soft coverings based rough sets with applications. Int J Mach Learn Cybern 10(5):1065\u20131076","journal-title":"Int J Mach Learn Cybern"},{"key":"1691_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-022-01629-0","author":"X Yang","year":"2022","unstructured":"Yang X, Huang B (2022) Dominance-based fuzzy rough sets in multi-scale decision tables. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-022-01629-0","journal-title":"Int J Mach Learn Cybern"},{"key":"1691_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-36505-8_4","volume":"7736","author":"YY Yao","year":"2013","unstructured":"Yao YY, Fu R (2013) The concept of reducts in Pawlak three-step rough set analysis. Transact Rough Sets XVI 7736:53\u201372","journal-title":"Transact Rough Sets XVI"},{"key":"1691_CR46","doi-asserted-by":"crossref","unstructured":"Yao YY (2012) An outline of a theory of three-way decisions. In: Yao J, Yang Y, Slowinski R, Greco S, Li H, Mitra S, et\u00a0al., editors. Rough Sets and Current Trends in Computing, Vol. 7413 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; p. 1\u201317","DOI":"10.1007\/978-3-642-32115-3_1"},{"key":"1691_CR47","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ijar.2018.09.005","volume":"103","author":"YY Yao","year":"2018","unstructured":"Yao YY (2018) Three-way decision and granular computing. Int J Approximate Reason 103:107\u2013123","journal-title":"Int J Approximate Reason"},{"issue":"5","key":"1691_CR48","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1007\/s13042-019-01040-2","volume":"11","author":"YY Yao","year":"2020","unstructured":"Yao YY (2020) Tri-level thinking: Models of three-way decision. Int J Mach Learn Cybern 11(5):947\u2013959","journal-title":"Int J Mach Learn Cybern"},{"key":"1691_CR49","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore RE (1966) Interval Analysis. Prentice-Hall, Englewood Cliffs, New Jersey"},{"issue":"1","key":"1691_CR50","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/int.21940","volume":"33","author":"BQ Hu","year":"2018","unstructured":"Hu BQ, Wong H, Yiu KFC (2018) Equivalent structures of interval sets and fuzzy interval sets. Int J Intell Syst 33(1):68\u201392","journal-title":"Int J Intell Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01691-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-022-01691-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01691-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T08:19:37Z","timestamp":1679127577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-022-01691-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,10]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1691"],"URL":"https:\/\/doi.org\/10.1007\/s13042-022-01691-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,10]]},"assertion":[{"value":"4 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}