{"id":"W2599299976","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 22. Extending Bounds for Independence to Upper Irredundance","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set; Independence (probability theory)","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.002116353,0.0004924782,0.00108158,0.0019694,0.001519179,0.001889342,0.002008933,0.0008982598,0.005356115],"category_scores_gemma":[0.01334694,0.0006723522,0.0008014304,0.00202493,0.001816061,0.004531408,0.002347894,0.002169073,0.0005874825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00186606,"about_ca_system_score_gemma":0.0007524503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002542222,"about_ca_topic_score_gemma":0.004330928,"domain_scores_codex":[0.9984145,0.0006193708,0.00006881366,0.0003624795,0.000295681,0.0002391237],"domain_scores_gemma":[0.9901572,0.00729074,0.0006259069,0.001142072,0.0003845278,0.0003994786],"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.001047531,0.0002738272,0.01478271,0.0006162095,0.0001951655,0.0002870672,0.000790657,0.1870457,0.005792898,0.6148317,0.01679493,0.1575416],"study_design_scores_gemma":[0.00007001271,0.0001039506,0.002500187,0.00005843825,0.00007754357,0.000158679,0.0001187886,0.432561,0.002975719,0.5548337,0.006511935,0.00003002406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2751871,0.003690662,0.6642089,0.003284696,0.0001855442,0.0002452765,0.001616034,0.001104864,0.05047686],"genre_scores_gemma":[0.8557543,0.0007573796,0.1349896,0.0004244554,0.0002006156,0.0002020219,0.00155809,0.0002530173,0.005860443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005356115,"threshold_uncertainty_score":0.01791793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01918832843579429,"score_gpt":0.2993492857366926,"score_spread":0.2801609573008984,"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."}}