{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054734,0.0002198588,0.0003360414,0.005565673,0.0001459342,0.000177684,0.001612295,0.00009759593,0.00005959331],"category_scores_gemma":[0.0001526723,0.0002265315,0.0003826905,0.00778534,0.0001083212,0.0009663014,0.0002662967,0.0002655241,0.0001228192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001278954,"about_ca_system_score_gemma":0.0002953381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008173115,"about_ca_topic_score_gemma":0.000001698067,"domain_scores_codex":[0.9963595,0.00009944257,0.001264273,0.000361863,0.001650727,0.0002642116],"domain_scores_gemma":[0.9946312,0.0007293748,0.001115552,0.0002987386,0.003051715,0.0001733675],"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.00009154731,0.000649858,0.003633115,0.0000578332,0.000731493,0.00003429872,0.0003000343,0.473211,0.002033402,0.2116287,0.005054611,0.3025741],"study_design_scores_gemma":[0.002706886,0.0005698204,0.07388803,0.0001333916,0.0001046998,0.0007816784,0.000227093,0.07071801,0.006160173,0.750403,0.0935284,0.0007788719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06246186,0.0003696351,0.9338477,0.001075401,0.001270185,0.0002983472,0.00004295095,0.0001196202,0.0005142589],"genre_scores_gemma":[0.953402,0.0001730952,0.04540423,0.0002035514,0.0004599213,0.00006761039,0.0001455243,0.00001883032,0.0001252059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8909402,"threshold_uncertainty_score":0.9237687,"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."}}