{"id":"W2942306438","doi":"10.2298/yjor181115010d","title":"Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices","year":2019,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Topological index; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","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.001536803,0.0001021542,0.0002851822,0.0002938284,0.0002587752,0.00008077214,0.0002211706,0.00006298052,0.0002510565],"category_scores_gemma":[0.000699466,0.00007259283,0.00006934404,0.0006761345,0.0001807496,0.000284544,0.00004624746,0.0003040512,0.000007557465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337003,"about_ca_system_score_gemma":0.0002390182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002130978,"about_ca_topic_score_gemma":0.00008390371,"domain_scores_codex":[0.9985275,0.0002411462,0.0004015041,0.0001538677,0.000439656,0.0002363534],"domain_scores_gemma":[0.9963979,0.001499738,0.0001160451,0.0002572581,0.001626838,0.0001022927],"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.001394342,0.001573376,0.09429205,0.0004911573,0.0005411417,0.00000892896,0.002771732,0.000642795,0.0328326,0.86206,0.002241756,0.001150131],"study_design_scores_gemma":[0.02213805,0.005131331,0.05781159,0.00107407,0.0005681451,0.001030726,0.01599294,0.02785638,0.07208394,0.7908683,0.00420714,0.001237317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9944417,0.00006482809,0.003604439,0.0005773423,0.00003540944,0.0006986178,0.00002454056,0.000005279002,0.0005478493],"genre_scores_gemma":[0.9905781,0.00004658113,0.008778801,0.0000108157,0.00002712129,0.00003992187,0.000002591536,0.0000167886,0.0004992881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07119162,"threshold_uncertainty_score":0.2960249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06781829762024214,"score_gpt":0.408242393577595,"score_spread":0.3404240959573528,"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."}}