{"id":"W2024330321","doi":"10.1016/j.jctb.2004.06.001","title":"A lower bound on the spectral radius of the universal cover of a graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Spectral radius; Graph; Degree (music); Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics; Quantum mechanics","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.001307671,0.0001275676,0.0002964502,0.0000721392,0.0001452561,0.00001737868,0.0005722527,0.0000672266,0.0002842048],"category_scores_gemma":[0.0003694394,0.00006963623,0.000365166,0.0002913086,0.0005252659,0.0001646166,0.00004640635,0.0003150927,0.000002719194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003561595,"about_ca_system_score_gemma":0.0000982275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.784949e-7,"about_ca_topic_score_gemma":9.790239e-7,"domain_scores_codex":[0.9986063,0.0003554903,0.0004843819,0.00007000889,0.0003473977,0.0001364682],"domain_scores_gemma":[0.9975052,0.001091524,0.0007704846,0.0003977752,0.0001915591,0.00004346361],"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.001229009,0.000378165,0.00002696729,0.00001229552,0.0001376134,0.000001646497,0.0008234981,0.00002293218,0.002257435,0.9931049,0.00194982,0.00005574186],"study_design_scores_gemma":[0.0008131483,0.0003937801,0.0001069618,0.00006812045,0.000100781,0.00002911104,0.0005279236,0.000001400158,0.03166702,0.9570611,0.009161448,0.00006922066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889774,0.00005431111,0.00009953355,0.00126891,0.00128979,0.0001897911,0.00001171223,0.000006882119,0.008101637],"genre_scores_gemma":[0.9989889,0.00002016338,0.0001389574,0.00006226011,0.0002908515,0.000001679857,1.271223e-7,0.00001378516,0.000483289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03604379,"threshold_uncertainty_score":0.3111843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405184898505722,"score_gpt":0.2471553759324702,"score_spread":0.233103526947413,"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."}}