MétaCan
Menu
Back to cohort
Record W116145823

Generalizations of Interval Graphs

2009· article· en· W116145823 on OpenAlex
Pavol Hell

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.

Bibliographic record

VenueCanadian Conference on Computational Geometry · 2009
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsInterval graphInterval (graph theory)Computer scienceContext (archaeology)Graph theoryConstraint satisfactionConstraint satisfaction problemTheoretical computer scienceDiscrete mathematicsIndifference graphConstraint (computer-aided design)Chordal graphGraphMathematicsCombinatoricsAlgorithmArtificial intelligence1-planar graphProbabilistic logic
DOInot available

Abstract

fetched live from OpenAlex

Interval graphs arose in the nineteen fties and have become a staple of graph theory, both for their appealing applications and for their rich mathematical structure yielding elegant characterizations and ecient algorithms. Recently, interval graphs have naturally appeared in the context of constraint satisfaction problems. Progress in understanding what structures make CSP’s tractable suggests generalizations and analogues of interval graphs. I will discuss obstruction characterizations and recognition algorithms for these generalizations. Applications to the CSP dichotomy problem will also be mentioned. This is joint work with Tom as Feder, Jing Huang, and Arash Raey.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.953
Threshold uncertainty score0.466

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.024
GPT teacher head0.252
Teacher spread0.227 · 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