MétaCan
Menu
Back to cohort
Record W7104560208 · doi:10.1145/3747199.3747549

On properties of Legendre pairs under compression

2025· article· W7104560208 on OpenAlexaff

Bibliographic record

Venuenot available
Typearticle
Language
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsWilfrid Laurier University
FundersAgencia Estatal de InvestigaciónEuropean Regional Development Fund
KeywordsHadamard transformComplex Hadamard matrixHadamard matrixHadamard's maximal determinant problemMatrix (chemical analysis)Algebraic numberLegendre polynomialsTranspose

Abstract

fetched live from OpenAlex

Hadamard matrices are n × n matrices with elements in {1, -1} for which the inverse of the matrix is the transpose scaled by 1/n. The most important conjecture in the theory of Hadamard matrices is their existence when n is a multiple of 4. Although algebraic constructions have been proposed for some specific values, no general constructions exist in the literature, and they are usually found by computational search for a given n. The smallest value for which a Hadamard matrix of order n is not known, is n = 668.

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.002
metaresearch head score (Gemma)0.016
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.007
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.016
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0020.004
Scholarly communication0.0030.006
Open science0.0010.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0070.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.016
GPT teacher head0.205
Teacher spread0.189 · 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
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicgraph theory and CDMA systemsFrench-language works237,207