MétaCan
Menu
Back to cohort
Record W2800602737 · doi:10.1002/jcd.21633

Strong Skolem starters

2018· preprint· en· W2800602737 on OpenAlexaff
Oleg Ogandzhanyants, Margarita Kondratieva, Nabil Shalaby

Bibliographic record

VenueJournal of Combinatorial Designs · 2018
Typepreprint
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsInterpretation (philosophy)Construct (python library)Class (philosophy)MathematicsCombinatoricsComputer scienceArtificial intelligenceProgramming language

Abstract

fetched live from OpenAlex

Abstract This paper concerns a class of combinatorial objects called Skolem starters, and more specifically, strong Skolem starters, which are generated by Skolem sequences. In 1991, Shalaby conjectured that any additive group , where or , admits a strong Skolem starter and constructed these starters of all admissible orders . Only finitely many strong Skolem starters have been known to date. In this paper, we offer a geometrical interpretation of strong Skolem starters and explicitly construct infinite families of them.

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.002
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.010
Threshold uncertainty score0.035

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0100.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.024
GPT teacher head0.240
Teacher spread0.216 · 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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Combinatorial DesignsSame topicgraph theory and CDMA systemsFrench-language works237,207