<scp>T3</scp> + 3: 3 + 3 Design With Delayed Outcomes
Bibliographic record
Abstract
Delayed outcome is common in phase I oncology clinical trials. It causes logistic difficulty, wastes resources, and prolongs the trial duration. This article investigates this issue and proposes the time-to-event 3 + 3 (T3 + 3) design, which utilizes the actual follow-up time for at-risk patients with pending toxicity outcomes. The T3 + 3 design allows continuous accrual without unnecessary trial suspension and is costless and implementable with pretabulated dose decision rules. Besides, the T3 + 3 design uses the isotonic regression to estimate the toxicity rates across dose levels and therefore can accommodate for any targeted toxicity rate for maximum tolerated dose (MTD). It dramatically facilitates the trial preparation and conduct without intensive computation and statistical consultation. The extension to other algorithm-based phase I dose-finding designs (e.g., i3 + 3 design) is also studied. Comprehensive computer simulation studies are conducted to investigate the performance of the T3 + 3 design under various dose-toxicity scenarios. The results confirm that the T3 + 3 design substantially shortens the trial duration compared with the conventional 3 + 3 design and yields much higher accuracy in MTD identification than the rolling six design. In summary, the T3 + 3 design addresses the delayed outcome issue while keeping the desirable features of the 3 + 3 design, such as simplicity, transparency, and costless implementation. It has great potential to accelerate early-phase drug development.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.016 | 0.023 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.017 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".