{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003014858,0.0003426939,0.0004193665,0.0007502013,0.0004981557,0.0007878811,0.003413084,0.00008935851,0.0001084516],"category_scores_gemma":[0.0003273682,0.0002610083,0.0001132641,0.003393245,0.002160603,0.002078325,0.001576605,0.0004921279,0.00006913336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001814026,"about_ca_system_score_gemma":0.0001950275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003024956,"about_ca_topic_score_gemma":0.000009671202,"domain_scores_codex":[0.9954801,0.0001719444,0.0006459124,0.001037696,0.001349954,0.001314436],"domain_scores_gemma":[0.9972615,0.0006643186,0.0001596554,0.001344171,0.0001806709,0.0003896987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000171562,0.0000840511,0.00006300721,0.0000345674,0.000006085666,0.00002115388,0.002299564,0.00133962,0.0005806367,0.9873161,0.0000152961,0.008222724],"study_design_scores_gemma":[0.0002923433,0.0001103659,0.00009950155,0.00009059857,0.000003286073,0.00006029878,0.0001451764,0.5864061,0.001679536,0.4108143,0.00003917324,0.000259324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05756335,0.00002955466,0.9386707,0.0005835061,0.0002044565,0.0004115769,0.000005430488,0.000197975,0.002333455],"genre_scores_gemma":[0.5754905,0.000005815762,0.4243001,0.00007988199,0.00005417176,0.00002192427,9.298382e-7,0.00001426331,0.0000323761],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5850664,"threshold_uncertainty_score":0.9999842,"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."}}