Claims

Under the Leitner Queue Network optimization, easy items call for roughly uniform time across decks, while more difficult items call for more time on lower decks.

Claim · All claims
Evidence · 1 study · theoretical r3 · q1
Currency · newest study 2016 · not yet checked against its sources · not reviewed by a person

Subclaims

Reading the evidence codes

q is the design tier, i the impact, n the sample, and the kind with its r the rigour judged within that kind: what each code means.

This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.

q1 i? Comparing optimal schedules for different item difficulties at the same budget (Fig. 12) suggests uniform deck time for easy items and more lower-deck time for harder items. → Reddy 2016

Evidence

Reddy 2016

Reddy, S., Labutov, I., Banerjee, S., & Joachims, T. (2016). Unbounded Human Learning: Optimal Scheduling for Spaced Repetition. KDD ’16, San Francisco, CA, USA. https://doi.org/10.1145/2939672.2939850

q1 · i? · theoretical · r3

Optimization result from the item-difficulty extension of the model (Fig. 12). It "suggests that when items are generally easy, the user should spend a roughly uniform amount of time on each deck", and more on lower decks for harder items.

"Fig. 12 suggests that when items are generally easy, the user should spend a roughly uniform amount of time on each deck; however, when items are of higher general difficulty, the user should spend more time on lower decks than higher decks."

Discussion

Page metadata
Field Value
type claim
id optimal-leitner-deck-allocation-depends-on-item-difficulty
title Under the Leitner Queue Network optimization, easy items call for roughly uniform time across decks, while more difficult items call for more time on lower decks.
description Under the Leitner Queue Network optimization, easy items call for roughly uniform time across decks, while more difficult items call for more time on lower decks.
status review
evidence_strength weak
newest_evidence 2016
generated by claude/unspecified on 2026-09-24
trust unverified — no one has confirmed this page's content
sources 1 — reddy-2016

Frontmatter is the page's machine-readable record — see the Schema & Guide.