MétaCan
Menu
Back to cohort
Record W1923759509 · doi:10.1090/s0002-9939-00-05735-x

Bounding the number of cycles of O.D.E.s in 𝐑ⁿ

2000· article· lv· W1923759509 on OpenAlexafffund
M. Farkas, P. van den Driessche, Mary Lou Zeeman

Bibliographic record

VenueProceedings of the American Mathematical Society · 2000
Typearticle
Languagelv
FieldMathematics
TopicMathematics and Applications
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of VictoriaUniversity of Texas at San Antonio
KeywordsBounding overwatchMathematicsCombinatoricsComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

Criteria are given under which the boundary of an oriented surface does not consist entirely of trajectories of the C 1 C^1 differential equation x ˙ = f ( x ) \dot {x} = f(x) in R n {\mathbf R}^n . The special case of an annulus is further considered, and the criteria are used to deduce sufficient conditions for the differential equation to have at most one cycle. A bound on the number of cycles on surfaces of higher connectivity is given by similar conditions.

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.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.015
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.002
Scholarly communication0.0040.004
Open science0.0010.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0150.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.021
GPT teacher head0.310
Teacher spread0.289 · 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
Published2000
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the American Mathematical SocietySame topicMathematics and ApplicationsFrench-language works237,207