MétaCan
Menu
Back to cohort
Record W3039500359 · doi:10.26493/1855-3974.2374.9ff

New results on modular Golomb rulers, optical orthogonal codes and related structures

2020· preprint· en· W3039500359 on OpenAlexafffund
Marco Buratti, Douglas R. Stinson

Bibliographic record

VenueArs Mathematica Contemporanea · 2020
Typepreprint
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsGolomb codingModular designMathematicsCombinatoricsOrder (exchange)Discrete mathematicsComputer scienceImage (mathematics)Programming languageBusiness

Abstract

fetched live from OpenAlex

We prove new existence and nonexistence results for modular Golomb rulers in this paper. We completely determine which modular Golomb rulers of order k exist, for all k ≤ 11, and we present a general existence result that holds for all k ≥ 3. We also derive new nonexistence results for infinite classes of modular Golomb rulers and related structures such as difference packings, optical orthogonal codes, cyclic Steiner systems and relative difference families.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.005
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.021
GPT teacher head0.223
Teacher spread0.202 · 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
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueArs Mathematica ContemporaneaSame topicgraph theory and CDMA systemsFrench-language works237,207