{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:29:43Z","timestamp":1755998983412,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031362712"},{"type":"electronic","value":"9783031362729"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36272-9_41","type":"book-chapter","created":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T23:03:19Z","timestamp":1687734199000},"page":"502-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Feedback and\u00a0Partial Credit Grading for\u00a0Proof Blocks Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6284-9972","authenticated-orcid":false,"given":"Seth","family":"Poulsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1670-6011","authenticated-orcid":false,"given":"Shubhang","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9501-2295","authenticated-orcid":false,"given":"Geoffrey","family":"Herman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7605-0050","authenticated-orcid":false,"given":"Matthew","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"41_CR1","unstructured":"pl-order-blocks documentation (2021). https:\/\/prairielearn.readthedocs.io\/en\/latest\/elements\/#pl-order-blocks-element. Accessed June 2021"},{"key":"41_CR2","unstructured":"Alur, R., D\u2019Antoni, L., Gulwani, S., Kini, D., Viswanathan, M.: Automated grading of DFA constructions. In: Twenty-Third International Joint Conference on Artificial Intelligence (2013)"},{"issue":"2","key":"41_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1207\/s15327809jls0402_2","volume":"4","author":"JR Anderson","year":"1995","unstructured":"Anderson, J.R., Corbett, A.T., Koedinger, K.R., Pelletier, R.: Cognitive tutors: lessons learned. J. Learn. Sci. 4(2), 167\u2013207 (1995)","journal-title":"J. Learn. Sci."},{"key":"41_CR4","unstructured":"Anderson, J., Boyle, C., Yost, G.: The geometry tutor. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (1985)"},{"issue":"2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jaccedu.2010.02.003","volume":"27","author":"B Apostolou","year":"2009","unstructured":"Apostolou, B., Blue, M.A., Daigle, R.J.: Student perceptions about computerized testing in introductory managerial accounting. J. Account. Educ. 27(2), 59\u201370 (2009). https:\/\/doi.org\/10.1016\/j.jaccedu.2010.02.003","journal-title":"J. Account. Educ."},{"key":"41_CR6","doi-asserted-by":"publisher","unstructured":"Chandra, B., Banerjee, A., Hazra, U., Joseph, M., Sudarshan, S.: Automated grading of SQL queries. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1630\u20131633, April 2019. https:\/\/doi.org\/10.1109\/ICDE.2019.00159, iSSN: 2375-026X","DOI":"10.1109\/ICDE.2019.00159"},{"issue":"40","key":"41_CR7","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40), 3736\u20133756 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.026","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"41_CR8","first-page":"373","volume":"29","author":"M Darrah","year":"2010","unstructured":"Darrah, M., Fuller, E., Miller, D.: A comparative study of partial credit assessment and computer-based testing for mathematics. J. Comput. Math. Sci. Teach. 29(4), 373\u2013398 (2010)","journal-title":"J. Comput. Math. Sci. Teach."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Radi\u010dek, I., Zuleger, F.: Automated Clustering and Program Repair for Introductory Programming Assignments, p. 16 (2018)","DOI":"10.1145\/3192366.3192387"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, pp. 11\u201315. Pasadena, CA USA (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"6","key":"41_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(74)90001-5","volume":"2","author":"DE Knuth","year":"1974","unstructured":"Knuth, D.E., Szwarcfiter, J.L.: A structured program to generate all topological sorting arrangements. Inf. Process. Lett. 2(6), 153\u2013157 (1974)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1207\/s15516709cog1404_2","volume":"14","author":"KR Koedinger","year":"1990","unstructured":"Koedinger, K.R., Anderson, J.R.: Abstract planning and perceptual chunks: elements of expertise in geometry. Cogn. Sci. 14(4), 511\u2013550 (1990)","journal-title":"Cogn. Sci."},{"issue":"5","key":"41_CR13","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1111\/jcal.12365","volume":"35","author":"J Lodder","year":"2019","unstructured":"Lodder, J., Heeren, B., Jeuring, J.: A comparison of elaborated and restricted feedback in LogEx, a tool for teaching rewriting logical formulae. J. Comput. Assist. Learn. 35(5), 620\u2013632 (2019). https:\/\/doi.org\/10.1111\/jcal.12365","journal-title":"J. Comput. Assist. Learn."},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4204\/EPTCS.313.2","volume":"313","author":"J Lodder","year":"2020","unstructured":"Lodder, J., Heeren, B., Jeuring, J.: Providing hints, next steps and feedback in a tutoring system for structural induction. Electron. Proc. Theor. Comput. Sci. 313, 17\u201334 (2020). https:\/\/doi.org\/10.4204\/EPTCS.313.2","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"Miller, B.N., Ranum, D.L.: Beyond pdf and ePub: toward an interactive textbook. In: Proceedings of the 17th ACM Annual Conference on Innovation and Technology in Computer Science Education, pp. 150\u2013155. ITiCSE 2012, ACM, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2325296.2325335","DOI":"10.1145\/2325296.2325335"},{"issue":"1","key":"41_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s40593-016-0112-1","volume":"27","author":"B Mostafavi","year":"2016","unstructured":"Mostafavi, B., Barnes, T.: Evolution of an intelligent deductive logic tutor using data-driven elements. Int. J. Artif. Intell. Educ. 27(1), 5\u201336 (2016). https:\/\/doi.org\/10.1007\/s40593-016-0112-1","journal-title":"Int. J. Artif. Intell. Educ."},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-319-19773-9_102","volume-title":"Artificial Intelligence in Education","author":"B Mostafavi","year":"2015","unstructured":"Mostafavi, B., Zhou, G., Lynch, C., Chi, M., Barnes, T.: Data-driven worked examples improve retention and completion in a logic tutor. In: Conati, C., Heffernan, N., Mitrovic, A., Verdejo, M.F. (eds.) AIED 2015. LNCS (LNAI), vol. 9112, pp. 726\u2013729. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19773-9_102"},{"issue":"1","key":"41_CR18","first-page":"1","volume":"10","author":"B Paassen","year":"2018","unstructured":"Paassen, B., Hammer, B., Price, T.W., Barnes, T., Gross, S., Pinkwart, N.: The Continuous hint factory - providing hints in vast and sparsely populated edit distance spaces. J. Educ. Data Min. 10(1), 1\u201335 (2018)","journal-title":"J. Educ. Data Min."},{"key":"41_CR19","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, vol. 52, pp. 157\u2013163. ACE \u201906, Australian Computer Society Inc., AUS (2006)"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Poulsen, S.: Proof blocks: autogradable scaffolding activities for learning to write proofs. Ph.D. thesis (2023)","DOI":"10.1145\/3502718.3524774"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Poulsen, S., Gertner, Y., Cosman, B., West, M., Herman, G.L.: Efficiency of learning from proof blocks versus writing proofs. In: Proceedings of the 54th ACM Technical Symposium on Computer Science Education. Association for Computing Machinery, New York, NY, USA (2023)","DOI":"10.1145\/3545945.3569797"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Poulsen, S., Viswanathan, M., Herman, G.L., West, M.: Evaluating proof blocks problems as exam questions. In: Proceedings of the 17th ACM Conference on International Computing Education Research, pp. 157\u2013168 (2021)","DOI":"10.1145\/3446871.3469741"},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"Poulsen, S., Viswanathan, M., Herman, G.L., West, M.: Proof blocks: autogradable scaffolding activities for learning to write proofs. In: Proceedings of the 27th ACM Conference on Innovation and Technology in Computer Science Education, vol. 1. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3502718.3524774","DOI":"10.1145\/3502718.3524774"},{"issue":"1","key":"41_CR24","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM (JACM) 21(1), 168\u2013173 (1974)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"41_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015535614355","volume":"48","author":"K Weber","year":"2001","unstructured":"Weber, K.: Student difficulty in constructing proofs: the need for strategic knowledge. Educ. Stud. Math. 48(1), 101\u2013119 (2001). https:\/\/doi.org\/10.1023\/A:1015535614355","journal-title":"Educ. Stud. Math."},{"key":"41_CR26","unstructured":"West, M., Herman, G.L., Zilles, C.: PrairieLearn: mastery-based online problem solving with adaptive scoring and recommendations driven by machine learning. In: 2015 ASEE Annual Conference & Exposition, pp. 26.1238.1-26.1238.14. No. 10.18260\/p.24575, ASEE Conferences, Seattle, Washington, June 2015"}],"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-031-36272-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:23:07Z","timestamp":1729646587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36272-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031362712","9783031362729"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36272-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aied2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.aied2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"311","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}