MétaCan
Menu
Back to cohort
Record W1527608075 · doi:10.37236/460

Another Abstraction of the Erdős-Szekeres Happy End Theorem

2010· article· en· W1527608075 on OpenAlexafffund
Noga Alon, Ehsan Chiniforooshan, Vašek Chvátal, François Genest

Bibliographic record

VenueThe Electronic Journal of Combinatorics · 2010
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsConcordia University
FundersTel Aviv UniversityIsrael Science FoundationNatural Sciences and Engineering Research Council of CanadaCanada Research Chairs
KeywordsMathematicsCombinatoricsInteger (computer science)Simple (philosophy)Regular polygonSet (abstract data type)Discrete mathematicsGeneral positionPlane (geometry)GeometryComputer science

Abstract

fetched live from OpenAlex

The Happy End Theorem of Erdős and Szekeres asserts that for every integer $n$ greater than two there is an integer $N$ such that every set of $N$ points in general position in the plane includes the $n$ vertices of a convex $n$-gon. We generalize this theorem in the framework of certain simple structures, which we call "happy end 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.004
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.011
Threshold uncertainty score0.037

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.003
Scholarly communication0.0030.007
Open science0.0010.005
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0110.003

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.007
GPT teacher head0.254
Teacher spread0.246 · 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

Citations5
Published2010
Admission routes2
Has abstractyes

Explore more

Same venueThe Electronic Journal of CombinatoricsSame topicAdvanced Graph Theory ResearchFrench-language works237,207