{"id":"W2161640119","doi":"10.13001/1081-3810.1063","title":"An upper bound on algebraic connectivity of graphs with many cutpoints","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Algebraic number; Upper and lower bounds; Combinatorics; Algebraic connectivity; Discrete mathematics; Algebra over a field; Graph; Pure mathematics; Mathematical analysis; Laplacian matrix","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844922,0.001491428,0.00171608,0.004304245,0.002323753,0.004688322,0.00288118,0.001845098,0.01075191],"category_scores_gemma":[0.02814409,0.001195735,0.001005537,0.00554732,0.003942955,0.01087341,0.00434653,0.004575313,0.001237617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001499444,"about_ca_system_score_gemma":0.0005494928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001908133,"about_ca_topic_score_gemma":0.002686294,"domain_scores_codex":[0.9968303,0.0005523264,0.0001318056,0.0009254199,0.0009343714,0.0006257716],"domain_scores_gemma":[0.956413,0.03452881,0.002557704,0.002747222,0.001968699,0.001784593],"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.0007133945,0.0002275554,0.01110528,0.001068519,0.0001909539,0.001158935,0.00145806,0.09128758,0.02028719,0.7734154,0.01423324,0.08485397],"study_design_scores_gemma":[0.00006370877,0.0002219442,0.008794468,0.000262888,0.0001576412,0.001775612,0.0004745891,0.1200063,0.00772742,0.8460277,0.01434662,0.0001410387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4596415,0.008225297,0.3921179,0.006438585,0.0002853622,0.0001836847,0.002839172,0.001321874,0.1289466],"genre_scores_gemma":[0.9441288,0.003591517,0.04558552,0.0004769798,0.0005357892,0.0001908329,0.001515135,0.0002832144,0.003692016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01075191,"threshold_uncertainty_score":0.03596872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01586762715091431,"score_gpt":0.2926576746754576,"score_spread":0.2767900475245433,"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."}}