MétaCan
Menu
Back to cohort
Record W2951348896 · doi:10.48550/arxiv.math/0103061

Extension dimensional approximation theorem

2001· preprint· en· W2951348896 on OpenAlexaff
N. Brodsky, Alex Chigogidze

Bibliographic record

VenueArXiv.org · 2001
Typepreprint
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsExtension (predicate logic)MathematicsMathematical economicsCalculus (dental)Computer scienceMedicine

Abstract

fetched live from OpenAlex

Let $L$ be a countable CW-complex and $F\colon X\to Y$ be upper semicontinuous $UV^{[L]}$-valued mapping of a paracompact space $X$ to a complete metric space $Y$. We prove that if $X$ is a C-space of extension dimension $\ed X \le [L]$, then $F$ admits single-valued graph approximations. For $L=S^n$ our result implies well-known approximation theorem for $UV^{n-1}$-valued mappings of $n$-dimensional spaces. And for $L=\{\rm point\}$ our theorem implies a theorem of Ancel on approximations of $UV^\infty$-valued mappings of C-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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.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.

Opus teacher head0.034
GPT teacher head0.260
Teacher spread0.226 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations1
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicMatrix Theory and AlgorithmsFrench-language works237,207