{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003126322,0.0003276328,0.0003472982,0.0006524402,0.001096395,0.0004158652,0.001956259,0.0002536366,0.00002733395],"category_scores_gemma":[0.0004111764,0.0003354401,0.0002096093,0.00157355,0.0002991103,0.0009899626,0.0003097025,0.0005379761,0.00001803032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003006459,"about_ca_system_score_gemma":0.0002006566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002128945,"about_ca_topic_score_gemma":0.000009299147,"domain_scores_codex":[0.9959893,0.00008835283,0.0004313422,0.001082785,0.0007866541,0.001621558],"domain_scores_gemma":[0.9966512,0.001350821,0.00009463893,0.0009438989,0.0004747287,0.0004847565],"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.0002294498,0.00007271773,0.001305296,0.00006364495,0.00003419103,0.0000240436,0.001091038,0.0001524691,0.006502066,0.9488939,0.0004280985,0.04120307],"study_design_scores_gemma":[0.001816462,0.0007172239,0.002098685,0.00008191805,0.00001555509,0.0001453117,0.0004640048,0.01227099,0.01945021,0.9383253,0.02369267,0.0009216288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02682496,0.0003089115,0.9679646,0.0005861403,0.0006812715,0.001306234,0.00003326332,0.0002114545,0.00208318],"genre_scores_gemma":[0.4498512,0.00001146177,0.5468889,0.0004859577,0.0002078013,0.0002445864,0.000008504916,0.00005267873,0.002248821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4230263,"threshold_uncertainty_score":0.9999098,"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."}}