{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019556,0.0001919298,0.0003971185,0.0002309972,0.0001344777,0.00002024278,0.0003439918,0.00008112581,0.0001729111],"category_scores_gemma":[0.00009608793,0.0001438585,0.0001847565,0.0004135931,0.000130701,0.0002198617,0.00001326268,0.0005935917,0.00001230882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006277546,"about_ca_system_score_gemma":0.0002154432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004756239,"about_ca_topic_score_gemma":0.00003035645,"domain_scores_codex":[0.9983739,0.000161359,0.0004934683,0.0001780298,0.0003532453,0.0004400364],"domain_scores_gemma":[0.9983747,0.0003249214,0.0005500627,0.0004086562,0.0002169637,0.0001246794],"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.0004289567,0.0007767447,0.001453963,0.0000170172,0.0002083095,0.00001233523,0.0002418847,0.0000143792,0.003547108,0.9924508,0.0001188532,0.0007296595],"study_design_scores_gemma":[0.001116544,0.002367933,0.001556213,0.00007920119,0.0001304401,0.000499459,0.0001898858,0.00007401551,0.01418439,0.9788792,0.0007403971,0.000182288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9929118,0.0001720525,0.005549201,0.0003200229,0.00003707943,0.0001688143,0.000003611104,0.00002502442,0.0008123657],"genre_scores_gemma":[0.9984138,0.00009517515,0.001115602,0.0001033376,0.0001108014,0.00000494671,0.000001983999,0.000036559,0.0001177639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357156,"threshold_uncertainty_score":0.5866379,"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."}}