MétaCan
Menu
Back to cohort
Record W1694817630 · doi:10.1017/s1446788717000039

TWO-SIDED SHIFT SPACES OVER INFINITE ALPHABETS

2017· article· en· W1694817630 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.

Bibliographic record

VenueJournal of the Australian Mathematical Society · 2017
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsHausdorff spaceCompactification (mathematics)MathematicsNormal spaceContrast (vision)Locally compact spaceSpace (punctuation)Pure mathematicsDiscrete mathematicsComputer scienceTopological spaceTopological vector spaceArtificial intelligence

Abstract

fetched live from OpenAlex

Ott, Tomforde and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea, we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a result of Kitchens. As with the one-sided shifts over infinite alphabets, our shift spaces are compact Hausdorff spaces but, in contrast to the one-sided setting, our shift map is continuous everywhere. We show that many of the classical results from symbolic dynamics are still true for our two-sided shift spaces. In particular, while for one-sided shifts the problem about whether or not any $M$ -step shift is conjugate to an edge shift space is open, for two-sided shifts we can give a positive answer for this question.

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.002
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.052
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.065
GPT teacher head0.362
Teacher spread0.297 · 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