{"id":"W1985281184","doi":"10.1016/j.dam.2009.04.004","title":"Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set","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.004006356,0.0009734886,0.002056172,0.002423427,0.001823667,0.002720416,0.004074036,0.001469245,0.01288119],"category_scores_gemma":[0.03111024,0.0008899999,0.00160311,0.003073001,0.003100084,0.008914644,0.003504256,0.005962516,0.001344748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002537039,"about_ca_system_score_gemma":0.001331937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731117,"about_ca_topic_score_gemma":0.005266837,"domain_scores_codex":[0.9974413,0.0008080887,0.00008729639,0.000519461,0.0006953443,0.0004485637],"domain_scores_gemma":[0.9719928,0.02304759,0.0008616303,0.002078257,0.001093738,0.0009260575],"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.0006740672,0.0003327773,0.004759823,0.0006209685,0.0001803502,0.0001749052,0.0005039056,0.1389217,0.003550962,0.7267253,0.0242372,0.09931807],"study_design_scores_gemma":[0.00004934652,0.00007895251,0.001285212,0.0001113583,0.00008507568,0.00009541972,0.00006772521,0.2772518,0.00194677,0.7144741,0.004522896,0.00003128729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147588,0.006768051,0.7775551,0.006586763,0.0004273811,0.0002440278,0.001513701,0.0009671075,0.09117917],"genre_scores_gemma":[0.7970544,0.003248458,0.1751013,0.001673477,0.0007315153,0.0004890886,0.001735666,0.0008090229,0.01915709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01288119,"threshold_uncertainty_score":0.04309189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02630681998353096,"score_gpt":0.3173461085731462,"score_spread":0.2910392885896152,"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."}}