MétaCan
Menu
Back to cohort
Record W2963986177 · doi:10.55016/ojs/cdm.v6i1.62075

Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem

2011· article· en· W2963986177 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.

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

VenueContributions to Discrete Mathematics · 2011
Typearticle
Languageen
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsnot available
FundersAgence Nationale de la Recherche
KeywordsClawHomogeneousCombinatoricsMathematicsGraphComputer scienceBiology

Abstract

fetched live from OpenAlex

We describe Forb{K1,3,¯¯¯¯¯¯¯¯¯¯K1,3}, the class of graphs G such that G and its complement ¯¯¯¯G are claw-free. With few exceptions, it is made of graphs whose connected components consist of cycles of length at least 4, paths or isolated vertices, and of the complements of these graphs. Considering the hypergraph H(3)(G) made of the 3-element subsets of the vertex set of a graph G on which G induces a clique or an independent subset, we deduce from above a description of the Boolean sum G˙+G′ of two graphs G and G′ giving the same hypergraph. We indicate the role of this latter description in a reconstruction problem of graphs up to complementation.

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.000
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: Methods · Consensus signal: Methods
Teacher disagreement score0.458
Threshold uncertainty score0.551

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.018
GPT teacher head0.259
Teacher spread0.241 · 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