MétaCan
Menu
Back to cohort

Class-uniformly resolvable designs

2001· article· en· W2086211490 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 · 2001
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsSimon Fraser UniversityToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of CanadaMitacs
KeywordsMathematicsCombinatoricsClass (philosophy)Block (permutation group theory)Block sizeResolution (logic)Discrete mathematicsBlock designComputer scienceKey (lock)

Abstract

fetched live from OpenAlex

We investigate Class-Uniformly Resolvable Designs, which are resolvable designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present two general constructions. We primarily consider the case of block sizes 2 and 3, where we find two infinite extremal families and finish two other infinite families by difference constructions. We present tables showing the current state of knowledge in the case of block size 2 and 3 for all orders up to 200. © 2001 John Wiley & Sons, Inc. J Combin Designs 8: 79–99, 2001

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.393
Threshold uncertainty score0.726

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