{"id":"W2399055054","doi":"","title":"An upper bound on the restrained domination number of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Upper and lower bounds; Graph; 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.001693322,0.00108969,0.001360674,0.002417067,0.001981884,0.002773679,0.004086903,0.001616672,0.01455071],"category_scores_gemma":[0.01704531,0.0007110701,0.001047233,0.002550239,0.002426113,0.006222595,0.002826779,0.00386644,0.002690037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001884455,"about_ca_system_score_gemma":0.0009042378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001063287,"about_ca_topic_score_gemma":0.002192759,"domain_scores_codex":[0.9975963,0.0004077549,0.0001063618,0.000579637,0.0007746828,0.0005352925],"domain_scores_gemma":[0.9805766,0.01267611,0.0008360075,0.003807215,0.0009883157,0.0011158],"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.001170439,0.0004432408,0.005537438,0.001247958,0.0002374499,0.0007552229,0.0009366389,0.07472691,0.03172303,0.6882745,0.04575727,0.1491898],"study_design_scores_gemma":[0.00007338489,0.0001440228,0.003949733,0.0001871527,0.000170953,0.001222029,0.0001608693,0.1178657,0.0126107,0.8306389,0.03288482,0.00009182021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3402816,0.008746412,0.3411715,0.006060714,0.001154069,0.0003032189,0.004978662,0.003266642,0.2940373],"genre_scores_gemma":[0.9027503,0.002790534,0.06620387,0.001098791,0.0006125811,0.0003259931,0.002034046,0.0005331674,0.02365066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01455071,"threshold_uncertainty_score":0.04867697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01561291342279799,"score_gpt":0.3068283093369223,"score_spread":0.2912153959141244,"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."}}