{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004413322,0.002197247,0.003636595,0.003673957,0.004192434,0.004771722,0.006887211,0.003461889,0.01305413],"category_scores_gemma":[0.02676651,0.001952921,0.003762051,0.01038213,0.004975485,0.01682337,0.007103477,0.01558537,0.002749819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002779154,"about_ca_system_score_gemma":0.00146164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003391702,"about_ca_topic_score_gemma":0.00385051,"domain_scores_codex":[0.9958835,0.001127158,0.0002753143,0.001036334,0.001289187,0.0003884396],"domain_scores_gemma":[0.9720757,0.02238159,0.0006723232,0.002854296,0.001322077,0.0006939648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004593009,0.0001194853,0.0006828816,0.0008537258,0.000122404,0.0003393186,0.0005056692,0.03033186,0.002812497,0.8273858,0.05602085,0.08036628],"study_design_scores_gemma":[0.00003930533,0.00005632029,0.0004410538,0.0001025096,0.00008228933,0.0001616689,0.00009676108,0.03162783,0.001436763,0.9414773,0.02442447,0.00005380104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01945709,0.0112323,0.8634326,0.01473374,0.006545037,0.0001946867,0.001275479,0.0009480378,0.08218104],"genre_scores_gemma":[0.3390424,0.02295858,0.5666546,0.008425834,0.01895641,0.0009714121,0.00263576,0.00202881,0.0383261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01305413,"threshold_uncertainty_score":0.04367042,"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."}}