{"id":"W2155875791","doi":"10.1016/j.ipl.2003.09.019","title":"A note on maximum independent sets in rectangle intersection graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Rectangle; Intersection (aeronautics); Upper and lower bounds; Intersection graph; Running time; Integer (computer science); Constant (computer programming); Time complexity; Approximation algorithm; Independent set; Discrete mathematics; Graph; Algorithm; Computer science; Line graph; Geometry","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.0003697507,0.0001063161,0.0000782913,0.000579681,0.0001184422,0.0002906561,0.0001737445,0.00004864456,0.000006547107],"category_scores_gemma":[0.00007494896,0.0001081745,0.00003151259,0.000828624,0.00001314566,0.002732573,0.00002183466,0.0001558997,0.00006587302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001470199,"about_ca_system_score_gemma":0.00007254849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006790794,"about_ca_topic_score_gemma":0.000006335499,"domain_scores_codex":[0.9990016,0.00005518752,0.0003084,0.0001504165,0.0003142431,0.000170147],"domain_scores_gemma":[0.999578,0.00003129016,0.0001462856,0.0001344139,0.00007014731,0.00003985242],"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.0000536477,0.000135871,0.000759432,0.0001170152,0.0000113359,0.00001199815,0.01222022,0.1146241,0.003992071,0.0332527,0.002560856,0.8322608],"study_design_scores_gemma":[0.006381866,0.0006093936,0.03226685,0.0007430492,0.00001878508,0.000390022,0.000905651,0.7657507,0.05520372,0.06610902,0.06941857,0.002202348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050064,0.00001160979,0.789466,0.001574383,0.0005427529,0.0001433296,6.889512e-7,0.0001101931,0.003144596],"genre_scores_gemma":[0.9819676,0.000001294016,0.01272837,0.005242375,0.00001252547,0.00002161752,0.00001342527,0.000003376497,0.000009376617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8300585,"threshold_uncertainty_score":0.4411229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01023388897993671,"score_gpt":0.2389956860104497,"score_spread":0.228761797030513,"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."}}