{"id":"W7109951950","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique graph; Block graph; Unit disk graph; Split graph; Clique problem; Perfect graph; Circle graph; Independent set; Time complexity","routes":{"ca_aff":true,"ca_fund":true,"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.0009151494,0.0002573156,0.0002460429,0.0004127225,0.0004967588,0.0006407628,0.001189652,0.0001356802,0.000003623641],"category_scores_gemma":[0.0000951578,0.0001981328,0.000172996,0.001137167,0.00008059118,0.001147449,0.0004199174,0.0003374491,0.00003866513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001146719,"about_ca_system_score_gemma":0.0001858962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000164761,"about_ca_topic_score_gemma":0.00007241801,"domain_scores_codex":[0.9978042,0.0000650798,0.000946402,0.0002619495,0.0003575174,0.0005648186],"domain_scores_gemma":[0.9985446,0.0003028624,0.0002357725,0.0006057436,0.0002178916,0.00009316495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001562281,0.0004633478,0.006511962,0.0005189173,0.000175978,0.000006302105,0.00522027,0.007885953,0.0001196859,0.7831103,0.0101818,0.1856492],"study_design_scores_gemma":[0.004291177,0.0002707391,0.01021707,0.0003378188,0.00002853527,0.00004041437,0.0006722788,0.3876466,0.001512453,0.2016987,0.3924921,0.0007921456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03028687,0.0001738238,0.9533611,0.002926802,0.001230936,0.001474102,0.00005683343,0.0001712824,0.01031823],"genre_scores_gemma":[0.8811935,0.0002235445,0.1091604,0.004499674,0.0001939303,0.0008100202,0.0003263322,0.00003483981,0.003557805],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8509066,"threshold_uncertainty_score":0.807962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00750876146877969,"score_gpt":0.2511461712961794,"score_spread":0.2436374098273998,"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."}}