An integrated methodology for collecting, classifying, and analyzing Canadian construction court cases
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Construction contracts are becoming more complicated, and the increase in complexity of construction processes, documents, and conditions of contracts has contributed to a higher possibility of disputes and conflicting interpretations. The judicial system has been the means for dispute resolution for claims that cannot be solved through other means such as negotiation and arbitration. Knowledge of previous outcomes of judicial processes will both inform participants in a dispute and increase the likelihood of a less-expensive out-of-court dispute-resolution process. This paper presents a methodology to classify, categorize, and analyze Canadian case-law construction claims. In total, 567 Canadian construction court cases have been collected from 10 different sources and are classified into 12 categories that follow the Canadian Construction Documents Committee (CCDC) standard construction contract document CCDC 2-1994. The proposed methodology is implemented in a computer-integrated system called the Canadian construction claim tracker (CCCT), which consists of one central database and three modules, namely a statistical module, a prediction module, and a classification module. The CCCT provides its users with easy and quick access to past case-law claim information.Key words: construction courts, claims, litigation, artificial neural networks, Canadian Construction Documents Committee.
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.
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.003 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 it