{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T09:48:41Z","timestamp":1771494521611,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T00:00:00Z","timestamp":1286236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10732-010-9146-y","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T18:57:26Z","timestamp":1286218646000},"page":"589-614","source":"Crossref","is-referenced-by-count":6,"title":["Generating highly balanced sudoku problems as hard problems"],"prefix":"10.1007","volume":"17","author":[{"given":"Carlos","family":"Ans\u00f3tegui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e8sar","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Mateu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,5]]},"reference":[{"key":"9146_CR1","first-page":"193","volume-title":"Proc. of National Conference on Artificial Intelligence (AAAI\u201900)","author":"D. Achlioptas","year":"2000","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proc. of National Conference on Artificial Intelligence (AAAI\u201900), pp. 193\u2013200 (2000)"},{"key":"9146_CR2","volume-title":"Proc. of National Conference on Artificial Intelligence (AAAI-04)","author":"C. Ans\u00f3tegui","year":"2004","unstructured":"Ans\u00f3tegui, C., del Val, A., Dot\u00fa, I., Fern\u00e1ndez, C., Many\u00e0, F.: Modelling choices in quasigroup completion: SAT vs. CSP. In: Proc. of National Conference on Artificial Intelligence (AAAI-04) (2004)"},{"key":"9146_CR3","volume-title":"Twenty-First National Conference on Artificial Intelligence (AAAI\u201906)","author":"C. Ans\u00f3tegui","year":"2006","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e1ndez, C., Gomes, C.P., Mateu, C.: The impact of balancing on problem hardness in a highly structured domain. In: Twenty-First National Conference on Artificial Intelligence (AAAI\u201906) (2006)"},{"key":"9146_CR4","first-page":"161","volume-title":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI\u201907)","author":"C. Ans\u00f3tegui","year":"2007","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e1ndez, C., Mateu, C.: On balanced CSPs with high treewidth. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI\u201907), pp. 161\u2013166 (2007a)"},{"issue":"1\u20134","key":"9146_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10472-007-9062-5","volume":"49","author":"C. Ans\u00f3tegui","year":"2007","unstructured":"Ans\u00f3tegui, C., Larrubia, J., Li, C.M., Many\u00e0, F.: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1\u20134), 191\u2013205 (2007b)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9146_CR6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-540-85958-1_20","volume-title":"Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP\u201908)","author":"C. Ans\u00f3tegui","year":"2008","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e1ndez, C., Mateu, C.: From high girth graphs to hard instances. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP\u201908), pp. 298\u2013312. Springer, Berlin (2008). doi: 10.1007\/978-3-540-85958-1-20"},{"key":"9146_CR7","volume-title":"Proceedings of 15th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA\u201908)","author":"J. Argelich","year":"2008","unstructured":"Argelich, J., Lynce, I.: CNF instances from the software package installation problem. In: Proceedings of 15th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA\u201908) (2008)"},{"key":"9146_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1111\/j.1439-037X.1990.tb00842.x","volume":"165","author":"R.A. Bailey","year":"1990","unstructured":"Bailey, R.A., Kunert, J., Martin, R.J.: Some comments on gerechte designs. J. Agron. Crop Sci. 165, 121\u2013130 (1990)","journal-title":"J. Agron. Crop Sci."},{"key":"9146_CR9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/00029890.2008.11920542","volume":"115","author":"R.A. Bailey","year":"2008","unstructured":"Bailey, R.A., Cameron, P.J., Connelly, R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and hamming codes. Am. Math. Mon. 115, 383\u2013404 (2008)","journal-title":"Am. Math. Mon."},{"key":"9146_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP\u201996)","author":"C. Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP\u201996), pp. 61\u201375 (1996)"},{"key":"9146_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/dimacs\/026\/05","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"M. Brockington","year":"1996","unstructured":"Brockington, M., Culberson, J.: Camouflaging independent sets in quasi-random graphs. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 75\u201388. AMS, New York (1996)"},{"key":"9146_CR12","first-page":"1221","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI\u201907)","author":"J. Cerquides","year":"2007","unstructured":"Cerquides, J., Endriss, U., Giovannucci, A., Rodr\u00edguez-Aguilar, J.A.: Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI\u201907), pp. 1221\u20131226 (2007)"},{"key":"9146_CR13","first-page":"408","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP\u201901)","author":"H. Chen","year":"2001","unstructured":"Chen, H., Gomes, C.P., Selman, B.: Formal models of heavy-tailed behavior in combinatorial search. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP\u201901), pp. 408\u2013421 (2001)"},{"issue":"2\u20133","key":"9146_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10601-006-8059-8","volume":"11","author":"D.A. Cohen","year":"2006","unstructured":"Cohen, D.A., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry definitions for constraint satisfaction problems. Constraints 11(2\u20133), 115\u2013137 (2006)","journal-title":"Constraints"},{"key":"9146_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1090\/dimacs\/026\/13","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"J. Culberson","year":"1996","unstructured":"Culberson, J., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 245\u2013284. AMS, New York (1996)"},{"key":"9146_CR16","doi-asserted-by":"crossref","unstructured":"Delahaye, J.P.: The science behind sudoku. Sci. Am. 80\u201387, June 2006","DOI":"10.1038\/scientificamerican0606-80"},{"key":"9146_CR17","first-page":"288","volume-title":"Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP\u201903)","author":"I. Dot\u00fa","year":"2003","unstructured":"Dot\u00fa, I., del Val, A., Cebri\u00e1n, M.: Redundant modeling for the quasigroup completion problem. In: Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP\u201903), pp. 288\u2013302 (2003)"},{"key":"9146_CR18","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT\u20192003)","author":"N. E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT\u20192003) (2003)"},{"key":"9146_CR19","first-page":"15","volume":"39","author":"B. Felgenhauer","year":"2006","unstructured":"Felgenhauer, B., Jarvis, F.: Mathematics of sudoku I. Math. Spectr. 39, 15\u201322 (2006)","journal-title":"Math. Spectr."},{"key":"9146_CR20","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1613\/jair.2155","volume":"28","author":"Y. Gao","year":"2007","unstructured":"Gao, Y., Culberson, J.: Consistency and random constraint satisfaction models. J. Artif. Intell. Res. 28, 517\u2013557 (2007)","journal-title":"J. Artif. Intell. Res."},{"issue":"1\u20132","key":"9146_CR21","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"I.P. Gent","year":"1996","unstructured":"Gent, I.P., Walsh, T.: The tsp phase transition. Artif. Intell. 88(1\u20132), 349\u2013358 (1996)","journal-title":"Artif. Intell."},{"key":"9146_CR22","first-page":"98","volume-title":"17th European Conference on Artificial Intelligence (ECAI 2006)","author":"I.P. Gent","year":"2006","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 98\u2013102 (2006)"},{"key":"9146_CR23","first-page":"221","volume-title":"Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI\u201997)","author":"C. Gomes","year":"1997","unstructured":"Gomes, C., Selman, B.: Problem structure in the presence of perturbations. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI\u201997), pp. 221\u2013227. AAAI Press, New Providence (1997)"},{"key":"9146_CR24","volume-title":"Proceedings of the Third International Conference of Constraint Programming (CP\u201997)","author":"C.P. Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Proceedings of the Third International Conference of Constraint Programming (CP\u201997). Springer, Berlin (1997)"},{"issue":"1\u20132","key":"9146_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1\u20132), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"key":"9146_CR26","first-page":"284","volume-title":"Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS\u201906)","author":"J. Hoffmann","year":"2006","unstructured":"Hoffmann, J., Gomes, C.P., Selman, B.: Structure and problem hardness: Goal asymmetry and DPLL proofs in SAT-based planning. In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS\u201906), pp. 284\u2013293 (2006)"},{"key":"9146_CR27","first-page":"334","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI\u201997)","author":"T. Hogg","year":"1997","unstructured":"Hogg, T.: Exploiting the deep structure of constraint satisfaction problems with quantum computers. In: Proceedings of the National Conference on Artificial Intelligence (AAAI\u201997), pp. 334\u2013339 (1997)"},{"key":"9146_CR28","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/(SICI)1520-6610(1996)4:6<405::AID-JCD3>3.0.CO;2-J","volume":"4","author":"M.T. Jacobson","year":"1996","unstructured":"Jacobson, M.T., Matthews, P.: Generating uniformly distributed random Latin squares. J. Comb. Des. 4, 405\u2013437 (1996)","journal-title":"J. Comb. Des."},{"key":"9146_CR29","first-page":"193","volume-title":"Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R. Kannan","year":"1997","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. In: Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 193\u2013200 (1997)"},{"key":"9146_CR30","first-page":"193","volume-title":"Proc. of International Conference on Artificial Intelligence (JCAI\u201901)","author":"H. Kautz","year":"2001","unstructured":"Kautz, H., Ruan, Y., Achlioptas, D., Gomes, C., Selman, B., Stickel, M.: Balance and filtering in structured satisfiable problems. In: Proc. of International Conference on Artificial Intelligence (JCAI\u201901), pp. 193\u2013200 (2001)"},{"key":"9146_CR31","first-page":"193","volume-title":"Proc. of National Conference on Artificial Intelligence (AAAI\u201905)","author":"P. Kilby","year":"2005","unstructured":"Kilby, P., Slaney, J., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proc. of National Conference on Artificial Intelligence (AAAI\u201905), pp. 193\u2013200 (2005a)"},{"key":"9146_CR32","first-page":"175","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI\u201905)","author":"P. Kilby","year":"2005","unstructured":"Kilby, P., Slaney, J.K., Walsh, T.: The backbone of the travelling salesperson. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI\u201905), pp. 175\u2013180 (2005b)"},{"issue":"4","key":"9146_CR33","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10732-007-9012-8","volume":"13","author":"R. Lewis","year":"2007","unstructured":"Lewis, R.: Metaheuristics can solve sudoku puzzles. J. Heuristics 13(4), 387\u2013401 (2007)","journal-title":"J. Heuristics"},{"key":"9146_CR34","first-page":"341","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP\u201997)","author":"C.M. Li","year":"1997","unstructured":"Li, C.M.: Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP\u201997), pp. 341\u2013355 (1997)"},{"issue":"2","key":"9146_CR35","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1142\/S0218213008003935","volume":"17","author":"I. Lynce","year":"2008","unstructured":"Lynce, I., Marques-Silva, J.: Haplotype inference with boolean satisfiability. Int. J. Artif. Intell. Tools 17(2), 355\u2013387 (2008)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"9146_CR36","volume-title":"Proc. of Ninth International Symposium on Artificial Intelligence and Mathematics (ISAIM-06)","author":"I. Lynce","year":"2006","unstructured":"Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: Proc. of Ninth International Symposium on Artificial Intelligence and Mathematics (ISAIM-06) (2006)"},{"issue":"9","key":"9146_CR37","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1016\/S1875-2780(09)60001-8","volume":"34","author":"H.D. Mo","year":"2008","unstructured":"Mo, H.D., Xu, R.G.: Sudoku square\u2014a new design in field. Acta Agron. Sin. 34(9), 1489\u20131493 (2008)","journal-title":"Acta Agron. Sin."},{"issue":"3\u20134","key":"9146_CR38","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<414::AID-RSA10>3.0.CO;2-G","volume":"15","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: 2+p-sat: Relation of typical-case complexity to the nature of the phase transition. Random Struct. Algorithms 15(3\u20134), 414\u2013435 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"9146_CR39","volume-title":"Latin Squares and Related Experimental Designs","author":"J.P. Morgan","year":"2008","unstructured":"Morgan, J.P.: Latin Squares and Related Experimental Designs. Wiley, New York (2008). doi: 10.1002\/9780470061572.eqr013"},{"key":"9146_CR40","volume-title":"Proceedings of 39th Design Automation Conference","author":"M. Moskewicz","year":"2001","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Proceedings of 39th Design Automation Conference (2001)"},{"key":"9146_CR41","first-page":"90","volume-title":"Proc. of Seventeenth National Conference on Artificial Intelligence (AAAI\u201900)","author":"T. Sandholm","year":"2000","unstructured":"Sandholm, T., Suri, S.: Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In: Proc. of Seventeenth National Conference on Artificial Intelligence (AAAI\u201900), pp. 90\u201397 (2000)"},{"key":"9146_CR42","first-page":"13","volume-title":"Proc. of Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems (in CP-2005)","author":"H. Simonis","year":"2005","unstructured":"Simonis, H.: Sudoku as a constraint problem. In: Proc. of Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems (in CP-2005), pp. 13\u201327 (2005)"},{"key":"9146_CR43","first-page":"646","volume-title":"Proc. of the International Joint Conference on Artificial Intelligence (IJCAI\u201995)","author":"B.M. Smith","year":"1995","unstructured":"Smith, B.M., Grant, S.A.: Sparse constraint graphs and exceptionally hard problems. In: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI\u201995), pp. 646\u2013654 (1995)"},{"key":"9146_CR44","doi-asserted-by":"crossref","unstructured":"Vaughan, E.R.: The complexity of constructing gerechte designs. Electron. J. Comb. 16 (2009)","DOI":"10.37236\/104"},{"key":"9146_CR45","first-page":"11","volume-title":"LPAR-12, the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Short Paper Proceedings","author":"T. Weber","year":"2005","unstructured":"Weber, T.: A SAT-based Sudoku solver. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR-12, the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Short Paper Proceedings, pp. 11\u201315 (2005)"},{"key":"9146_CR46","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","volume":"70","author":"C.P. Williams","year":"1994","unstructured":"Williams, C.P., Hogg, T.: Exploiting the deep structure of constraint problems. Artif. Intell. 70, 73\u2013117 (1994)","journal-title":"Artif. Intell."},{"key":"9146_CR47","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K. Xu","year":"2000","unstructured":"Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res. 12, 93\u2013103 (2000)","journal-title":"J. Artif. Intell. Res."},{"issue":"8\u20139","key":"9146_CR48","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K. Xu","year":"2007","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artif. Intell. 171(8\u20139), 514\u2013534 (2007)","journal-title":"Artif. Intell."},{"key":"9146_CR49","volume-title":"Proc. of National Meeting of the Information Processing Society of Japan (IPSJ)","author":"T. Yato","year":"2002","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. In: Proc. of National Meeting of the Information Processing Society of Japan (IPSJ) (2002)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9146-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9146-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9146-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T10:56:36Z","timestamp":1591959396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9146-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,5]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9146"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9146-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,5]]}}}