Bibliographic record
Abstract
In most U.S. jurisdictions, prosecutors are not required to clearly establish a reasonable basis for guilt prior to offering defendants plea deals. We apply Bayesian analyses, which are uniquely suited to illuminate the impact of prior probability of guilt on the informativeness of a particular outcome (i.e., a guilty plea), to demonstrate the risks of plea offers that precede evidence. Our primary prediction was that lower prior probabilities of guilt would coincide with a significantly higher risk for false guilty pleas. We incorporated data from Wilford, Sutherland et al. (2021) into a Bayesian analysis allowing us to model the expected diagnosticity of plea acceptance across the full range of prior probability of guilt. Our analysis indicated that, as predicted, when plea offers are accepted at lower prior probabilities of guilt, the probability that a plea is actually false is significantly higher than when prior probabilities of guilt are higher. In other words, there is a trade-off between prior probability of guilt and information gain. For instance, in our analysis, when prior probability of guilt was 50%, posterior probability of guilt (after a plea) was 77.8%; when prior probability of guilt was 80%, posterior probability of guilt was 93.3%. Our results clearly indicate the importance of ensuring that there is a reasonable basis for guilt before a plea deal is extended. In the absence of shared discovery, no such reasonable basis can be established. Further, these results illustrate the additional insights gained from applying a Bayesian approach to plea-decision contexts.
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.029 | 0.216 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.003 | 0.003 |
| Scholarly communication | 0.006 | 0.009 |
| Open science | 0.001 | 0.006 |
| Research integrity | 0.007 | 0.011 |
| Insufficient payload (model declined to judge) | 0.020 | 0.003 |
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".