{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108661,0.0007220852,0.001335497,0.003101423,0.001635692,0.003173939,0.001777818,0.001198862,0.006067576],"category_scores_gemma":[0.008584617,0.0004745735,0.0006115148,0.001466032,0.002171518,0.003994345,0.002045028,0.002689728,0.0008648369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001614413,"about_ca_system_score_gemma":0.0005579288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005465218,"about_ca_topic_score_gemma":0.00102289,"domain_scores_codex":[0.9989435,0.0001992795,0.00003999527,0.0002414817,0.0002635698,0.0003121655],"domain_scores_gemma":[0.9953784,0.002729476,0.0004084524,0.0005103605,0.0003928932,0.0005805168],"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.0003048558,0.00006880893,0.003307729,0.0002661131,0.00004820848,0.0003139384,0.0004065795,0.02030021,0.01076009,0.9420257,0.0065116,0.01568617],"study_design_scores_gemma":[0.00003619242,0.00006400859,0.002076056,0.0001090076,0.00004904518,0.000544622,0.0001565018,0.07583228,0.004536803,0.9090172,0.007512315,0.0000658642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5771528,0.008361042,0.2298561,0.002475924,0.0003288722,0.0001083626,0.001359007,0.0008708402,0.179487],"genre_scores_gemma":[0.964931,0.001465467,0.02542415,0.0003318128,0.0002520185,0.0001077421,0.0005972654,0.0002049739,0.006685636],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006067576,"threshold_uncertainty_score":0.02029806,"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."}}