{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238406,0.0007775053,0.001077599,0.002316301,0.001535746,0.003145233,0.001434128,0.001265678,0.01386107],"category_scores_gemma":[0.01413014,0.0009574021,0.0007045903,0.001949117,0.002809698,0.006813715,0.002658118,0.004405068,0.001880092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047724,"about_ca_system_score_gemma":0.0005539012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003182531,"about_ca_topic_score_gemma":0.0005711679,"domain_scores_codex":[0.999113,0.0002183774,0.00003982672,0.0002394691,0.0002448762,0.0001445188],"domain_scores_gemma":[0.9836821,0.01255382,0.001089485,0.0006842551,0.0005698272,0.001420491],"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.0002864951,0.00006444618,0.001426483,0.0002128598,0.00003274051,0.0001071626,0.0005725232,0.002016291,0.004792432,0.968159,0.005007179,0.0173224],"study_design_scores_gemma":[0.0000324654,0.0000234733,0.001572368,0.00002641889,0.00002454968,0.0001998537,0.00009888777,0.003928445,0.001332445,0.9902047,0.002540931,0.00001542687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6083681,0.002467735,0.1829981,0.008059063,0.0004412348,0.00009365734,0.002193879,0.0006945674,0.1946836],"genre_scores_gemma":[0.9602311,0.001149596,0.0183459,0.0004891273,0.0009084792,0.0001369209,0.0007454028,0.0002215058,0.01777195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01386107,"threshold_uncertainty_score":0.04636985,"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."}}