MétaCan
Menu
Back to cohort
Record W4362608358 · doi:10.4995/agt.2023.17046

Good coverings of proximal Alexandrov spaces. Path cycles in the extension of the Mitsuishi-Yamaguchi good covering and Jordan Curve Theorems

2023· article· en· W4362608358 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueApplied General Topology · 2023
Typearticle
Languageen
FieldComputer Science
TopicTopological and Geometric Data Analysis
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of CanadaGruppo Nazionale per le Strutture Algebriche, Geometriche e le loro ApplicazioniTürkiye Bilimsel ve Teknolojik Araştırma KurumuIstituto Nazionale di Alta Matematica "Francesco Severi"
KeywordsMathematicsPath (computing)Extension (predicate logic)Space (punctuation)Sequence (biology)Cover (algebra)Frame (networking)Frame workPure mathematicsMathematical analysisGeometryCombinatorics

Abstract

fetched live from OpenAlex

This paper introduces proximal path cycles, which lead to the main results in this paper, namely, extensions of the Mitsuishi-Yamaguchi Good Coverning Theorem with different forms of Tanaka good cover of an Alexandrov space equipped with a proximity relation as well as extension of the Jordan curve theorem. In this work, a path cycle is a sequence of maps h1,...,hi,...,hn-1 mod n in which hi : [ 0,1 ] → X and hi(1) = hi+1(0) provide the structure of a path-connected cycle that has no end path. An application of these results is also given for the persistence of proximal video frame shapes that appear in path cycles.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.693
Threshold uncertainty score0.347

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.014
GPT teacher head0.237
Teacher spread0.223 · 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