{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:06:07Z","timestamp":1781017567170,"version":"3.54.1"},"reference-count":5,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f1698","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"819-824","source":"Crossref","is-referenced-by-count":3,"title":["A Stacking-Based Ensemble Approach for Predicting Chess Puzzle Difficulty"],"prefix":"10.15439","volume":"43","author":[{"given":"Alan","family":"Liang","sequence":"first","affiliation":[{"name":"University of Southern California"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cenzhi","family":"Liu","sequence":"additional","affiliation":[{"name":"Fuhua Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ethan","family":"Liu","sequence":"additional","affiliation":[{"name":"Rose-Hulman Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","unstructured":"J. Zy\u015bko, M. \u015awiechowski, S. Stawicki, K. Jagie\u0142a, A. Janusz and D.\n\u015al\u0119zak, \"IEEE Big Data Cup 2024 Report: Predicting Chess Puzzle\nDifficulty at KnowledgePit.ai,\" 2024 IEEE International Conference on\nBig Data (BigData), Washington, DC, USA, 2024, pp. 8423-8429, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10825289.","DOI":"10.1109\/BigData62323.2024.10825289"},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"T. Woodruff, O. Filatov and M. Cognetta, \"The bread emoji Team\u2019s\nSubmission to the IEEE BigData 2024 Cup: Predicting Chess Puzzle\nDifficulty Challenge,\" 2024 IEEE International Conference on Big\nData (BigData), Washington, DC, USA, 2024, pp. 8415-8422, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10826037.","DOI":"10.1109\/BigData62323.2024.10826037"},{"key":"ref3","unstructured":"K. Mi\u0142osz and A. Kapusta, \u201cGlickFormer: A Spatio-Temporal Transformer for Chess Puzzle Difficulty Prediction,\u201d in Proc. IEEE BigData\nConf., 2024."},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"D. Ruta, M. Liu and L. Cen, \"Moves Based Prediction of Chess\nPuzzle Difficulty with Convolutional Neural Networks,\" 2024 IEEE\nInternational Conference on Big Data (BigData), Washington, DC, USA,\n2024, pp. 8390-8395, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10825595.","DOI":"10.1109\/BigData62323.2024.10825595"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"J. Zy\u015bko, M. \u015al\u0119zak, D. \u015al\u0119zak, and M. \u015awiechowski, \u201cFedCSIS 2025\nknowledgepit.ai Competition: Predicting Chess Puzzle Difficulty Part 2\n& A Step Toward Uncertainty Contests,\u201d in Proc. 20th Conf. Comput.\nSci. Intell. Syst. (FedCSIS), vol. 43, Polish Inf. Process. Soc., 2025. http:\/\/dx.doi.org\/10.15439\/2025F5937.","DOI":"10.15439\/2025F5937"}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:52:06Z","timestamp":1761119526000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/1698.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":5,"URL":"https:\/\/doi.org\/10.15439\/2025f1698","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}