{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150376,0.001748066,0.001627995,0.0045734,0.002280244,0.004303058,0.002750077,0.002101639,0.01780188],"category_scores_gemma":[0.03770152,0.0008702526,0.00162025,0.003756497,0.003700102,0.008593144,0.003360182,0.003989861,0.002478618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003106253,"about_ca_system_score_gemma":0.001348034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001214874,"about_ca_topic_score_gemma":0.001794646,"domain_scores_codex":[0.9950703,0.001511976,0.0002576594,0.0009756484,0.001401843,0.000782593],"domain_scores_gemma":[0.939469,0.04439363,0.00500287,0.004065424,0.00361377,0.003455322],"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.0009792055,0.000241439,0.007274523,0.0009697384,0.0002084835,0.0004425772,0.0005127155,0.08584204,0.003797424,0.8011308,0.02199519,0.076606],"study_design_scores_gemma":[0.00007435466,0.0001529612,0.002220539,0.0001294206,0.00006481692,0.0004290069,0.0001098722,0.1460076,0.001757827,0.838173,0.01081945,0.00006112742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2074706,0.004832525,0.6805803,0.008743081,0.0009720197,0.0003999553,0.007586891,0.001735157,0.08767957],"genre_scores_gemma":[0.8419306,0.003607699,0.1286738,0.001495486,0.001152207,0.001072381,0.004673443,0.0005141832,0.01688023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01780188,"threshold_uncertainty_score":0.05955321,"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."}}