{"id":"W9394027","doi":"","title":"Upper bounds on signed 2-independence number of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Independence (probability theory); Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Statistics; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419157,0.0001657646,0.0002115144,0.0001142615,0.0001290846,0.00006629666,0.0005895264,0.0001101275,0.00005352951],"category_scores_gemma":[0.0001052217,0.0001514493,0.0001077889,0.0006743699,0.00008281592,0.0002222107,0.00007658252,0.00018094,0.0001784213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001807922,"about_ca_system_score_gemma":0.0000834624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002791361,"about_ca_topic_score_gemma":6.931051e-7,"domain_scores_codex":[0.9983376,0.0001283192,0.0002874695,0.0004041317,0.0005310521,0.0003113787],"domain_scores_gemma":[0.998661,0.0001254084,0.000123517,0.0007833368,0.0001852672,0.0001214891],"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.000003935077,0.0001745508,0.005614333,0.000006860008,0.00001411907,0.000006623892,0.0001325121,0.000007576827,0.001035974,0.9915736,0.001174107,0.0002558043],"study_design_scores_gemma":[0.0006706875,0.0001343293,0.0006363449,0.00003214307,0.00000527768,0.00001352844,0.00001096221,0.0001672701,0.01614042,0.9815469,0.0004588186,0.0001833533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9752413,0.00010531,0.0004286149,0.0001597968,0.002467086,0.0001272855,9.154899e-7,0.0001576979,0.02131201],"genre_scores_gemma":[0.9957,0.000007735077,0.003694416,0.000268746,3.661065e-7,0.000008596868,7.138023e-7,0.0000115517,0.0003078559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02100416,"threshold_uncertainty_score":0.6175925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01029402088109238,"score_gpt":0.240046454650999,"score_spread":0.2297524337699066,"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."}}