{"id":"W2757888206","doi":"","title":"An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Upper and lower bounds; Laplace operator; Laplacian matrix; Combinatorics; Graph; Algebraic connectivity; Mathematical analysis; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995588,0.003053253,0.002378479,0.003257047,0.003369021,0.006138415,0.006176249,0.004092001,0.03291935],"category_scores_gemma":[0.04233587,0.001157321,0.001619398,0.00324183,0.004312642,0.01178358,0.007027087,0.01235298,0.00879603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002761772,"about_ca_system_score_gemma":0.001782761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001232784,"about_ca_topic_score_gemma":0.002327129,"domain_scores_codex":[0.9951504,0.001013369,0.0001607248,0.001138497,0.001589283,0.0009477184],"domain_scores_gemma":[0.9612833,0.03099266,0.000915123,0.003334885,0.001625197,0.001848782],"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.0005490219,0.0003246274,0.001069459,0.0007316014,0.000100529,0.0004308359,0.0004240312,0.01311986,0.00879535,0.8685738,0.06312139,0.04275946],"study_design_scores_gemma":[0.00003913125,0.0000490565,0.0005607391,0.0001142058,0.00005799583,0.0003176197,0.0001052095,0.04963351,0.002201007,0.9331867,0.01368618,0.00004872239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07110881,0.01358171,0.5438109,0.02639584,0.005335739,0.0002110708,0.003651826,0.002833441,0.3330707],"genre_scores_gemma":[0.7287698,0.008707051,0.1810215,0.007403969,0.007057772,0.001069505,0.003488071,0.002471994,0.06001034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03291935,"threshold_uncertainty_score":0.1101262,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04642426429592865,"score_gpt":0.3414037613806816,"score_spread":0.2949794970847529,"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."}}