{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:46:23Z","timestamp":1782481583043,"version":"3.54.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032297433","type":"print"},{"value":"9783032297440","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:00:00Z","timestamp":1782518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:00:00Z","timestamp":1782518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-29744-0_24","type":"book-chapter","created":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T12:50:38Z","timestamp":1782478238000},"page":"355-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Process-Integrated IRT: Enhancing Ability Estimation in\u00a0Computer-Based Programming Assessments Through Response Process Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0773-0275","authenticated-orcid":false,"given":"Yoshimitsu","family":"Miyazawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3598-8867","authenticated-orcid":false,"given":"Maomi","family":"Ueno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,27]]},"reference":[{"key":"24_CR1","unstructured":"1EdTech Consortium Inc.: Question & Test Interoperability (QTI) 3.0. https:\/\/www.imsglobal.org\/spec\/qti\/v3p0\/oview (2025). Accessed 14 Feb 2025"},{"key":"24_CR2","unstructured":"Berges, M., Hubwieser, P.: Evaluation of source code with item response theory. In: Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, pp. 51\u201356 (2015)"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v076.i01","volume":"76","author":"B Carpenter","year":"2017","unstructured":"Carpenter, B., et al.: STAN: a probabilistic programming language. J. Stat. Softw. 76(1), 1\u201332 (2017)","journal-title":"J. Stat. Softw."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Demirta\u015f, M.A., Zheng, C., Fowler, M., Cunningham, K.: Generating planning feedback for open-ended programming exercises with LLMs. In: The 26th International Conference on Artificial Intelligence in Education (AIED), 2025, pp. 33\u201348 (2025)","DOI":"10.1007\/978-3-031-98417-4_3"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Dong, D., Liang, Y.: Grading programming assignments by summarization. In: Proceedings of the ACM Turing Award Celebration Conference, pp. 53\u201358. Association for Computing Machinery (2024)","DOI":"10.1145\/3674399.3674426"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Fritz, T., Ou, J., Murphy, G.C., Murphy-Hill, E.: A degree-of-knowledge model to capture source code familiarity. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering, pp. 385\u2013394. Association for Computing Machinery (2010)","DOI":"10.1145\/1806799.1806856"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1109\/TLT.2022.3163360","volume":"15","author":"K Fuchimoto","year":"2022","unstructured":"Fuchimoto, K., Ishii, T., Ueno, M.: Hybrid maximum clique algorithm using parallel integer programming for uniform test assembly. IEEE Trans. Learn. Technol. 15(2), 252\u2013264 (2022)","journal-title":"IEEE Trans. Learn. Technol."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"112804","DOI":"10.1109\/ACCESS.2023.3322720","volume":"11","author":"K Fuchimoto","year":"2023","unstructured":"Fuchimoto, K., Minato, S.I., Ueno, M.: Automated parallel test forms assembly using zero-suppressed binary decision diagrams. IEEE Access 11, 112804\u2013112813 (2023)","journal-title":"IEEE Access"},{"key":"24_CR9","unstructured":"Guo, H., et al.: Measuring students\u2019 programming skill via online practice. In: Proceedings of the 8th Educational Data Mining in Computer Science Education (CSEDM) Workshop, pp.\u00a01\u20137 (2024)"},{"key":"24_CR10","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques (The Morgan Kaufmann Series in Data Management Systems). Morgan Kaufmann (2011)"},{"issue":"1","key":"24_CR11","first-page":"1593","volume":"15","author":"MD Hoffman","year":"2014","unstructured":"Hoffman, M.D., Gelman, A.: The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. J. Mach. Learn. Res. 15(1), 1593\u20131623 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1109\/TLT.2020.3032980","volume":"13","author":"B Jiang","year":"2020","unstructured":"Jiang, B., Wu, S., Yin, C., Zhang, H.: Knowledge tracing within single programming practice using problem-solving process data. IEEE Trans. Learn. Technol. 13(4), 822\u2013832 (2020)","journal-title":"IEEE Trans. Learn. Technol."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Koutcheme, C., Sarsa, S., Leinonen, J., Haaranen, L., Hellas, A.: Evaluating distance measures for program repair. In: Proceedings of the 2023 ACM Conference on International Computing Education Research, pp. 495\u2013507. Association for Computing Machinery (2023)","DOI":"10.1145\/3568813.3600130"},{"key":"24_CR14","unstructured":"Leinonen, J.: Keystroke Data in Programming Courses. Ph.D. Thesis, University of Helsinki (2019)"},{"issue":"8","key":"24_CR15","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8), 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1177\/014662169201600206","volume":"16","author":"E Muraki","year":"1992","unstructured":"Muraki, E.: A generalized partial credit model: application of an EM algorithm. Appl. Psychol. Meas. 16(2), 159\u2013176 (1992)","journal-title":"Appl. Psychol. Meas."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Muraki, E.: A generalized partial credit model. In: Handbook of Modern Item Response Theory, pp. 153\u2013164. Springer (1997)","DOI":"10.1007\/978-1-4757-2691-6_9"},{"key":"24_CR18","unstructured":"Muraki, E., Muraki, M.: Generalized partial credit model. In: Handbook of Modern Item Response Theory: Volume 1: Models, pp. 127\u2013137. CRC Press (2015)"},{"key":"24_CR19","first-page":"733","volume":"28","author":"Y Nakayama","year":"2020","unstructured":"Nakayama, Y., Kuno, Y., Kakuda, H.: Split-paper testing: a novel approach to evaluate programming performance. J. Info. Process. 28, 733\u2013743 (2020)","journal-title":"J. Info. Process."},{"key":"24_CR20","unstructured":"Open Assessment Technologies: Tao testing. https:\/\/www.taotesting.com\/ (2025). Accessed 14 Feb 2025"},{"key":"24_CR21","unstructured":"Parsons, D., Haden, P.: Parson\u2019s programming puzzles: a fun and effective learning tool for first programming courses. In: Proceedings of the 8th Australasian Conference on Computing Education, pp. 157\u2013163 (2006)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Szabo, C., Sheard, J., Malmi, L., Kinnunen, P.: Parsons problems and computing education learning theories. In: Proceedings of the 25th Koli Calling International Conference on Computing Education Research, pp. 1\u201310. Association for Computing Machinery (2025)","DOI":"10.1145\/3769994.3770032"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"33883","DOI":"10.1109\/ACCESS.2025.3543554","volume":"13","author":"M Ueno","year":"2025","unstructured":"Ueno, M., Fuchimoto, K., Kishida, W., Miyazawa, Y.: Computerized adaptive testing to balance exposure bias and measurement accuracy using zero-suppressed binary decision diagrams. IEEE Access 13, 33883\u201333903 (2025)","journal-title":"IEEE Access"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s41237-021-00143-x","volume":"48","author":"M Ueno","year":"2021","unstructured":"Ueno, M., Fuchimoto, K., Tsutumi, E.: E-testing from artificial intelligence approach. Behaviormetrika 48(2), 409\u2013424 (2021)","journal-title":"Behaviormetrika"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Ueno, M., Miyazawa, Y.: Uniform adaptive testing using maximum clique algorithm. In: The 20th International Conference on Artificial Intelligence in Education (AIED), 2019, pp. 482\u2013493. Springer (2019)","DOI":"10.1007\/978-3-030-23204-7_40"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Ueno, M., Miyazawa, Y.: Two-stage uniform adaptive testing to balance measurement accuracy and item exposure. In: The 23rd International Conference on Artificial Intelligence in Education (AIED), 2022, pp. 626\u2013632 (2022)","DOI":"10.1007\/978-3-031-11644-5_59"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Ueno, M., Miyazawa, Y., Tsutsumi, E.: Probability-based scaffolding system using sliding hidden Markov IRT for longitudinal learning. In: The 26th International Conference on Artificial Intelligence in Education (AIED), 2025, pp. 448\u2013462 (2025)","DOI":"10.1007\/978-3-031-98417-4_32"},{"issue":"116","key":"24_CR28","first-page":"3571","volume":"11","author":"S Watanabe","year":"2010","unstructured":"Watanabe, S.: Asymptotic equivalence of bayes cross validation and widely applicable information criterion in singular learning theory. J. Mach. Learn. Res. 11(116), 3571\u20133594 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"27","key":"24_CR29","first-page":"867","volume":"14","author":"S Watanabe","year":"2013","unstructured":"Watanabe, S.: A widely applicable Bayesian information criterion. J. Mach. Learn. Res. 14(27), 867\u2013897 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"24_CR30","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1002\/cae.22622","volume":"31","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Paquette, L., Pinto, J.D., Fan, A.X.: Utilizing programming traces to explore and model the dimensions of novices\u2019 code-writing skill. Comput. Appl. Eng. Educ. 31(4), 1041\u20131058 (2023)","journal-title":"Comput. Appl. Eng. Educ."},{"issue":"4","key":"24_CR31","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1007\/s10639-022-11343-7","volume":"28","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Paquette, L., Pinto, J.D., Liu, Q., Fan, A.X.: Combining latent profile analysis and programming traces to understand novices\u2019 differences in debugging. Educ. Inf. Technol. 28(4), 4673\u20134701 (2023)","journal-title":"Educ. Inf. Technol."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence in Education"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29744-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T12:51:11Z","timestamp":1782478271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29744-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,27]]},"ISBN":["9783032297433","9783032297440"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29744-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,27]]},"assertion":[{"value":"27 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIED","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence in Education","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aied2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.aied-conference.org\/2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}