{"id":"W4406659047","doi":"10.30538/psrp-odam2022.0077","title":"On the largest real root of the independence polynomial of a unicyclic graph","year":2022,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Independence (probability theory); Root (linguistics); Graph; Combinatorics; Discrete mathematics; Computer science; Statistics; Linguistics; Philosophy","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647764,0.0001799687,0.0005238309,0.00009635161,0.0003972525,0.00003901759,0.002639054,0.00005459611,0.0002831974],"category_scores_gemma":[0.0002189169,0.0001011817,0.0002781412,0.0005460731,0.0002336075,0.00007210726,0.0007664829,0.0006314208,0.000002166715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319578,"about_ca_system_score_gemma":0.0001466807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020825,"about_ca_topic_score_gemma":0.00001329733,"domain_scores_codex":[0.9976847,0.0001766403,0.001017372,0.0001331192,0.0007953705,0.0001927747],"domain_scores_gemma":[0.9954666,0.001383804,0.002086501,0.0008967994,0.000106161,0.00006007394],"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.0001078424,0.0004670765,0.00003572403,0.00006403141,0.0001194558,0.000001447814,0.001694232,0.00008849918,0.006951863,0.9885602,0.001811396,0.00009824984],"study_design_scores_gemma":[0.000659594,0.0001574499,0.0001526652,0.0001076977,0.0001732506,0.00006092125,0.004048503,0.0000348311,0.01242193,0.981841,0.0002190939,0.000123084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9621077,0.00002016139,0.001167629,0.0009393085,0.00009358414,0.001059255,0.00009022329,0.000006996939,0.03451515],"genre_scores_gemma":[0.9948176,0.000009881691,0.004845284,0.00005843742,0.00002516711,0.00006637283,0.000001085271,0.00003087929,0.0001452797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03436987,"threshold_uncertainty_score":0.4904063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03516077578560541,"score_gpt":0.3020938802138552,"score_spread":0.2669331044282499,"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."}}