{"id":"W4389914592","doi":"10.1142/s021819592350005x","title":"Maximum Bipartite Subgraphs of Geometric Intersection Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Intersection graph; Intersection (aeronautics); Complete bipartite graph; Unit (ring theory); Unit disk graph; Set (abstract data type); Graph; Discrete mathematics; Line graph; Computer science","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.0009065592,0.001202041,0.001236479,0.001394596,0.00102293,0.001623432,0.002108963,0.001116412,0.007182082],"category_scores_gemma":[0.006564349,0.001100225,0.001349503,0.003246059,0.001258184,0.004610758,0.002722939,0.001770842,0.0008803093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001831371,"about_ca_system_score_gemma":0.0008997738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00344961,"about_ca_topic_score_gemma":0.003173529,"domain_scores_codex":[0.9982256,0.0006726161,0.0000593214,0.0003743215,0.0003640085,0.0003040207],"domain_scores_gemma":[0.9953454,0.002906038,0.0006146621,0.0005022997,0.0003455575,0.0002860347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007546666,0.0004736134,0.004721813,0.001185796,0.0002661879,0.0007871824,0.0008250867,0.4425941,0.01034885,0.3831024,0.02576456,0.1291758],"study_design_scores_gemma":[0.000104158,0.00008514214,0.001637656,0.00007524265,0.00008835264,0.0004006179,0.0002458381,0.5178356,0.004354482,0.465896,0.009244454,0.00003246025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.266888,0.001378624,0.7006409,0.001670346,0.00008887416,0.0003198827,0.00189821,0.001791205,0.02532402],"genre_scores_gemma":[0.7341965,0.00102569,0.2471144,0.0005018879,0.0001921767,0.0003663817,0.006884134,0.0009224289,0.008796445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007182082,"threshold_uncertainty_score":0.02402651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01568579419619957,"score_gpt":0.2849872331532422,"score_spread":0.2693014389570426,"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."}}