{"id":"W4399973719","doi":"10.1002/jgt.23146","title":"Attainable bounds for algebraic connectivity and maximally connected regular graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Algebraic connectivity; Discrete mathematics; Graph; Line graph","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.003343731,0.0001642704,0.0003378969,0.0005344336,0.0002090422,0.0005206658,0.0004174705,0.000100072,0.00001375348],"category_scores_gemma":[0.0001518662,0.0001274815,0.0003156213,0.0005612532,0.0001101408,0.0007662627,0.0000658679,0.000250902,0.000002028527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004188314,"about_ca_system_score_gemma":0.0001085166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005079497,"about_ca_topic_score_gemma":0.000005572169,"domain_scores_codex":[0.9984784,0.0002830749,0.0004685566,0.0002657869,0.0002195407,0.0002846614],"domain_scores_gemma":[0.9981707,0.0008896822,0.000218957,0.000248375,0.000347109,0.0001252166],"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.00008570901,0.00002962133,0.00008433945,0.00009857894,0.000201851,0.00006882261,0.0005363394,0.00003336001,0.001124118,0.9857531,0.00360164,0.008382478],"study_design_scores_gemma":[0.0005783875,0.0007160833,0.0005088208,0.0002607142,0.00004258433,0.001239472,0.0002487758,0.00970914,0.0005404827,0.9672081,0.01874003,0.0002073865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2418332,0.005845186,0.7477044,0.0008819162,0.002676588,0.0002169995,0.000003537928,0.00009855469,0.0007396204],"genre_scores_gemma":[0.9968006,0.0001152528,0.002171945,0.0002169985,0.0002400918,0.0000102366,5.126277e-7,0.00001789869,0.0004264419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7549675,"threshold_uncertainty_score":0.5198545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008902518721699832,"score_gpt":0.2363002819773129,"score_spread":0.2273977632556131,"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."}}