MétaCan
Menu
Back to cohort
Record W4412969805 · doi:10.1090/proc/17320

Open graphs and Tukey order

2025· article· lv· W4412969805 on OpenAlexafffund
Stevo Todorčević

Bibliographic record

VenueProceedings of the American Mathematical Society · 2025
Typearticle
Languagelv
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAlgorithmComputer scienceArtificial intelligenceAnnotation

Abstract

fetched live from OpenAlex

The two alternatives G ≤ K ℵ 0 G\leq K_{\aleph _0} and K ℵ 1 ≤ G K_{\aleph _1}\leq G of the Open Graph Dichotomy are explored here for a natural class of graphs associated to points x x in topological spaces X X . This is then used in finding Tukey restrictions on the neighbourhood filters of points x x guaranteeing that they have strong properties of sequential convergence. This paper can be seen as natural continuation of Todorcevic [Fund. Math. 267 (2024), pp. 181–194] that gives a Tukey theory interpretations of alternatives of another combinatorial dichotomy.

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.003
metaresearch head score (Gemma)0.010
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.033
Threshold uncertainty score0.112

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0030.005
Scholarly communication0.0040.007
Open science0.0010.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0330.008

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.019
GPT teacher head0.321
Teacher spread0.301 · 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
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the American Mathematical SocietySame topicAdvanced Graph Theory ResearchFrench-language works237,207