{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355469,0.0009185125,0.001135558,0.0008845541,0.002508143,0.001969495,0.00189801,0.001487382,0.00964988],"category_scores_gemma":[0.004682232,0.0007762515,0.00164517,0.002122084,0.00132416,0.005034972,0.001856296,0.001927498,0.001748154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414881,"about_ca_system_score_gemma":0.001301576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004793055,"about_ca_topic_score_gemma":0.006017575,"domain_scores_codex":[0.9983525,0.000427049,0.00005727066,0.000626686,0.0002846475,0.0002518249],"domain_scores_gemma":[0.9967925,0.001869373,0.0002605338,0.0005832328,0.000252826,0.0002414701],"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.001088552,0.0005655704,0.002319801,0.001574101,0.0004177806,0.001304207,0.001132101,0.1805944,0.02137526,0.5282374,0.09004241,0.1713486],"study_design_scores_gemma":[0.000238076,0.0001447259,0.00168692,0.0000973571,0.0001147388,0.0006416243,0.0004989018,0.3328947,0.007023624,0.5943302,0.06226102,0.0000680308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1838084,0.00204878,0.7372825,0.006008609,0.0004506468,0.0007176616,0.005769239,0.002293745,0.06162035],"genre_scores_gemma":[0.5431082,0.001516067,0.4215655,0.0008656144,0.0004484866,0.0005999439,0.007845117,0.000778375,0.02327267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00964988,"threshold_uncertainty_score":0.03228205,"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."}}