{"id":"W2588150890","doi":"10.4310/joc.2017.v8.n2.a2","title":"A linear time algorithm for finding a maximum independent set of a fullerene","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Fullerene Chemistry and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Algorithm; Fullerene; Computer science; Chemistry","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.0006625979,0.001713409,0.001864008,0.001991251,0.001860549,0.002345906,0.002791233,0.00201715,0.01483181],"category_scores_gemma":[0.002867119,0.001028641,0.002561962,0.003287472,0.0008979504,0.002959827,0.002586284,0.001718064,0.002714767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134959,"about_ca_system_score_gemma":0.003052571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004982402,"about_ca_topic_score_gemma":0.009615921,"domain_scores_codex":[0.9990786,0.0001072724,0.00005381375,0.0003280094,0.0002805862,0.0001516588],"domain_scores_gemma":[0.9987146,0.000757445,0.0001008453,0.0002037533,0.0001263522,0.00009703912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001516764,0.0007946969,0.002296801,0.001270339,0.0004253175,0.0003962445,0.0004792204,0.1331778,0.032765,0.03211167,0.02980419,0.7649619],"study_design_scores_gemma":[0.0009555776,0.000491354,0.002362225,0.00009321394,0.0003170055,0.0005342696,0.0004482002,0.8258969,0.02029982,0.1334445,0.01505246,0.000104467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1009999,0.0009870316,0.8621365,0.001463271,0.0002093203,0.001076863,0.00268675,0.007078058,0.02336231],"genre_scores_gemma":[0.1645361,0.0002274795,0.8246334,0.0001968491,0.00006538801,0.0004544021,0.003076267,0.0003296646,0.006480527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01483181,"threshold_uncertainty_score":0.04961735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03006367243714537,"score_gpt":0.2987736975752472,"score_spread":0.2687100251381018,"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."}}