MétaCan
Menu
Back to cohort
Record W2023526333 · doi:10.4153/cmb-2005-022-4

Counting Multiple Cyclic Choices Without Adjacencies

2005· article· en· W2023526333 on OpenAlexaffvenue
Alice McLeod, W. O. J. Moser

Bibliographic record

VenueCanadian Mathematical Bulletin · 2005
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsMcGill University
Fundersnot available
KeywordsMathematicsGeneralizationCombinatoricsClass (philosophy)Line (geometry)GeometryMathematical analysisArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract We give a particularly elementary solution to the following well-known problem. What is the number of k-subsets X ⊆ In = {1, 2, 3, … , n} satisfying “no two elements of X are adjacent in the circular display of In”? Then we investigate a new generalization (multiple cyclic choices without adjacencies) and apply it to enumerating a class of 3-line latin rectangles.

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.007
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: Empirical
Teacher disagreement score0.009
Threshold uncertainty score0.031

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0090.001

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.008
GPT teacher head0.182
Teacher spread0.174 · 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

Citations2
Published2005
Admission routes2
Has abstractyes

Explore more

Same venueCanadian Mathematical BulletinSame topicgraph theory and CDMA systemsFrench-language works237,207