All Convictions Are Not the Same: Rethinking CUPE’s Abuse of Process Doctrine in Cases Involving Plea Bargains
Bibliographic record
Abstract
Historically, when a criminal conviction was introduced as evidence of guilt in a subsequent civil action, the convicted party was permitted to introduce rebuttal evidence to negate or mitigate the effect of the prior conviction. However, the Supreme Court of Canada’s 2003 decision in Toronto (City) v Canadian Union of Public Employees (CUPE) Local 79 has resulted in an unprecedented restriction on the ability to rebut a prior conviction. As a result of the CUPE decision, the doctrine of abuse of process now precludes rebuttal evidence in most cases. CUPE’s expanded abuse of process doctrine is troubling because, to date, courts have applied it to all prior convictions—even convictions arising out of plea bargains. However, Canada’s system of plea bargaining exerts significant coercive pressure on the accused, which may render such convictions less trustworthy. This paper argues that it is time that our civil courts recognize that all convictions are not the same: those based on plea bargains raise unique fairness concerns that warrant relaxing CUPE’s rigid bar on rebuttal evidence. Judges in our civil courts ought to be permitted to examine the circumstances surrounding guilty pleas to determine if the plea bargain appears to be coercive. If so, they ought to permit the convicted party to adduce rebuttal evidence. Such an approach remains true to the main principle underlying the CUPE decision—the integrity of the justice system—while at the same time preventing the unfairness of coercive plea bargains from spilling over into our civil courts.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".