Bibliographic record
Abstract
It is shown how tools of argument analysis currently being developed in artificial intelligence can be applied to legal judgments about evidence based on common knowledge. Chains of reasoning containing generalizations and implicit premises that express common knowledge are modeled using argument diagrams and argumentation schemes. A controversial thesis is argued for. It is the thesis that such premises can best be seen as commitments accepted by parties to a dispute, and thus tentatively accepted, subject to default should new evidence come in that would overturn them. Common knowledge, on this view, is not knowledge, strictly speaking, but a kind of provisional acceptance of a proposition based on its not being disputed, and its being generally accepted as true, but subject to exceptions.
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.017 | 0.063 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.007 | 0.007 |
| Science and technology studies | 0.005 | 0.022 |
| Scholarly communication | 0.016 | 0.037 |
| Open science | 0.004 | 0.010 |
| Research integrity | 0.008 | 0.009 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
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".