MétaCan
Menu
Back to cohort
Record W3202612442 · doi:10.1002/jcd.21806

Legendre pairs of lengths ℓ≡0(mod3)

2021· article· en· W3202612442 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

VenueJournal of Combinatorial Designs · 2021
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsWilfrid Laurier University
FundersNatural Sciences and Engineering Research Council of CanadaAustrian Science Fund
KeywordsLegendre polynomialsMathematicsCombinatoricsInteger (computer science)Legendre transformationLegendre functionMultiplier (economics)Order (exchange)Mathematical analysis

Abstract

fetched live from OpenAlex

Abstract We prove a proposition that connects constant‐periodic autocorrelation function sequences and the corresponding Legendre pairs with integer power spectral density values. We show how to determine explicitly the complete spectrum of the ‐rd value of the discrete Fourier transform for Legendre pairs of lengths . This is accomplished by two new algorithms based on number‐theoretic arguments. As an application, we prove that Legendre pairs of the open lengths 117, 129, 133, and 147 exist by finding Legendre pairs of these lengths with a multiplier group of order at least 3. As a consequence, 85, 87, 115, 145, 159, 161, 169, 175, 177, 185, 187, 195 are the 12 integers in the range for which the question of existence of Legendre pairs remains unsolved.

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.001
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: none
Teacher disagreement score0.749
Threshold uncertainty score0.424

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.024
GPT teacher head0.249
Teacher spread0.225 · 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