{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001463921,0.0003804633,0.0004881213,0.0003487926,0.0005356884,0.0005065907,0.002073122,0.0001537473,0.00002210434],"category_scores_gemma":[0.0001799097,0.0003547009,0.0001813793,0.001114641,0.0000976523,0.0005546413,0.0003430215,0.0002933462,0.0000312983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009752139,"about_ca_system_score_gemma":0.0001504909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001086037,"about_ca_topic_score_gemma":5.27088e-7,"domain_scores_codex":[0.9964605,0.00002453921,0.0005472556,0.0009166108,0.0008198963,0.001231211],"domain_scores_gemma":[0.9972022,0.0007353702,0.0001457642,0.001294554,0.0002748012,0.0003473813],"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.00006913966,0.0001248616,0.000007418028,0.0001604098,0.00002419869,0.000002362764,0.0009657383,0.0003337677,0.01678676,0.969264,0.0002578324,0.01200351],"study_design_scores_gemma":[0.0007313862,0.0002930487,0.0000377529,0.00008406043,0.00001522808,0.00001996947,0.0002725905,0.04678117,0.01216397,0.9382254,0.0009002769,0.0004751843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001777863,0.00007387981,0.9850201,0.0003893056,0.0001351609,0.002441869,0.00004589183,0.0002317871,0.009884124],"genre_scores_gemma":[0.2693484,0.000005191327,0.7291172,0.0002733762,0.00006981444,0.0005953355,0.0000122119,0.00004548756,0.0005329275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2675706,"threshold_uncertainty_score":0.9998905,"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."}}