{"id":"W2038878443","doi":"10.1016/s0304-3975(03)00422-5","title":"Finding hidden independent sets in interval graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Interval graph; Interval (graph theory); Set (abstract data type); Computer science; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Chordal 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.002677137,0.0001908824,0.0002155195,0.0004114895,0.0002640606,0.0004803636,0.002256912,0.00005621637,0.00006405947],"category_scores_gemma":[0.0001853196,0.0001602365,0.00006824093,0.00167165,0.0009060149,0.0005585562,0.0007392179,0.0004624987,0.00009313395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007217877,"about_ca_system_score_gemma":0.0001182093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009338649,"about_ca_topic_score_gemma":0.000001663075,"domain_scores_codex":[0.9971974,0.0002806966,0.0003001672,0.0007890232,0.0007306052,0.0007021139],"domain_scores_gemma":[0.9987643,0.0001996077,0.00006183844,0.0006569987,0.00006700991,0.0002502598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001588695,0.00004901097,0.001477575,0.000003428868,0.000001576287,0.00004098289,0.0005954136,0.0001472223,0.00007118892,0.9454371,0.00001326844,0.0521616],"study_design_scores_gemma":[0.0003969447,0.0001764829,0.007739767,0.00005311284,0.000001701389,0.0001230013,0.00001445182,0.591217,0.001318321,0.3984935,0.000141575,0.0003240781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027978,0.00002374136,0.788255,0.0004907928,0.0008850132,0.0001059827,3.371447e-7,0.0001565115,0.007284787],"genre_scores_gemma":[0.8522149,0.0000017223,0.1473991,0.0003317121,0.00002660532,0.000004246646,2.331311e-7,0.00000620515,0.0000152581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6494171,"threshold_uncertainty_score":0.6534254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01100445987876518,"score_gpt":0.2695621984548484,"score_spread":0.2585577385760832,"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."}}