{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009868,0.0001804561,0.0002087276,0.001355729,0.0001469654,0.000196908,0.0006373269,0.00008102013,0.00001596623],"category_scores_gemma":[0.0001266718,0.0001901649,0.00005179516,0.0007325778,0.0001236307,0.0001978453,0.0001099081,0.0002312625,0.0000142483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001606932,"about_ca_system_score_gemma":0.0004269461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485441,"about_ca_topic_score_gemma":0.01169936,"domain_scores_codex":[0.998235,0.0001022828,0.0002198032,0.0005653234,0.0003661393,0.0005114592],"domain_scores_gemma":[0.9984968,0.0004804582,0.0000585391,0.0002875888,0.0002215015,0.0004550793],"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.00001434259,0.00001899562,0.0003714354,0.000009371942,0.000006985211,0.000006045489,0.000199143,0.1937319,0.00000768184,0.7891036,0.00007957395,0.01645096],"study_design_scores_gemma":[0.0003586666,0.00009893551,0.003872951,0.00002455681,8.576346e-7,0.000005630597,0.00004466876,0.5467315,0.00001130474,0.4485774,0.000146738,0.0001268139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1752529,0.00004685883,0.8200243,0.002100325,0.0001674614,0.0003606585,0.00005792032,0.0000430332,0.001946609],"genre_scores_gemma":[0.985227,0.000003398065,0.01412842,0.0004719986,0.00001433547,0.00004193455,0.00002433275,0.00001209328,0.00007645527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8099741,"threshold_uncertainty_score":0.7754698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04062558458719696,"score_gpt":0.28570176632086,"score_spread":0.2450761817336631,"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."}}