{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; Vertex (graph 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":[],"consensus_categories":[],"category_scores_codex":[0.0006579754,0.0001480384,0.0001673289,0.0001459467,0.000153335,0.0001142262,0.0005412697,0.00005532823,0.00002462375],"category_scores_gemma":[0.0006101833,0.0001227106,0.000127666,0.0003692045,0.0000675415,0.000266123,0.00005161894,0.0001081881,0.00007020352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000344572,"about_ca_system_score_gemma":0.00002617891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.8424e-7,"about_ca_topic_score_gemma":7.070531e-7,"domain_scores_codex":[0.9987423,0.00006742636,0.0002233092,0.0002871295,0.0003433234,0.0003365218],"domain_scores_gemma":[0.9984438,0.0006417676,0.00009340894,0.0006349506,0.00009681548,0.00008923708],"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.000005657465,0.00005425029,0.00001274507,0.00004375494,0.00001189231,0.000001218444,0.0006772921,0.00005194916,0.000192148,0.9974564,0.0003302915,0.001162391],"study_design_scores_gemma":[0.0004219987,0.0000921852,0.00001009836,0.00003036945,0.000004718497,0.000006084786,0.0001500139,0.01397314,0.004640451,0.9794803,0.001028862,0.0001618201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01308743,0.00001771447,0.9692879,0.0002272649,0.0001436174,0.0005259062,0.000006038517,0.0001024984,0.01660165],"genre_scores_gemma":[0.4783355,0.000008121955,0.519796,0.0001868925,0.0000131457,0.0001618399,0.000006151132,0.00003464009,0.001457641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4652481,"threshold_uncertainty_score":0.5003995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02098316730681271,"score_gpt":0.3109859675149543,"score_spread":0.2900028002081416,"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."}}