{"id":"W2062663701","doi":"10.1016/j.laa.2005.10.017","title":"Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Algebraic connectivity; Degree (music); Algebraic number; Combinatorics; Laplace operator; Upper and lower bounds; Simple (philosophy); Laplacian matrix; Graph; Discrete mathematics; Simple graph; Mathematical analysis","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.008399242,0.00295834,0.003696832,0.004960729,0.004034759,0.01003533,0.008310047,0.00504812,0.02571956],"category_scores_gemma":[0.08409644,0.002612737,0.003333254,0.004487177,0.01170972,0.0300775,0.008233983,0.01640086,0.004205452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00394178,"about_ca_system_score_gemma":0.001782761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002069779,"about_ca_topic_score_gemma":0.002339736,"domain_scores_codex":[0.9901431,0.002960327,0.0003748011,0.002808834,0.002473249,0.00123973],"domain_scores_gemma":[0.8735643,0.1025927,0.003568711,0.01277672,0.004565609,0.002932079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000391261,0.0002602277,0.001374951,0.0002966049,0.00006416208,0.0001513783,0.0007009389,0.01520897,0.001723514,0.9473666,0.01575998,0.01670152],"study_design_scores_gemma":[0.00002494868,0.00001256643,0.0002106271,0.0000227056,0.00001155892,0.00002917715,0.00005533028,0.01980644,0.0004852627,0.9781668,0.001152815,0.00002174613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2195588,0.004065811,0.5989416,0.03575282,0.001854615,0.0001950988,0.002458439,0.003154894,0.1340179],"genre_scores_gemma":[0.8884904,0.002272493,0.07473273,0.004248542,0.004716646,0.000592574,0.002359154,0.001535114,0.02105233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02571956,"threshold_uncertainty_score":0.0860405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02643588100475422,"score_gpt":0.3200946099895626,"score_spread":0.2936587289848084,"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."}}