Bibliographic record
Abstract
Abstract We study the existence of continuity points for mappings whose x-sections are fragmentable and y-sections are quasicontinuous, where X is a Baire space and Z is a metric space. For the factor Y, we consider two infinite “pointpicking” games G1(y) and G2(y) defined respectively for each y ∈ Y as follows: in the n-th inning, Player I gives a dense set Dn⊂ Y, respectively, a dense open set Dn⊂ Y. Then Player II picks a point yn∈ Dn; II wins if y is in the closure of {yn: n ∈ N}, otherwise I wins. It is shown that (i) f is cliquish if II has a winning strategy in G1(y) for every y ∈ Y, and (ii) f is quasicontinuous if the x-sections of f are continuous and the set of y ∈ Y such that II has a winning strategy in G2(y) is dense in Y. Item (i) extends substantially a result of Debs and item (ii) indicates that the problem of Talagrand on separately continuous maps has a positive answer for a wide class of “small” compact spaces.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.006 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".