Cited by 366Teaching and Learning ProgrammingSoftware Engineering ResearchArtificial Intelligence in Education

The DOI matches its Crossref record; 102 of the 102 references it cites were found in a registry or an index; 2 of the 10 sources its claims cite were checked for support.

Studying the effect of AI Code Generators on Supporting Novice Learners in Introductory Programming

Open access
Kazemitabaar, Majeed, Chow, Justin, Ma, Carl Ka To, Ericson, Barbara J., Weintrop, David, Grossman, Tovi·2023·Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems

Abstract

AI code generators like OpenAI Codex have the potential to assist novice programmers by generating code from natural language descriptions, however, over-reliance might negatively impact learning and retention. To explore the implications that AI code generators have on introductory programming, we conducted a controlled experiment with 69 novices (ages 10-17). Learners worked on 45 Python code-authoring tasks, for which half of the learners had access to Codex, each followed by a code-modification task. Our results show that using Codex significantly increased code-authoring performance (1.15x increased completion rate and 1.8x higher scores) while not decreasing performance on manual code-modification tasks. Additionally, learners with access to Codex during the training phase performed slightly better on the evaluation post-tests conducted one week later, although this difference did not reach statistical significance. Of interest, learners with higher Scratch pre-test scores performed significantly better on retention post-tests, if they had prior access to Codex.

Overview

Integrity signals

Registry

Crossref · 10.1145/3544548.3580919

Cites

102 of 102 references verified0 citation errors · 0 not checkable

Statistics

31 tests recomputed · 0 with the reported and recomputed p on opposite sides of .05

Verification

Claims the paper makes

2 of 10 cited sources checked · 0 supported · 0 flagged · accuracy not yet measured

Show all 96 claims

  • It may state two separate claims as one. 21
  • Probably not a substantial claim. 20
39 of 39
  • The paper relies on this without support.

    The AI code generator (Codex) used in the study is representative of AI code generators in general.

    “Studying the efect of AI Code Generators on Supporting Novice Learners in Introductory Programming”
    “Similarly, AI code generators may reduce the cognitive load when learning to program, but its impact on the learning experience has not been studied.”
  • The paper relies on this without support.

    Performance on the Coding Steps tasks and multiple-choice questions reflects learning of introductory Python programming.

    “To answer these questions, we conducted a controlled study with 69 young learners, ages 10-17 (M=12.5,SD=1.8) with no prior textbased programming experience.Half of them used an AI Coding Assistant (Codex) to learn Python, and the other half did not.”
    “The tasks in this phase included fve code-authoring tasks, fve code modifcation tasks, and then 40 multiple-choice questions”
  • The paper relies on this without support.

    The AI code generator's quality measured on the 45 tasks before the study is representative of its quality during the actual study sessions.

    “To measure the quality of the AI code generator, we entered the task description of the 45 code-authoring tasks into the pre-conditioned model (described in Figure 3) and evaluated the accuracy and amount of required manual modifcations on the generated code.”
  • The paper relies on this without support.

    The learning effects and support provided by AI code generators have not been studied in the context of introductory programming.

    “To date, the learning efects and support provided by AI code generators have not been studied in the context of introductory programming.”
4 of 4

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Statistics that don’t add up

Each reported p-value recomputed from its test statistic and degrees of freedom.

  • Inconsistent p-value: t(39)=2.78,p = .007

    Minor

    The paper reports p = .007 here; recomputing from the test statistic and its degrees of freedom gives p = .008 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .007 · recomputed p = .008

  • Inconsistent p-value: t(39)=2.34,p = .022

    Minor

    The paper reports p = .022 here; recomputing from the test statistic and its degrees of freedom gives p = .024 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .022 · recomputed p = .024

  • Inconsistent p-value: t(67)=1.70,p = .092

    Minor

    The paper reports p = .092 here; recomputing from the test statistic and its degrees of freedom gives p = .094 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .092 · recomputed p = .094

  • Inconsistent p-value: t(58)=1.41,p = .161

    Minor

    The paper reports p = .161 here; recomputing from the test statistic and its degrees of freedom gives p = .164 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .161 · recomputed p = .164

  • Inconsistent p-value: t(67)=0.54,p = .67

    Minor

    The paper reports p = .67 here; recomputing from the test statistic and its degrees of freedom gives p = .591 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .67 · recomputed p = .591

  • Inconsistent p-value: t(39)=2.02,p = .047

    Minor

    The paper reports p = .047 here; recomputing from the test statistic and its degrees of freedom gives p = .050 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .047 · recomputed p = .050

  • Inconsistent p-value: t(67)=1.28,p = .202

    Minor

    The paper reports p = .202 here; recomputing from the test statistic and its degrees of freedom gives p = .205 (two-tailed). The check cannot tell whether the statistic or the p-value is the misprint.

    Reported p = .202 · recomputed p = .205

7 of 7

Statistics recomputed

