{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000836154,0.0001501006,0.0001941214,0.00003520194,0.002403955,0.0002768723,0.0009414175,0.0000817173,0.00004719922],"category_scores_gemma":[0.0002399146,0.0001111191,0.00012972,0.00006776024,0.0001999895,0.0002376739,0.00006225922,0.0001426349,0.00004447083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001462284,"about_ca_system_score_gemma":0.00002956659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003722321,"about_ca_topic_score_gemma":0.00004444824,"domain_scores_codex":[0.9990844,0.00006156046,0.0001991084,0.0002302535,0.0001409734,0.0002837727],"domain_scores_gemma":[0.9974136,0.0006592101,0.0001880833,0.001556621,0.0000933769,0.0000890865],"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.00001621053,0.0002224805,0.003294381,0.00001741208,0.00004388893,4.638573e-7,0.0001931787,0.000001172864,0.0002241784,0.9911109,0.004665816,0.0002099266],"study_design_scores_gemma":[0.0006090597,0.00005419122,0.005435133,0.00001181297,0.00006314346,0.00000212205,0.0001250992,0.0001752836,0.001567063,0.9741711,0.01763207,0.0001539497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9921455,0.00006942361,0.0002916438,0.0008050714,0.0009082773,0.0008566534,0.00003096483,0.00009934952,0.004793107],"genre_scores_gemma":[0.9980459,0.00001352811,0.000843066,0.00009794873,0.00002711841,0.0003409006,0.000008692346,0.00003067929,0.0005921999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01693982,"threshold_uncertainty_score":0.9988948,"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."}}