MétaCan
Menu
Back to cohort
Record W59737862

Coloring Of Meet-Semilattices.

2007· article· en· W59737862 on OpenAlex
S. K. Nimbhokar, Meenakshi Wasadikar, Lisa Ann Vermeire DeMeyer

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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueArs Combinatoria · 2007
Typearticle
Languageen
FieldMathematics
TopicRings, Modules, and Algebras
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsCombinatoricsSemigroupCommutative propertyEulerian pathDiscrete mathematicsGraphSimple graphSimple (philosophy)Graph homomorphismPure mathematicsGraph powerLine graph
DOInot available

Abstract

fetched live from OpenAlex

Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices are labeled with the nonzero elements in S. Two vertices in Γ(S) are adjacent if and only if the corresponding elements multiply to 0. The inverse problem, i.e., given an arbitrary simple graph, whether or not it can be associated to some commutative semigroup, has proved to be a difficult one. In this paper, we extend results by DeMeyer[3], McKenzie, and Schneider[4] on this problem by studying the complement of graphs. As an application and an extension of work in [3] we prove that every compact connected 2-manifold admits an Eulerian triangulation that can be associated to a zero divisor semigroup graph.

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: Empirical
Teacher disagreement score0.043
Threshold uncertainty score0.546

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.033
GPT teacher head0.289
Teacher spread0.256 · 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