{"id":"W2905635537","doi":"10.48550/arxiv.1812.09775","title":"Maximum Modulus of Independence Roots of Graphs and Trees","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph; Dalhousie University","funders":"","keywords":"Combinatorics; Independence number; Independence (probability theory); Mathematics; Graph; Upper and lower bounds; Polynomial; Discrete mathematics; Mathematical analysis; Statistics","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.0009151044,0.0008103413,0.0007268036,0.001264005,0.0008338641,0.001727688,0.001197432,0.0006839337,0.008920806],"category_scores_gemma":[0.01250762,0.0005667598,0.0008769408,0.001165382,0.002385323,0.005012241,0.00235755,0.003418442,0.001531834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648925,"about_ca_system_score_gemma":0.000657544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007866312,"about_ca_topic_score_gemma":0.001109105,"domain_scores_codex":[0.9991258,0.0001610444,0.00002659992,0.0002494996,0.0002493534,0.0001877363],"domain_scores_gemma":[0.9885588,0.00845357,0.000900605,0.0008952034,0.0004382652,0.000753683],"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.000870656,0.0001534102,0.005144997,0.0005199691,0.00008017819,0.0002961829,0.0006060404,0.04784804,0.020718,0.8489061,0.01907483,0.0557816],"study_design_scores_gemma":[0.00005847279,0.00007027349,0.003534248,0.00003992589,0.0000510711,0.0004141471,0.00007422912,0.07844183,0.00670736,0.9044809,0.006091688,0.00003578319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5668463,0.002364653,0.3361285,0.006627369,0.0002125739,0.00009793598,0.00200751,0.001230628,0.08448455],"genre_scores_gemma":[0.9646313,0.0008859515,0.0220397,0.0003554531,0.00047198,0.0001115493,0.0007769178,0.0003480903,0.01037915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008920806,"threshold_uncertainty_score":0.02984309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08364782340438444,"score_gpt":0.2210497515119239,"score_spread":0.1374019281075395,"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."}}