{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591586,0.0008836902,0.0009250361,0.002291828,0.000969442,0.001818423,0.001618479,0.00101639,0.004461945],"category_scores_gemma":[0.01603837,0.0004807299,0.0006754948,0.001644641,0.001955218,0.004031674,0.002408453,0.001983888,0.0004577315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001264263,"about_ca_system_score_gemma":0.0004972798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005306058,"about_ca_topic_score_gemma":0.0008398732,"domain_scores_codex":[0.9983425,0.0003220356,0.00006972093,0.0003755964,0.0005381307,0.0003518803],"domain_scores_gemma":[0.9859774,0.01020213,0.0009691514,0.001281477,0.0008040319,0.0007657945],"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.0004111369,0.0002448166,0.005935055,0.0005322052,0.00008660918,0.000476518,0.0007817629,0.1618588,0.0300059,0.7469605,0.004843919,0.04786276],"study_design_scores_gemma":[0.00004085739,0.0002411565,0.003644702,0.0001361237,0.00005852702,0.0007623076,0.0003451902,0.3004687,0.02344866,0.6623619,0.008421648,0.00007019901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6230211,0.002019575,0.3007589,0.001495031,0.000107055,0.00009547091,0.001035524,0.001310149,0.07015718],"genre_scores_gemma":[0.9729734,0.0004479212,0.02502295,0.0001286544,0.00008267272,0.00006603645,0.0003369926,0.00008852941,0.0008527132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004461945,"threshold_uncertainty_score":0.01492667,"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."}}