{"id":"W4406164283","doi":"10.61091/ars161-14","title":"Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; World Wide Web; 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.0002324519,0.0001125072,0.0001771637,0.00005682143,0.00008415491,0.00004590386,0.0001282632,0.00006803429,0.0001074432],"category_scores_gemma":[0.00005672358,0.00009144465,0.00008610446,0.0002436328,0.00007044696,0.0001172471,0.00001798505,0.00007814217,0.00001837041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002113683,"about_ca_system_score_gemma":0.00003032703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004443045,"about_ca_topic_score_gemma":0.00001847586,"domain_scores_codex":[0.9993237,0.00002608994,0.000202916,0.0001796424,0.000136941,0.0001306706],"domain_scores_gemma":[0.9990548,0.0005072991,0.00006960018,0.0002488465,0.00008350606,0.00003597756],"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.00009925876,0.0001814405,0.000510337,0.0001331399,0.00007603585,0.000001488531,0.0003378907,7.491429e-7,0.0005421157,0.9915851,0.006278411,0.000254059],"study_design_scores_gemma":[0.001139808,0.00008929079,0.0007200859,0.000101638,0.0000826429,0.000004127127,0.00007151841,0.0002431105,0.002795207,0.9905578,0.004076881,0.0001179182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9941011,0.00004850993,0.001017933,0.0001418993,0.0003820653,0.0005189144,0.00002597515,0.0000965215,0.003667047],"genre_scores_gemma":[0.9975557,0.000002388688,0.0007037506,0.00001120613,0.00001017187,0.0001935528,0.00001638122,0.00002874084,0.001478127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003454547,"threshold_uncertainty_score":0.3729005,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0166864418785973,"score_gpt":0.2918168312654158,"score_spread":0.2751303893868185,"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."}}