Every reported test result, recomputed from its test statistic and degrees of freedom. A result shows as not adding up only once an independent check has confirmed it.

  • Doesn’t add upt(67) = 0.54reported p = .67 · recomputed p = .591

    “t(67)=0.54,p = .67”

  • Doesn’t add upt(67) = 1.28reported p = .202 · recomputed p = .205

    “t(67)=1.28,p = .202”

  • Doesn’t add upt(39) = 2.34reported p = .022 · recomputed p = .024

    “t(39)=2.34,p = .022”

  • Doesn’t add upt(58) = 1.41reported p = .161 · recomputed p = .164

    “t(58)=1.41,p = .161”

  • Doesn’t add upt(39) = 2.78reported p = .007 · recomputed p = .008

    “t(39)=2.78,p = .007”

  • Doesn’t add upt(67) = 1.7reported p = .092 · recomputed p = .094

    “t(67)=1.70,p = .092”

  • Doesn’t add upt(39) = 2.02reported p = .047 · recomputed p = .050

    “t(39)=2.02,p = .047”

  • Not confirmedt(67) = 0.058reported p = .953 · recomputed p = .954

    “t(67)=0.058,p = .953”

  • Not confirmedt(67) = 1.21reported p = .228 · recomputed p = .231

    “t(67)=1.21,p = .228”

  • Consistentt(67) = 2.8reported p = .006 · recomputed p = .007

    “t(67)=2.8,p = .006”

  • Consistentt(67) = 0.25reported p = .805 · recomputed p = .803

    “t(67)=0.25,p = .805”

  • Consistentt(67) = 0.53reported p = .6 · recomputed p = .598

    “t(67)=0.53,p = .60”

  • Consistentt(67) = 1.15reported p = .25 · recomputed p = .254

    “t(67)=1.15,p = .25”

  • Consistentt(67) = 6.92reported p < .001 · recomputed p < .001

    “t(67)=6.92,p < .001”

  • Consistentt(67) = 6.4reported p < .001 · recomputed p < .001

    “t(67)=6.40,p < .001”

  • Consistentt(67) = 5.48reported p < .001 · recomputed p < .001

    “t(67)=5.48,p < .001”

  • Consistentt(67) = 3.03reported p = .004 · recomputed p = .003

    “t(67)=3.03,p = .004”

  • Consistentt(67) = 3.65reported p = .001 · recomputed p < .001

    “t(67)=3.65,p = .001”

  • Consistentt(67) = 0.98reported p = .331 · recomputed p = .331

    “t(67)=0.98,p = .331”

  • Consistentt(67) = 1.84reported p = .071 · recomputed p = .070

    “t(67)=1.84,p = .071”

  • Consistentt(67) = 1.53reported p = .129 · recomputed p = .131

    “t(67)=1.53,p = .129”

  • Consistentt(67) = 0.91reported p = .367 · recomputed p = .366

    “t(67)=0.91,p = .367”

  • Consistentt(39) = 3.53reported p = .001 · recomputed p = .001

    “t(39)=3.53,p = .001”

  • Consistentt(67) = 0.2reported p = .838 · recomputed p = .842

    “t(67)=0.20,p = .838”

  • Consistentt(58) = 2.08reported p = .041 · recomputed p = .042

    “t(58)=2.08,p = .041”

  • Consistentt(67) = 1.13reported p = .262 · recomputed p = .263

    “t(67)=1.13,p = .262”

  • Consistentt(67) = 2.08reported p = .042 · recomputed p = .041

    “t(67)=2.08,p = .042”

  • Consistentt(67) = 1.21reported p = .229 · recomputed p = .231

    “t(67)=1.21,p = .229”

  • Consistentt(67) = 4.1reported p < .001 · recomputed p < .001

    “t(67)=4.10,p < .001”

  • Consistentt(67) = 1.54reported p = .129 · recomputed p = .128

    “t(67)=1.54,p = .129”

  • Consistentt(58) = 2.09reported p = .04 · recomputed p = .041

    “t(58)=2.09,p = .04”

31 of 31

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • The first session has two stated durations

    Minor

    The procedure describes all ten sessions as 90 minutes long, but later specifies that the first session lasted two hours.

1 of 1

Citations

Cites

Flagged first, then by citations

Show all 96 references

Research works printed but not linked: 6

  1. Amazon Web Services. 2022. CodeWhisperer: ML-powered coding companion. https://aws.amazon.com/codewhisperer/. [Online; accessed 9-September-2022].
  2. 10.5555/364133.364161 · DOI
  3. Paul Jaccard. 1901. Étude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaudoise Sci Nat 37 (1901), 547–579.
  4. Mitchel Resnick. 2014. Give P’sa chance: Projects, peers, passion, play. In Constructionism and creativity: Proceedings of the third international constructionism conference. Austrian computer society, Vienna. 13–20.
  5. Mitchel Resnick and David Siegel. 2015. A different approach to coding. International Journal of People-Oriented Programming 4, 1(2015), 1–4.
  6. Tabnine. 2022. Tabnine: AI assistant for software developers. https://www.tabnine.com/. [Online; accessed 9-September-2022].

Cited by

Sorted by citations

Items 101–110 of 110

Metadata

Authors
Kazemitabaar, M., Chow, J., Ma, C. K. T., Ericson, B. J., Weintrop, D., & Grossman, T.
Affiliations
  • University of Toronto (CA)
  • Department of Computer Science, University of Toronto, Canada
  • University of Michigan (US)
  • College of Education, College of Information Studies, University of Maryland, United States
Venue
Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems
Publisher
ACM
Published
2023-04-19
Pages
1-23
OpenAlex
W4321162272
Cited by
366
References
96
Citations by year
2026: 117 · 2025: 118 · 2024: 104 · 2023: 27
FWCI
110.39
Type
conference paper
Language
en
Open access
Locations
  • CHI Conference on Human Factors in Computing Systems (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Social Sciences › Education › Artificial Intelligence in Education
Keywords
OpenAI Codex, novice programmers, introductory programming, code modification, knowledge retention, overreliance on AI, Scratch, Python, programming education

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review