Translating Law and Code in Government: Algorithmic Decisions and Their Legal Effects in Canada
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
This article analyzes the translation of law into computer code and the use of automated decision-making systems in government to make legal distinctions. Specifically, how are algorithmic decisions tied to law, and what happens when legal effects are mediated through technologies? The sociology of translation and Bruno Latour's theory of law, as elaborated by Kyle McGee, provides the means to study associations between law and technology. I trace how the force of law can be extended when mediated through computer systems and analyze the associations of law and technology in Canada's government, through projects exemplifying the shift to “code-driven law.” These include the translation of “rules-as-code,” and several of the sociotechnical systems governing Canada's borders, demonstrating how design choices in government digital services inevitably shape the outcomes of public policy and can have legal effects. While Latour's legal scholarship avoided traditional questions of legitimacy, a key consideration for automated government systems is how legitimacy is constructed and contested. For rules-as-code, legitimate algorithmic outcomes should be traceable to law, but existing government systems commonly maintain legitimacy by identifying a human actor “in-the-loop” as the ultimate decision-maker, thereby obscuring how thoroughly imbricated human and algorithmic agency are in contemporary governance.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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 it