{"id":"W3011118259","doi":"10.1007/s00373-020-02160-1","title":"Maximum Modulus of Independence Roots of Graphs and Trees","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Independence number; Independence (probability theory); Upper and lower bounds; Graph; Polynomial; Discrete mathematics; Mathematical analysis; Statistics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514877,0.0001148573,0.0002566667,0.00007460547,0.00006739682,0.000009557296,0.0001383009,0.00007969513,0.000007343391],"category_scores_gemma":[0.00005878064,0.0001052058,0.00006297542,0.000463887,0.0001625419,0.00005912775,0.00007133766,0.0001146625,3.985529e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001773744,"about_ca_system_score_gemma":0.00001102304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001051277,"about_ca_topic_score_gemma":0.000003484022,"domain_scores_codex":[0.9992485,0.00003078049,0.0002535741,0.00018102,0.0001703671,0.000115743],"domain_scores_gemma":[0.9993547,0.0001167368,0.0001512963,0.0001936931,0.00008293283,0.0001006074],"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.00001543389,0.0001100616,0.007455513,0.0001532173,0.00002755476,0.00000104298,0.0004373582,4.357368e-7,0.001640578,0.9889973,0.0001954348,0.0009660714],"study_design_scores_gemma":[0.0004109891,0.0001473654,0.008620623,0.00002162106,0.00004639231,0.000003144544,0.000283272,0.00008964658,0.003229172,0.9869573,0.00008805199,0.0001024522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9977687,0.0005588423,0.0002803537,0.0001656425,0.00003843191,0.0001531753,0.00002036695,0.00003542672,0.0009790785],"genre_scores_gemma":[0.9992966,0.0002569795,0.0003679215,0.0000312019,0.000001987445,0.00001116067,0.000001504845,0.00001031821,0.00002230536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002040029,"threshold_uncertainty_score":0.4290168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02951197183391047,"score_gpt":0.2578558294510321,"score_spread":0.2283438576171216,"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."}}