{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003077395,0.002765128,0.004286811,0.00521004,0.002776747,0.005682581,0.004977392,0.004255264,0.01241196],"category_scores_gemma":[0.03105468,0.001834525,0.002033062,0.003286474,0.004514335,0.01077823,0.006550244,0.005909047,0.0032241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487574,"about_ca_system_score_gemma":0.0007805392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207075,"about_ca_topic_score_gemma":0.001162232,"domain_scores_codex":[0.9954664,0.001200235,0.0001939799,0.001129102,0.001186876,0.0008233495],"domain_scores_gemma":[0.9558459,0.03503313,0.001357261,0.003551955,0.001574316,0.002637475],"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.001678166,0.0003656805,0.005044007,0.00158375,0.0004654068,0.0008650742,0.001323545,0.09056888,0.03990334,0.7497109,0.02958752,0.07890372],"study_design_scores_gemma":[0.00008356717,0.0002880921,0.003836624,0.0003701948,0.000352511,0.001603687,0.0004264969,0.3453203,0.01398761,0.6146762,0.01886476,0.000189821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3948479,0.02400349,0.4102999,0.01088028,0.001347525,0.0001991203,0.002620667,0.003449497,0.1523516],"genre_scores_gemma":[0.9087667,0.007487847,0.06369838,0.00137491,0.002315419,0.0003213394,0.001689067,0.001323361,0.01302287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01241196,"threshold_uncertainty_score":0.04152215,"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."}}