{"id":"W1732011848","doi":"10.46298/dmtcs.3411","title":"Finding a Strong Stable Set or a Meyniel Obstruction in any Graph","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Rogers Communications (Canada); Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Chord (peer-to-peer); Clique; Independent set; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152606,0.0006679358,0.0007237376,0.0007920574,0.001469714,0.001251816,0.0009646235,0.00106363,0.00710075],"category_scores_gemma":[0.003018889,0.0004063906,0.001099344,0.000664655,0.00103543,0.00330042,0.002951041,0.001070677,0.00106548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007499802,"about_ca_system_score_gemma":0.00111573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001550338,"about_ca_topic_score_gemma":0.003293884,"domain_scores_codex":[0.9995272,0.00006464211,0.00003458255,0.0001506835,0.00009669084,0.000126228],"domain_scores_gemma":[0.9988993,0.0005450043,0.000115141,0.0001744224,0.00009278056,0.0001733113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003337451,0.0008628903,0.02295282,0.001689726,0.0003330634,0.00226018,0.003824821,0.06015389,0.1388747,0.4036867,0.02264842,0.3393755],"study_design_scores_gemma":[0.0003985327,0.001212438,0.009572414,0.0001791702,0.000270837,0.001290526,0.002179902,0.2177484,0.07052233,0.6497629,0.04668615,0.0001764174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6000346,0.0002748197,0.3782151,0.001861256,0.00009242895,0.0004522951,0.001043182,0.001664368,0.01636197],"genre_scores_gemma":[0.7722263,0.0001826766,0.2171512,0.0002528249,0.0000398529,0.0001962298,0.001494529,0.0002676786,0.008188788],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00710075,"threshold_uncertainty_score":0.02375442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03194635860705702,"score_gpt":0.3199068939822031,"score_spread":0.287960535375146,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}