MétaCan
Menu
Back to cohort
Record W2081479998 · doi:10.1002/jcd.10059

Covering arrays with mixed alphabet sizes

2003· article· en· W2081479998 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.

Bibliographic record

VenueJournal of Combinatorial Designs · 2003
Typearticle
Languageen
FieldComputer Science
TopicVLSI and Analog Circuit Testing
Canadian institutionsCarleton UniversityStatistics CanadaUniversity of Ottawa
Fundersnot available
KeywordsAlphabetCombinatoricsRowMathematicsType (biology)Column (typography)Row and column spacesGeometryComputer scienceConnection (principal bundle)

Abstract

fetched live from OpenAlex

Abstract Covering arrays with mixed alphabet sizes, or simply mixed covering arrays , are natural generalizations of covering arrays that are motivated by applications in software and network testing. A (mixed) covering array A of type $\prod _{i=1}^{k}g_i$ is a k × N array with the cells of row i filled with elements from ℤ and having the property that for every two rows i and j and every ordered pair of elements (e,f) ∈ ℤ × ℤ , there exists at least one column c , 1 ≤ c ≤ N , such that A i,c = e and A j,c = f . The (mixed) covering array number, denoted by $ca(\prod _{i=1}^{k}g_i)$ , is the minimum N for which a covering array of type $\prod _{i=1}^{k}g_i$ with N columns exists. In this paper, several constructions for mixed covering arrays are presented, and the mixed covering array numbers are determined for nearly all cases with k = 4 and for a number of cases with k = 5. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 413–432, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10059

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.891
Threshold uncertainty score0.466

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.231
Teacher spread0.206 · 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