{"id":"W4394591182","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Clique graph; Graph; Combinatorics; Block graph; Computer science; Clique problem; Simplex graph; Split graph; Mathematics; Line graph; Pathwidth; Voltage graph","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.0006952441,0.0009506426,0.001045281,0.0007913233,0.002540197,0.002060657,0.002048261,0.001513412,0.01144719],"category_scores_gemma":[0.004360297,0.0007466538,0.001509171,0.001982456,0.00130946,0.005139996,0.001851622,0.001964236,0.002066168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001296416,"about_ca_system_score_gemma":0.001344293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005003236,"about_ca_topic_score_gemma":0.007177232,"domain_scores_codex":[0.9985733,0.0003703823,0.00004601313,0.0005616741,0.000224668,0.0002239016],"domain_scores_gemma":[0.9972083,0.001605943,0.0002023172,0.0005601037,0.0001916623,0.0002317027],"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.001124166,0.0006160607,0.002349897,0.001359242,0.0003341282,0.001215855,0.001224087,0.1744829,0.02363567,0.5336351,0.08848516,0.1715379],"study_design_scores_gemma":[0.0002373957,0.0001609543,0.001700745,0.00009592916,0.00011897,0.0006115085,0.0005635879,0.3938264,0.008973806,0.5370425,0.05660164,0.00006649383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2094892,0.001522061,0.7093666,0.006121931,0.0003754635,0.0006728061,0.00516907,0.002468002,0.06481478],"genre_scores_gemma":[0.545764,0.001119282,0.419917,0.0008217918,0.0003574344,0.0005290504,0.006880002,0.000796213,0.02381526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01144719,"threshold_uncertainty_score":0.03829467,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03848027746986057,"score_gpt":0.1872659795534309,"score_spread":0.1487857020835704,"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."}}