{"id":"W2382079786","doi":"10.1016/j.comgeo.2016.05.001","title":"An algorithm for the maximum weight independent set problem on outerstring graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Intersection graph; Independent set; Indifference graph; Chordal graph; Split graph; Block graph; Maximal independent set; Circle graph; Discrete mathematics; Time complexity; 1-planar graph; Pathwidth; Cograph; Graph; Line graph","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.0006282793,0.0002184484,0.0001594484,0.0004471951,0.0004500395,0.0002447301,0.0009087477,0.00007805012,0.00002811761],"category_scores_gemma":[0.00004066931,0.0001373924,0.0001337861,0.0008436881,0.00005620969,0.0006346052,0.0001300243,0.0001147692,0.00007206236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009028729,"about_ca_system_score_gemma":0.0001286471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003697362,"about_ca_topic_score_gemma":0.000001376586,"domain_scores_codex":[0.9979444,0.00008031024,0.0003465932,0.000602031,0.0006872851,0.0003394127],"domain_scores_gemma":[0.997706,0.001257592,0.0001563863,0.0004149654,0.0003230675,0.0001420171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001553206,0.0001217055,0.0001683424,0.000007926062,0.00006375227,0.000003653927,0.0001107841,0.07084528,0.0001455411,0.1187274,0.001594365,0.8081957],"study_design_scores_gemma":[0.001658783,0.0004973045,0.01120113,0.00004514771,0.00001891785,0.00004454148,0.00002864887,0.7134241,0.001169329,0.2601899,0.01127589,0.0004462826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007072503,0.0001054993,0.9888656,0.002250865,0.0008753033,0.0004802694,0.00006429858,0.0001603248,0.0001253997],"genre_scores_gemma":[0.6920705,0.00001366083,0.3058942,0.001078822,0.0004418281,0.0001336565,0.00008917142,0.00002111006,0.0002571052],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8077494,"threshold_uncertainty_score":0.5602698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02095456718722194,"score_gpt":0.2671733349264159,"score_spread":0.246218767739194,"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."}}