MétaCan
Menu
Back to cohort
Record W12813696 · doi:10.25596/jalc-2002-083

Maximal and Minimal Partial Clones

2002· article· en· W12813696 on OpenAlexaff
Lucien Haddad, Hajime Machida, Ivo G. Rosenberg

Bibliographic record

VenueJustus-Liebig-Universität Gießen · 2002
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Algebra and Logic
Canadian institutionsUniversité de MontréalRoyal Military College of Canada
Fundersnot available
KeywordsCardinality (data modeling)Intersection (aeronautics)CombinatoricsMathematicsSet (abstract data type)Partial functionclone (Java method)Element (criminal law)Discrete mathematicsComputer scienceBiologyGeneticsGene

Abstract

fetched live from OpenAlex

The following two problems are addressed in this paper. Let $k \geq 2$, $\k$ be a $k$-element set and $M$ be a family of maximal partial clones with trivial intersection over $k$. What is the smallest possible cardinality of $M$? Dually, if $F$ is a family of minimal partial clones whose join is the set of all partial functions on $k$, then what is the smallest possible cardinality of $F$? We show that the answer to these two problems is three.

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.003
metaresearch head score (Gemma)0.013
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: Methods · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.013
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0030.004
Scholarly communication0.0030.010
Open science0.0010.004
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.021
GPT teacher head0.201
Teacher spread0.179 · 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
GenreMethods

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

Citations4
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueJustus-Liebig-Universität GießenSame topicAdvanced Algebra and LogicFrench-language works237,207