{"id":"W2396457618","doi":"","title":"Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science; World Wide Web","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.0003883984,0.000180761,0.0002285854,0.0001059332,0.0002061422,0.00003463648,0.0002950065,0.0000764806,0.00006240118],"category_scores_gemma":[0.00008288951,0.000141648,0.00007179785,0.0003410655,0.0001102772,0.00007286404,0.00003556927,0.0002168739,0.0001166443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001958063,"about_ca_system_score_gemma":0.00001804645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009450035,"about_ca_topic_score_gemma":0.000008887413,"domain_scores_codex":[0.9989126,0.0001177179,0.0002028049,0.0002642215,0.0002419774,0.0002607],"domain_scores_gemma":[0.99861,0.0004654676,0.0001145712,0.0006489357,0.00004750411,0.0001135303],"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.00005998323,0.0002588948,0.001471304,0.00001856198,0.00003723749,0.000002211541,0.0001281631,0.000001906071,0.0001046114,0.9962799,0.0007335687,0.0009036579],"study_design_scores_gemma":[0.001859197,0.0002072771,0.001820449,0.00004832185,0.00004992031,0.000005544297,0.00004397558,0.0001311293,0.001073749,0.9919329,0.002629999,0.0001975418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842194,0.00001487602,0.0002474763,0.0002287009,0.0002399916,0.0002869949,0.000002621164,0.0001529133,0.01460696],"genre_scores_gemma":[0.999279,0.000006398669,0.000232239,0.0001743279,0.00000584705,0.00006842933,0.000004767357,0.0000341104,0.0001948911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01505953,"threshold_uncertainty_score":0.5776239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01606416461617273,"score_gpt":0.2593470751456666,"score_spread":0.2432829105294939,"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."}}