MétaCan
Menu
Back to cohort
Record W2318083694 · doi:10.4153/cjm-2011-087-3

Finitely Related Algebras In CongruenceDistributive Varieties Have Near UnanimityTerms

2011· article· en· W2318083694 on OpenAlexaff
Libor Barto

Bibliographic record

VenueCanadian Journal of Mathematics · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Algebra and Logic
Canadian institutionsMcMaster University
FundersGrantová Agentura České Republiky
KeywordsUnanimityMathematicsDecidabilityCongruence (geometry)Distributive propertyConstraint satisfaction problemEquivalence (formal languages)Variety (cybernetics)Finitely-generated abelian groupBounded functionDiscrete mathematicsPure mathematics

Abstract

fetched live from OpenAlex

Abstract we show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. as a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. this consequence also implies that it is decidable whether a given finite constraint language defines a constraint satisfaction problem of bounded strict width.

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.006
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.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0020.005
Scholarly communication0.0040.012
Open science0.0010.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.033
GPT teacher head0.220
Teacher spread0.187 · 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

Citations50
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Journal of MathematicsSame topicAdvanced Algebra and LogicFrench-language works237,207