{"id":"W2400938207","doi":"","title":"Sharp Bounds for Spectral Radius of Graphs Presented by K-Neighbour of the Vertices","year":2016,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Spectral radius; Mathematics; Eigenvalues and eigenvectors; Integer (computer science); Graph; Upper and lower bounds; Sequence (biology); RADIUS; Connectivity; Simple (philosophy); Discrete mathematics; Simple graph; Physics; Mathematical analysis; Computer science; Quantum mechanics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00244495,0.000343985,0.0005079071,0.0005485773,0.0005033636,0.00013755,0.006549022,0.00008099037,0.00001030886],"category_scores_gemma":[0.001149761,0.0001768369,0.0002035747,0.006552659,0.005738704,0.00996839,0.0006180391,0.0003185359,0.000001105052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001697898,"about_ca_system_score_gemma":0.000339643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005763585,"about_ca_topic_score_gemma":0.0003146328,"domain_scores_codex":[0.9953222,0.0001602266,0.000871955,0.001137022,0.001362054,0.0011466],"domain_scores_gemma":[0.9971167,0.001274325,0.0006442309,0.0006213236,0.0002251649,0.000118196],"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.0002164022,0.0002672538,0.02804373,0.0001822122,0.00001124082,0.000004296081,0.0006129916,0.000948333,0.1055062,0.5437067,0.0001194096,0.3203812],"study_design_scores_gemma":[0.002942277,0.0007586455,0.01269976,0.001093677,0.0000136144,0.00003453189,0.000442105,0.02613934,0.3700501,0.5660722,0.01861068,0.001143037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7430782,0.2260266,0.006600458,0.004730648,0.01331116,0.002235225,0.00009573586,0.0001598726,0.003762128],"genre_scores_gemma":[0.9851019,0.002697664,0.01185944,0.0001030133,0.00005414507,0.00003462331,6.621226e-7,0.000006720687,0.0001417733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3192382,"threshold_uncertainty_score":0.998826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005616565907139849,"score_gpt":0.2820546128543018,"score_spread":0.276438046947162,"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."}}