MétaCan
Menu
Back to cohort
Record W2127378345

Reductions for the stable set problem

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

VenueAlgorithmic operations research · 2011
Typearticle
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsnot available
Fundersnot available
KeywordsIndependent setCliqueMathematicsCombinatoricsGraphBenchmark (surveying)Set (abstract data type)Reduction (mathematics)Clique problemDiscrete mathematicsMathematical optimizationComputer sciencePathwidthLine graph
DOInot available

Abstract

fetched live from OpenAlex

One approach to finding a maximum stable set (MSS) in a graph isto try to reduce the size of the problem by transforming the problem into an equivalent problem on a sma ller graph. This paper introduces several new reductions for the MSS problem, extends several well-known reductionsto the maximum weight stable set (MWSS) problem, demonstrates how reductions for the generalized stable setproblem can be used in conjunction with probing to produce powerful new reductions for both the MSS and MWSS problems, a nd shows how hypergraphs can be used to expand the capabilities of clique projections. The effectivenessof these new reduction techniques are illustrated on the DIM ACS benchmark graphs, planar graphs, and a set of challenging MS S problems arising from Steiner Triple Systems.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.815
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0030.000
Scholarly communication0.0000.001
Open science0.0020.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.283
GPT teacher head0.395
Teacher spread0.111 · 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