MétaCan
Menu
Back to cohort
Record W4247184689 · doi:10.5539/jmr.v1n1p0

Journal of Mathematics Research, Vol. 1, No. 1, March 2009

2009· article· en· W4247184689 on OpenAlexvenueno aff
JMR Editor

Bibliographic record

VenueJournal of Mathematics Research · 2009
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsnot available
FundersSouthwestern University of Finance and EconomicsChulalongkorn University
KeywordsMathematicsMathematics education

Abstract

fetched live from OpenAlex

Let G be a finite directed graph, β(G) the minimum size of a subset X of edges such that the graph G = (V, E X) is directed acyclic and γ(G) the number of pairs of nonadjacent vertices in the undirected graph obtained from G by replacing each directed edge with an undirected edge.Chudnovsky, Seymour and Sullivan proved that if G is triangle-free, then β(G) ≤ γ(G).They conjectured a sharper bound (so called the "CSS conjecture") that β(G) ≤ γ(G)/2.Nathanson and Sullivan verified this conjecture for the directed Cayley graph Cay(Z/NZ, E A ) whose vertex set is the additive group Z/NZ and whose edge set E A is determined by E A = {(x, x + a) : x ∈ Z/NZ, a ∈ A} when N is prime and |A| ≤ (N -1)/4 by introducing "height".In this work, we extend the definition of height and apply to answer the CSS conjecture for Cay(Z/NZ, E A ) to any positive integer N and |A| ≤ (N -1)/4.

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.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.945
Threshold uncertainty score0.186

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.002
Scholarly communication0.0060.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0550.015

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.180
GPT teacher head0.461
Teacher spread0.281 · 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.

Study designNot applicable
Domainnot available
GenreOther

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

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Mathematics ResearchSame topicLimits and Structures in Graph TheoryFrench-language works237,207