{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:16:19Z","timestamp":1723335379210},"reference-count":70,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1016\/j.artint.2023.103974","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T01:11:58Z","timestamp":1689210718000},"page":"103974","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Automatic generation of dominance breaking nogoods for a class of constraint optimization problems"],"prefix":"10.1016","volume":"323","author":[{"given":"Jimmy H.M.","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8807-8600","authenticated-orcid":false,"given":"Allen Z.","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2023.103974_br0010","series-title":"Proceedings of the Fourteenth AAAI National Conference on Artificial Intelligence","first-page":"302","article-title":"Effective redundant constraints for online scheduling","author":"Getoor","year":"1997"},{"year":"2001","series-title":"Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39","author":"Baptiste","key":"10.1016\/j.artint.2023.103974_br0020"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0030","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0378","article-title":"Solving talent scheduling with dynamic programming","volume":"23","author":"de la Banda","year":"2011","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0040","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ejor.2015.10.002","article-title":"An enhanced branch-and-bound algorithm for the talent scheduling problem","volume":"250","author":"Qin","year":"2016","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10.1016\/j.artint.2023.103974_br0050","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.engappai.2008.03.009","article-title":"Planning and scheduling in an e-learning environment. A constraint-programming-based approach","volume":"21","author":"Garrido","year":"2008","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0060","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/LRA.2016.2522096","article-title":"Mixed-integer and constraint programming techniques for mobile robot task planning","volume":"1","author":"Booth","year":"2016","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10.1016\/j.artint.2023.103974_br0070","series-title":"Proceedings of the Fourteenth International Conference on International Conference on Automated Planning and Scheduling","first-page":"142","article-title":"Optimal rectangle packing: new results","author":"Korf","year":"2004"},{"key":"10.1016\/j.artint.2023.103974_br0080","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cor.2017.11.011","article-title":"Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints","volume":"92","author":"Hojabri","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.artint.2023.103974_br0090","series-title":"Proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","first-page":"129","article-title":"A constraint programming approach to electric vehicle routing with time windows","author":"Booth","year":"2019"},{"year":"2006","series-title":"Handbook of Constraint Programming","author":"Rossi","key":"10.1016\/j.artint.2023.103974_br0100"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0110","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1009749006768","article-title":"In pursuit of the holy grail","volume":"2","author":"Freuder","year":"1997","journal-title":"Constraints"},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0120","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s10601-017-9275-0","article-title":"Progress towards the holy grail","volume":"23","author":"Freuder","year":"2018","journal-title":"Constraints"},{"key":"10.1016\/j.artint.2023.103974_br0130","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problems","author":"Land","year":"1960","journal-title":"Econometrica"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0140","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0150","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10479-008-0463-6","article-title":"Optimal rectangle packing","volume":"179","author":"Korf","year":"2010","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.artint.2023.103974_br0160","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","article-title":"A new heuristic and dominance relations for no-wait flowshops with setups","volume":"28","author":"Aldowaisan","year":"2001","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.artint.2023.103974_br0170","series-title":"Proceedings of the Fourth International Workshop on Symmetry and Constraint Satisfaction Problems","first-page":"63","article-title":"Exploiting dominance in three symmetric problems","author":"Prestwich","year":"2004"},{"key":"10.1016\/j.artint.2023.103974_br0180","series-title":"Proceedings of the 7th International Workshop on Symmetry and Constraint Satisfaction Problems","first-page":"56","article-title":"A CP approach to the balanced academic curriculum problem","author":"Monette","year":"2007"},{"key":"10.1016\/j.artint.2023.103974_br0190","series-title":"Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming","first-page":"6","article-title":"A generic method for identifying and exploiting dominance relations","author":"Chu","year":"2012"},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0200","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10601-014-9175-5","article-title":"A method for detecting symmetries in constraint models and its generalisation","volume":"20","author":"Mears","year":"2015","journal-title":"Constraints"},{"key":"10.1016\/j.artint.2023.103974_br0210","series-title":"Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming","first-page":"529","article-title":"MiniZinc: towards a standard CP modelling language","author":"Nethercote","year":"2007"},{"key":"10.1016\/j.artint.2023.103974_br0220","series-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence","first-page":"1192","article-title":"Automatic generation of dominance breaking nogoods for a class of constraint optimization problems","author":"Lee","year":"2020"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0230","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/321796.321808","article-title":"Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems","volume":"21","author":"Kohler","year":"1974","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0240","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","article-title":"The power of dominance relations in branch-and-bound algorithms","volume":"24","author":"Ibaraki","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2023.103974_br0250","series-title":"Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming","first-page":"242","article-title":"Minimizing the maximum number of open stacks by customer search","author":"Chu","year":"2009"},{"issue":"8","key":"10.1016\/j.artint.2023.103974_br0260","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1109\/32.7626","article-title":"Learning dominance relations in combinatorial search problems","volume":"14","author":"Yu","year":"1988","journal-title":"IEEE Trans. Softw. Eng."},{"year":"2009","series-title":"Automatic symmetry detection and dynamic symmetry breaking for constraint programming","author":"Mears","key":"10.1016\/j.artint.2023.103974_br0270"},{"key":"10.1016\/j.artint.2023.103974_br0280","first-page":"329","article-title":"Symmetry in constraint programming","volume":"vol. 2","author":"Gent","year":"2006"},{"key":"10.1016\/j.artint.2023.103974_br0290","series-title":"Proceedings of the 9th National Conference on Artificial Intelligence","first-page":"227","article-title":"Eliminating interchangeable values in constraint satisfaction problems","author":"Freuder","year":"1991"},{"key":"10.1016\/j.artint.2023.103974_br0300","series-title":"Proceedings of the 2002 Joint ERCIM\/CologNet International Conference on Constraint Solving and Constraint Logic Programming","first-page":"15","article-title":"CGRASS: a system for transforming constraint satisfaction problems","author":"Frisch","year":"2002"},{"key":"10.1016\/j.artint.2023.103974_br0310","series-title":"Proceedings of the 2004 Joint ERCIM\/CoLOGNET International Conference on Recent Advances in Constraints","first-page":"98","article-title":"Automatically exploiting symmetries in constraint programming","author":"Ramani","year":"2004"},{"key":"10.1016\/j.artint.2023.103974_br0320","series-title":"Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming","first-page":"475","article-title":"Automatic detection of variable and value symmetries","author":"Puget","year":"2005"},{"key":"10.1016\/j.artint.2023.103974_br0330","series-title":"Proceedings of the 6th International Symposium on Abstraction, Reformulation, and Approximation","first-page":"234","article-title":"Compositional derivation of symmetries for constraint satisfaction","author":"Hentenryck","year":"2005"},{"issue":"4","key":"10.1016\/j.artint.2023.103974_br0340","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10601-008-9057-9","article-title":"On implementing symmetry detection","volume":"14","author":"Mears","year":"2009","journal-title":"Constraints"},{"issue":"3","key":"10.1016\/j.artint.2023.103974_br0350","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","article-title":"Propagation via lazy clause generation","volume":"14","author":"Ohrimenko","year":"2009","journal-title":"Constraints"},{"key":"10.1016\/j.artint.2023.103974_br0360","series-title":"Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming","first-page":"352","article-title":"Lazy clause generation reengineered","author":"Feydy","year":"2009"},{"key":"10.1016\/j.artint.2023.103974_br0370","series-title":"Proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","first-page":"71","article-title":"Automatically exploiting subproblem equivalence in constraint programming","author":"Chu","year":"2010"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0380","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-011-9112-9","article-title":"Exploiting subproblem dominance in constraint programming","volume":"17","author":"Chu","year":"2012","journal-title":"Constraints"},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0390","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10601-014-9173-7","article-title":"Dominance breaking constraints","volume":"20","author":"Chu","year":"2015","journal-title":"Constraints"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0400","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.1090.0329","article-title":"Pruning moves","volume":"22","author":"Fischetti","year":"2010","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"10.1016\/j.artint.2023.103974_br0410","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(88)90025-9","article-title":"A new dominance procedure for combinatorial optimization problems","volume":"7","author":"Fischetti","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.artint.2023.103974_br0420","series-title":"Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming","first-page":"462","article-title":"Breaking row and column symmetries in matrix models","author":"Flener","year":"2002"},{"year":"2010","series-title":"Global Constraint Catalog","author":"Beldiceanu","key":"10.1016\/j.artint.2023.103974_br0430"},{"key":"10.1016\/j.artint.2023.103974_br0440","series-title":"Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"R\u00e9gin","year":"1994"},{"issue":"12","key":"10.1016\/j.artint.2023.103974_br0450","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","article-title":"Introducing global constraints in CHIP","volume":"20","author":"Beldiceanu","year":"1994","journal-title":"Math. Comput. Model."},{"key":"10.1016\/j.artint.2023.103974_br0460","series-title":"Proceedings of the 2005 Joint ERCIM\/CoLogNET International Conference on Constraint Solving and Constraint Logic Programming","first-page":"29","article-title":"Among, common and disjoint constraints","author":"Bessiere","year":"2005"},{"key":"10.1016\/j.artint.2023.103974_br0470","series-title":"Ninth International Workshop on Expert Systems and Their Applications: General Conference, vol. 1","first-page":"55","article-title":"CHARME: Un langage industriel de programmation par contraintes, illustr\u00e9 par une application chez Renault","author":"Oplobedu","year":"1989"},{"key":"10.1016\/j.artint.2023.103974_br0480","series-title":"Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming","first-page":"706","article-title":"A filter for the circuit constraint","author":"Kaya","year":"2006"},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0490","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-013-9148-0","article-title":"Explaining circuit propagation","volume":"19","author":"Francis","year":"2014","journal-title":"Constraints"},{"year":"1989","series-title":"Constraint satisfaction in logic programming","author":"Van Hentenryck","key":"10.1016\/j.artint.2023.103974_br0500"},{"issue":"1\u20132","key":"10.1016\/j.artint.2023.103974_br0510","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(93)90170-G","article-title":"The complexity of constraint satisfaction revisited","volume":"59","author":"Mackworth","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2023.103974_br0520","series-title":"Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming","first-page":"229","article-title":"Propagation redundancy in redundant modelling","author":"Choi","year":"2003"},{"key":"10.1016\/j.artint.2023.103974_br0530","series-title":"Proceedings of the 38th Annual Design Automation Conference","first-page":"530","article-title":"Chaff: engineering an efficient SAT solver","author":"Moskewicz","year":"2001"},{"key":"10.1016\/j.artint.2023.103974_br0540","unstructured":"J. Forrest, T. Ralphs, H.G. Santos, S. Vigerske, J. Forrest, L. Hafer, B. Kristjansson, jpfasano, EdwinStraver, M. Lubin, Jan-Willem, rlougee, jpgoncal1, S. Brito, h-i gassmann, Cristina, M. Saltzman, tosttost, B. Pitrus, F. Matsushima, to st, coin-or\/Cbc: Release releases\/2.10.10, https:\/\/doi.org\/10.5281\/zenodo.7843975, Apr. 2023."},{"issue":"9","key":"10.1016\/j.artint.2023.103974_br0550","first-page":"2864","article-title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","volume":"43","author":"Yamada","year":"2002","journal-title":"Information Processing Society of Japan Journal"},{"key":"10.1016\/j.artint.2023.103974_br0560","series-title":"Proceedings of the 24th International Conference on Principles and Practice of Constraint Programming","first-page":"144","article-title":"Sequential precede chain for value symmetry elimination","author":"Gange","year":"2018"},{"key":"10.1016\/j.artint.2023.103974_br0570","series-title":"Combinatorial Optimization","first-page":"37","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","author":"Balas","year":"1980"},{"issue":"3","key":"10.1016\/j.artint.2023.103974_br0580","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.artint.2023.103974_br0590","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2017.05.025","article-title":"Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs","volume":"263","author":"Umetani","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.artint.2023.103974_br0600","first-page":"73","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"Zilberstein","year":"1996","journal-title":"AI Mag."},{"key":"10.1016\/j.artint.2023.103974_br0610","series-title":"Proceedings of the 1st International Conference on the Practical Applications of Constraint Technologies and Logic Programming","first-page":"239","article-title":"Forming bus driver schedules using constraint programming","author":"Curtis","year":"1999"},{"key":"10.1016\/j.artint.2023.103974_br0620","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","first-page":"3868","article-title":"Towards more practical and efficient automatic dominance breaking","volume":"vol. 35","author":"Lee","year":"2021"},{"key":"10.1016\/j.artint.2023.103974_br0630","series-title":"Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming","first-page":"781","article-title":"Scheduling B2B meetings","author":"Bofill","year":"2014"},{"key":"10.1016\/j.artint.2023.103974_br0640","article-title":"The impact of implied constraints on maxsat B2B instances","volume":"15","author":"Bofill Arasa","year":"2022","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"10.1016\/j.artint.2023.103974_br0650","series-title":"Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming","first-page":"217","article-title":"Dominance driven search","author":"Chu","year":"2013"},{"issue":"3","key":"10.1016\/j.artint.2023.103974_br0660","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2023.103974_br0670","series-title":"Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming","article-title":"Exploiting functional constraints in automatic dominance breaking for constraint optimization","volume":"vol. 235","author":"Lee","year":"2022"},{"key":"10.1016\/j.artint.2023.103974_br0690","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10601-010-9093-0","article-title":"Philosophy of the MiniZinc challenge","volume":"15","author":"Stuckey","year":"2010","journal-title":"Constraints"},{"issue":"2","key":"10.1016\/j.artint.2023.103974_br0700","first-page":"55","article-title":"The Minizinc challenge 2008\u20132013","volume":"35","author":"Stuckey","year":"2014","journal-title":"AI Mag."},{"key":"10.1016\/j.artint.2023.103974_br0680","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2019.103197","article-title":"Clause vivification by unit propagation in CDCL SAT solvers","volume":"279","author":"Li","year":"2020","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370223001200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370223001200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T03:56:08Z","timestamp":1723262168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370223001200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":70,"alternative-id":["S0004370223001200"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2023.103974","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Automatic generation of dominance breaking nogoods for a class of constraint optimization problems","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2023.103974","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"103974"}}