MétaCan
Menu
Back to cohort
Record W2032200582 · doi:10.1155/2010/851857

Classification of Base Sequences BS(<i>n</i> + 1,<i>n</i>)

2010· article· en· W2032200582 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Combinatorics · 2010
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaCompute Canada
KeywordsMathematicsConjectureCombinatoricsBase (topology)Hadamard transformEquivalence (formal languages)Equivalence relationMonotonic functionSequence (biology)Discrete mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

Base sequences BS( n + 1, n ) are quadruples of {±1}‐sequences ( A ; B ; C ; D ), with A and B of length n + 1 and C and D of length n , such that the sum of their nonperiodic autocor‐relation functions is a δ ‐function. The base sequence conjecture, asserting that BS( n + 1, n ) exist for all n , is stronger than the famous Hadamard matrix conjecture. We introduce a new definition of equivalence for base sequences BS( n + 1, n ) and construct a canonical form. By using this canonical form, we have enumerated the equivalence classes of BS( n + 1, n ) for n ≤ 30. As the number of equivalence classes grows rapidly (but not monotonically) with n , the tables in the paper cover only the cases n ≤ 13.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.076
Threshold uncertainty score0.296

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.009
GPT teacher head0.230
Teacher spread0.221 · 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