A new measure for conditional mutual information and its properties
Bibliographic record
Abstract
We propose a new conditional mutual information measure, called the reduced intrinsic in- formation, and show its significance in the context of determining the number of secret-key bits that can be extracted from distributed information by public communication. I. THE REDUCED INTRINSIC INFORMATION The secret-key rate S(X; YllZ) of a tripartite probability distribution PXYZ is the rate at which two parties, knowing realizations of X and Y, respectively, can generate, by pub- lic communication, common bits about which a third party, who has access to 2, remains almost completely ignorant (l). It is a fundamental problem to express S(X;YllZ) in terms of Pxyz. In (2), the intrinsic information I(X;YJ. Z) := infpZlz(I(X;YIZ)) was shown to be an upper bound on S(X; YllZ). (Here, the infimum is taken over all possible ways the third party Eve can process her information 2.)
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.008 | 0.037 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.001 | 0.006 |
| Scholarly communication | 0.004 | 0.012 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.005 | 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".