{"id":"W2144008971","doi":"10.1016/j.laa.2014.12.023","title":"Maximizing algebraic connectivity for certain families of graphs","year":2015,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Algebraic connectivity; Mathematics; Bounded function; Algebraic number; Upper and lower bounds; Graph; Girth (graph theory); Discrete mathematics; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006296278,0.0003300124,0.0005913549,0.000206126,0.0002429967,0.00003404868,0.0003991512,0.0003296182,0.00001649346],"category_scores_gemma":[0.0003308671,0.0003241709,0.0002291041,0.0002921828,0.0001663897,0.00006440133,0.0003209862,0.0003427454,0.00000794619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002101449,"about_ca_system_score_gemma":0.0001210712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001516896,"about_ca_topic_score_gemma":0.00001933181,"domain_scores_codex":[0.9983286,0.0000722499,0.0005824696,0.0005820853,0.0001741201,0.0002604364],"domain_scores_gemma":[0.9970886,0.001060449,0.0004573749,0.0007900333,0.0004523496,0.0001512429],"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.00001837086,0.0002107842,0.00004153692,0.0007383982,0.0001115643,7.46174e-8,0.0004627573,0.00001897449,0.0008795033,0.9946319,0.0008640992,0.002022002],"study_design_scores_gemma":[0.0003679052,0.00003745122,0.00007063147,0.00007093724,0.0002358145,0.000002881315,0.0003936956,0.001761148,0.003339527,0.986236,0.007164841,0.0003191818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8758987,0.002277406,0.1070778,0.001207759,0.0001490057,0.007406359,0.002301633,0.0004124021,0.003268998],"genre_scores_gemma":[0.9702621,0.0003315988,0.02389913,0.00007270026,0.0001659087,0.004563446,0.0003267797,0.00007547869,0.0003029084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09436337,"threshold_uncertainty_score":0.999921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06927525957269225,"score_gpt":0.3334229529567652,"score_spread":0.264147693384073,"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."}}