Bibliographic record
Abstract
A presumption is a device used in the law of evidence to enable a proposition to be taken into account as a piece of evidence in a case even though the argument supporting that proposition is not strong enough for it to meet a required burden of proof. From this definition of what presumption is, we can already see that presumption is linked to burden of proof in evidential reasoning in law. Burden of proof sets a standard for what is to be considered a proof in evidential reasoning in law. It is a device used to make it possible for a trial to arrive at a decision for one side or another in a contested case, even though all the facts of the case may not be known, and for various reasons may never be known. For example, in a criminal case, there may have been no witnesses to the crime, and the crime may have happened a long time ago. Most of the existing evidence may have been lost or destroyed. Therefore, evidential reasoning in law has to be able to move forward to a conclusion under conditions of uncertainty, lack of knowledge and even inconsistency. Typically, for example, in a trial there will be witnesses for one side, but there will also be conflicting testimony on the other side brought in by witnesses who say the opposite thing. What these conditions imply is that in a trial it is rarely if ever possible to prove or disprove the ultimate conclusion beyond all doubt. Hence, the device of having a burden of proof is necessary for the trial to reach a conclusion for one side or the other. Presumption is not a new notion in legal reasoning. It was a device used in the ancient Jewish law code of the Talmud, and in ancient Roman law. A rough idea of how presumptions work is shown by citing some of the more common examples. According to the presumption of death, a person who has been unheard of for a fixed period of time, varying with the jurisdiction, five years typically in common law, may be presumed to be dead if there is no other explanation of his or her disappearance based on any evidence. Later in this book we will examine an example of another interesting kind of presumption called the presumption of mailing, which presumes that a properly addressed and stamped letter sent by the Postal Service was received by the person to whom it was addressed.
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.009 | 0.038 |
| Meta-epidemiology (narrow) | 0.003 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.004 |
| Bibliometrics | 0.005 | 0.005 |
| Science and technology studies | 0.002 | 0.005 |
| Scholarly communication | 0.010 | 0.012 |
| Open science | 0.007 | 0.006 |
| Research integrity | 0.005 | 0.006 |
| Insufficient payload (model declined to judge) | 0.165 | 0.100 |
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".